./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.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_2.cil-1+token_ring.01.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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:34,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:34,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:34,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:34,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:34,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:34,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:34,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:34,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:34,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:34,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:34,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:34,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:34,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:34,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:34,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:34,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:34,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:34,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:34,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:34,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:34,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:34,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:34,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:35,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:35,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:35,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:35,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:35,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:35,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:35,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:35,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:35,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:35,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:35,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:35,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:35,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:35,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:35,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:35,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:35,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:35,016 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:56:35,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:35,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:35,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:35,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:35,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:35,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:35,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:35,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:35,051 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:35,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:35,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:35,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:35,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:35,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:35,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:35,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:35,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:35,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:35,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:35,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:35,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:35,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:35,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:35,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:35,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:35,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:35,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:35,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:35,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:35,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:35,057 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:35,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:35,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:35,058 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2022-02-20 19:56:35,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:35,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:35,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:35,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:35,325 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:35,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-02-20 19:56:35,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f385ca6/936990a637144a53bc33a08b87428171/FLAG23b39a835 [2022-02-20 19:56:35,746 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:35,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-02-20 19:56:35,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f385ca6/936990a637144a53bc33a08b87428171/FLAG23b39a835 [2022-02-20 19:56:35,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f385ca6/936990a637144a53bc33a08b87428171 [2022-02-20 19:56:35,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:35,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:35,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:35,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:35,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:35,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:35" (1/1) ... [2022-02-20 19:56:35,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aca73b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:35, skipping insertion in model container [2022-02-20 19:56:35,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:35" (1/1) ... [2022-02-20 19:56:35,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:35,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:35,924 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-02-20 19:56:35,965 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-02-20 19:56:36,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:36,008 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:36,024 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_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-02-20 19:56:36,045 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_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-02-20 19:56:36,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:36,083 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:36,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36 WrapperNode [2022-02-20 19:56:36,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:36,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:36,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:36,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:36,093 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:56:36" (1/1) ... [2022-02-20 19:56:36,101 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:56:36" (1/1) ... [2022-02-20 19:56:36,136 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2022-02-20 19:56:36,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:36,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:36,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:36,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:36,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:36,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:36,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:36,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:36,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (1/1) ... [2022-02-20 19:56:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:36,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:36,202 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:56:36,203 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:56:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:56:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:56:36,313 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:36,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:36,848 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:36,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:36,857 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:56:36,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:36 BoogieIcfgContainer [2022-02-20 19:56:36,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:36,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:36,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:36,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:36,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:35" (1/3) ... [2022-02-20 19:56:36,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb3b2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:36, skipping insertion in model container [2022-02-20 19:56:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:36" (2/3) ... [2022-02-20 19:56:36,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb3b2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:36, skipping insertion in model container [2022-02-20 19:56:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:36" (3/3) ... [2022-02-20 19:56:36,876 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-02-20 19:56:36,881 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:36,881 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:36,932 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:36,940 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:56:36,940 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:56:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:56:36,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:36,980 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] [2022-02-20 19:56:36,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-02-20 19:56:36,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:36,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26030608] [2022-02-20 19:56:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,245 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {219#true} {221#(= ~M_E~0 2)} #705#return; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {256#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#(= |old(~M_E~0)| 0)} assume true; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,318 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {256#(= |old(~M_E~0)| 0)} {221#(= ~M_E~0 2)} #707#return; {220#false} is VALID [2022-02-20 19:56:37,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {219#true} is VALID [2022-02-20 19:56:37,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume !(1 == ~m_pc~0); {219#true} is VALID [2022-02-20 19:56:37,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} is_master_triggered_~__retres1~4#1 := 0; {219#true} is VALID [2022-02-20 19:56:37,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {219#true} is VALID [2022-02-20 19:56:37,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {219#true} is VALID [2022-02-20 19:56:37,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {219#true} is VALID [2022-02-20 19:56:37,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {219#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; {219#true} is VALID [2022-02-20 19:56:37,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#true} assume 1 == ~t1_pc~0; {219#true} is VALID [2022-02-20 19:56:37,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {219#true} is VALID [2022-02-20 19:56:37,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {219#true} is VALID [2022-02-20 19:56:37,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {219#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {219#true} is VALID [2022-02-20 19:56:37,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {219#true} is VALID [2022-02-20 19:56:37,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,379 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {219#true} {220#false} #709#return; {220#false} is VALID [2022-02-20 19:56:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume !(1 == ~T1_E~0); {219#true} is VALID [2022-02-20 19:56:37,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume 1 == ~E_M~0;~E_M~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} assume 1 == ~E_1~0;~E_1~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,397 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {219#true} {220#false} #711#return; {220#false} is VALID [2022-02-20 19:56:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:37,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} havoc ~__retres1~6; {219#true} is VALID [2022-02-20 19:56:37,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {219#true} is VALID [2022-02-20 19:56:37,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} #res := ~__retres1~6; {219#true} is VALID [2022-02-20 19:56:37,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,407 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {219#true} {220#false} #713#return; {220#false} is VALID [2022-02-20 19:56:37,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#(= ~M_E~0 2)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {221#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {221#(= ~M_E~0 2)} call update_channels2(); {219#true} is VALID [2022-02-20 19:56:37,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,415 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {219#true} {221#(= ~M_E~0 2)} #705#return; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {221#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:37,418 INFO L272 TraceCheckUtils]: 11: Hoare triple {221#(= ~M_E~0 2)} call fire_delta_events2(); {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:37,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {256#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#(= |old(~M_E~0)| 0)} assume true; {256#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:37,430 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {256#(= |old(~M_E~0)| 0)} {221#(= ~M_E~0 2)} #707#return; {220#false} is VALID [2022-02-20 19:56:37,430 INFO L272 TraceCheckUtils]: 18: Hoare triple {220#false} call activate_threads2(); {257#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:37,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {219#true} is VALID [2022-02-20 19:56:37,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {219#true} assume !(1 == ~m_pc~0); {219#true} is VALID [2022-02-20 19:56:37,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {219#true} is_master_triggered_~__retres1~4#1 := 0; {219#true} is VALID [2022-02-20 19:56:37,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {219#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {219#true} is VALID [2022-02-20 19:56:37,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {219#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {219#true} is VALID [2022-02-20 19:56:37,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {219#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {219#true} is VALID [2022-02-20 19:56:37,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {219#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; {219#true} is VALID [2022-02-20 19:56:37,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {219#true} assume 1 == ~t1_pc~0; {219#true} is VALID [2022-02-20 19:56:37,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {219#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {219#true} is VALID [2022-02-20 19:56:37,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {219#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {219#true} is VALID [2022-02-20 19:56:37,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {219#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {219#true} is VALID [2022-02-20 19:56:37,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {219#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {219#true} is VALID [2022-02-20 19:56:37,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,435 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {219#true} {220#false} #709#return; {220#false} is VALID [2022-02-20 19:56:37,435 INFO L272 TraceCheckUtils]: 33: Hoare triple {220#false} call reset_delta_events2(); {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:37,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {255#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {219#true} assume !(1 == ~T1_E~0); {219#true} is VALID [2022-02-20 19:56:37,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {219#true} assume 1 == ~E_M~0;~E_M~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {219#true} assume 1 == ~E_1~0;~E_1~0 := 2; {219#true} is VALID [2022-02-20 19:56:37,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,437 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {219#true} {220#false} #711#return; {220#false} is VALID [2022-02-20 19:56:37,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 19:56:37,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {220#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_~tmp~5#1;havoc eval2_~tmp~5#1; {220#false} is VALID [2022-02-20 19:56:37,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 19:56:37,438 INFO L272 TraceCheckUtils]: 43: Hoare triple {220#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {219#true} is VALID [2022-02-20 19:56:37,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {219#true} havoc ~__retres1~6; {219#true} is VALID [2022-02-20 19:56:37,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {219#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {219#true} is VALID [2022-02-20 19:56:37,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {219#true} #res := ~__retres1~6; {219#true} is VALID [2022-02-20 19:56:37,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 19:56:37,440 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {219#true} {220#false} #713#return; {220#false} is VALID [2022-02-20 19:56:37,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {220#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; {220#false} is VALID [2022-02-20 19:56:37,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {220#false} assume 0 != eval2_~tmp~5#1; {220#false} is VALID [2022-02-20 19:56:37,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {220#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; {220#false} is VALID [2022-02-20 19:56:37,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {220#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {220#false} is VALID [2022-02-20 19:56:37,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {220#false} assume !(0 == ~m_pc~0); {220#false} is VALID [2022-02-20 19:56:37,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {220#false} assume 1 == ~m_pc~0; {220#false} is VALID [2022-02-20 19:56:37,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {220#false} assume ~token~0 != 1 + ~local~0; {220#false} is VALID [2022-02-20 19:56:37,441 INFO L272 TraceCheckUtils]: 56: Hoare triple {220#false} call error2(); {220#false} is VALID [2022-02-20 19:56:37,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 19:56:37,442 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:56:37,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:37,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26030608] [2022-02-20 19:56:37,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26030608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:37,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:37,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:56:37,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010835081] [2022-02-20 19:56:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:37,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:37,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:37,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:37,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:56:37,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:56:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:56:37,550 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:39,626 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2022-02-20 19:56:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:56:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 832 transitions. [2022-02-20 19:56:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 832 transitions. [2022-02-20 19:56:39,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 832 transitions. [2022-02-20 19:56:40,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 832 edges. 832 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:40,380 INFO L225 Difference]: With dead ends: 552 [2022-02-20 19:56:40,381 INFO L226 Difference]: Without dead ends: 343 [2022-02-20 19:56:40,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:56:40,388 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:40,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 794 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-20 19:56:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2022-02-20 19:56:40,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:40,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:40,442 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:40,444 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:40,464 INFO L93 Difference]: Finished difference Result 343 states and 490 transitions. [2022-02-20 19:56:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 490 transitions. [2022-02-20 19:56:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:40,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:40,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) Second operand 343 states. [2022-02-20 19:56:40,470 INFO L87 Difference]: Start difference. First operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) Second operand 343 states. [2022-02-20 19:56:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:40,488 INFO L93 Difference]: Finished difference Result 343 states and 490 transitions. [2022-02-20 19:56:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 490 transitions. [2022-02-20 19:56:40,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:40,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:40,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:40,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2022-02-20 19:56:40,506 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2022-02-20 19:56:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:40,507 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2022-02-20 19:56:40,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2022-02-20 19:56:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:56:40,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:40,509 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] [2022-02-20 19:56:40,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:40,510 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-02-20 19:56:40,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:40,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541199574] [2022-02-20 19:56:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,558 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2129#true} {2131#(= ~T1_E~0 ~M_E~0)} #705#return; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2166#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:40,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,593 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2131#(= ~T1_E~0 ~M_E~0)} #707#return; {2130#false} is VALID [2022-02-20 19:56:40,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {2168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {2129#true} is VALID [2022-02-20 19:56:40,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {2129#true} assume !(1 == ~m_pc~0); {2129#true} is VALID [2022-02-20 19:56:40,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#true} is_master_triggered_~__retres1~4#1 := 0; {2129#true} is VALID [2022-02-20 19:56:40,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {2129#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2129#true} is VALID [2022-02-20 19:56:40,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {2129#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {2129#true} is VALID [2022-02-20 19:56:40,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2129#true} is VALID [2022-02-20 19:56:40,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {2129#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; {2129#true} is VALID [2022-02-20 19:56:40,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {2129#true} assume 1 == ~t1_pc~0; {2129#true} is VALID [2022-02-20 19:56:40,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {2129#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2129#true} is VALID [2022-02-20 19:56:40,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {2129#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2129#true} is VALID [2022-02-20 19:56:40,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {2129#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {2129#true} is VALID [2022-02-20 19:56:40,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {2129#true} is VALID [2022-02-20 19:56:40,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,614 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2129#true} {2130#false} #709#return; {2130#false} is VALID [2022-02-20 19:56:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2129#true} is VALID [2022-02-20 19:56:40,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2129#true} assume !(1 == ~T1_E~0); {2129#true} is VALID [2022-02-20 19:56:40,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2129#true} is VALID [2022-02-20 19:56:40,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {2129#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2129#true} is VALID [2022-02-20 19:56:40,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,621 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2129#true} {2130#false} #711#return; {2130#false} is VALID [2022-02-20 19:56:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:40,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {2129#true} havoc ~__retres1~6; {2129#true} is VALID [2022-02-20 19:56:40,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {2129#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2129#true} is VALID [2022-02-20 19:56:40,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#true} #res := ~__retres1~6; {2129#true} is VALID [2022-02-20 19:56:40,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,626 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2129#true} {2130#false} #713#return; {2130#false} is VALID [2022-02-20 19:56:40,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {2129#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {2129#true} is VALID [2022-02-20 19:56:40,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,630 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2129#true} {2131#(= ~T1_E~0 ~M_E~0)} #705#return; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {2131#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:40,632 INFO L272 TraceCheckUtils]: 11: Hoare triple {2131#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:40,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2166#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:40,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {2166#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:40,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2167#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2131#(= ~T1_E~0 ~M_E~0)} #707#return; {2130#false} is VALID [2022-02-20 19:56:40,635 INFO L272 TraceCheckUtils]: 18: Hoare triple {2130#false} call activate_threads2(); {2168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:40,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {2168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {2129#true} is VALID [2022-02-20 19:56:40,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {2129#true} assume !(1 == ~m_pc~0); {2129#true} is VALID [2022-02-20 19:56:40,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {2129#true} is_master_triggered_~__retres1~4#1 := 0; {2129#true} is VALID [2022-02-20 19:56:40,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {2129#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2129#true} is VALID [2022-02-20 19:56:40,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {2129#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {2129#true} is VALID [2022-02-20 19:56:40,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {2129#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2129#true} is VALID [2022-02-20 19:56:40,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {2129#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; {2129#true} is VALID [2022-02-20 19:56:40,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {2129#true} assume 1 == ~t1_pc~0; {2129#true} is VALID [2022-02-20 19:56:40,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {2129#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2129#true} is VALID [2022-02-20 19:56:40,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {2129#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2129#true} is VALID [2022-02-20 19:56:40,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {2129#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {2129#true} is VALID [2022-02-20 19:56:40,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {2129#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {2129#true} is VALID [2022-02-20 19:56:40,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,638 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2129#true} {2130#false} #709#return; {2130#false} is VALID [2022-02-20 19:56:40,638 INFO L272 TraceCheckUtils]: 33: Hoare triple {2130#false} call reset_delta_events2(); {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:40,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {2165#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2129#true} is VALID [2022-02-20 19:56:40,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {2129#true} assume !(1 == ~T1_E~0); {2129#true} is VALID [2022-02-20 19:56:40,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {2129#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2129#true} is VALID [2022-02-20 19:56:40,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {2129#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2129#true} is VALID [2022-02-20 19:56:40,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,639 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2129#true} {2130#false} #711#return; {2130#false} is VALID [2022-02-20 19:56:40,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {2130#false} assume !false; {2130#false} is VALID [2022-02-20 19:56:40,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {2130#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_~tmp~5#1;havoc eval2_~tmp~5#1; {2130#false} is VALID [2022-02-20 19:56:40,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {2130#false} assume !false; {2130#false} is VALID [2022-02-20 19:56:40,640 INFO L272 TraceCheckUtils]: 43: Hoare triple {2130#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {2129#true} is VALID [2022-02-20 19:56:40,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {2129#true} havoc ~__retres1~6; {2129#true} is VALID [2022-02-20 19:56:40,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {2129#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2129#true} is VALID [2022-02-20 19:56:40,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {2129#true} #res := ~__retres1~6; {2129#true} is VALID [2022-02-20 19:56:40,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {2129#true} assume true; {2129#true} is VALID [2022-02-20 19:56:40,641 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2129#true} {2130#false} #713#return; {2130#false} is VALID [2022-02-20 19:56:40,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {2130#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; {2130#false} is VALID [2022-02-20 19:56:40,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {2130#false} assume 0 != eval2_~tmp~5#1; {2130#false} is VALID [2022-02-20 19:56:40,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {2130#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; {2130#false} is VALID [2022-02-20 19:56:40,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {2130#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {2130#false} is VALID [2022-02-20 19:56:40,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {2130#false} assume !(0 == ~m_pc~0); {2130#false} is VALID [2022-02-20 19:56:40,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {2130#false} assume 1 == ~m_pc~0; {2130#false} is VALID [2022-02-20 19:56:40,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {2130#false} assume ~token~0 != 1 + ~local~0; {2130#false} is VALID [2022-02-20 19:56:40,643 INFO L272 TraceCheckUtils]: 56: Hoare triple {2130#false} call error2(); {2130#false} is VALID [2022-02-20 19:56:40,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {2130#false} assume !false; {2130#false} is VALID [2022-02-20 19:56:40,655 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:56:40,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:40,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541199574] [2022-02-20 19:56:40,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541199574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:40,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:40,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:40,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901585388] [2022-02-20 19:56:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:40,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:40,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:40,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:40,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:40,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:40,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:40,702 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,893 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2022-02-20 19:56:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 635 transitions. [2022-02-20 19:56:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 635 transitions. [2022-02-20 19:56:42,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 635 transitions. [2022-02-20 19:56:43,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:43,389 INFO L225 Difference]: With dead ends: 651 [2022-02-20 19:56:43,389 INFO L226 Difference]: Without dead ends: 456 [2022-02-20 19:56:43,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:56:43,391 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:43,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 918 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-02-20 19:56:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2022-02-20 19:56:43,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:43,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:43,419 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:43,421 INFO L87 Difference]: Start difference. First operand 456 states. Second operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:43,441 INFO L93 Difference]: Finished difference Result 456 states and 650 transitions. [2022-02-20 19:56:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 650 transitions. [2022-02-20 19:56:43,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:43,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:43,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 456 states. [2022-02-20 19:56:43,446 INFO L87 Difference]: Start difference. First operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 456 states. [2022-02-20 19:56:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:43,466 INFO L93 Difference]: Finished difference Result 456 states and 650 transitions. [2022-02-20 19:56:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 650 transitions. [2022-02-20 19:56:43,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:43,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:43,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:43,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2022-02-20 19:56:43,487 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2022-02-20 19:56:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:43,488 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2022-02-20 19:56:43,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2022-02-20 19:56:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:56:43,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:43,490 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] [2022-02-20 19:56:43,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:43,490 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-02-20 19:56:43,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:43,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844178808] [2022-02-20 19:56:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,526 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4517#true} {4519#(= ~E_M~0 ~M_E~0)} #705#return; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:43,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:43,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,554 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {4519#(= ~E_M~0 ~M_E~0)} #707#return; {4518#false} is VALID [2022-02-20 19:56:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {4556#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {4517#true} is VALID [2022-02-20 19:56:43,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {4517#true} assume !(1 == ~m_pc~0); {4517#true} is VALID [2022-02-20 19:56:43,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {4517#true} is_master_triggered_~__retres1~4#1 := 0; {4517#true} is VALID [2022-02-20 19:56:43,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {4517#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4517#true} is VALID [2022-02-20 19:56:43,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {4517#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {4517#true} is VALID [2022-02-20 19:56:43,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {4517#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4517#true} is VALID [2022-02-20 19:56:43,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {4517#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; {4517#true} is VALID [2022-02-20 19:56:43,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {4517#true} assume 1 == ~t1_pc~0; {4517#true} is VALID [2022-02-20 19:56:43,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {4517#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4517#true} is VALID [2022-02-20 19:56:43,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {4517#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4517#true} is VALID [2022-02-20 19:56:43,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {4517#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {4517#true} is VALID [2022-02-20 19:56:43,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {4517#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {4517#true} is VALID [2022-02-20 19:56:43,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,574 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4517#true} {4518#false} #709#return; {4518#false} is VALID [2022-02-20 19:56:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4517#true} is VALID [2022-02-20 19:56:43,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {4517#true} assume !(1 == ~T1_E~0); {4517#true} is VALID [2022-02-20 19:56:43,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {4517#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4517#true} is VALID [2022-02-20 19:56:43,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {4517#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4517#true} is VALID [2022-02-20 19:56:43,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,580 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4517#true} {4518#false} #711#return; {4518#false} is VALID [2022-02-20 19:56:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:43,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {4517#true} havoc ~__retres1~6; {4517#true} is VALID [2022-02-20 19:56:43,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {4517#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4517#true} is VALID [2022-02-20 19:56:43,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {4517#true} #res := ~__retres1~6; {4517#true} is VALID [2022-02-20 19:56:43,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,586 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4517#true} {4518#false} #713#return; {4518#false} is VALID [2022-02-20 19:56:43,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {4517#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} call update_channels2(); {4517#true} is VALID [2022-02-20 19:56:43,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,589 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4517#true} {4519#(= ~E_M~0 ~M_E~0)} #705#return; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {4519#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:56:43,591 INFO L272 TraceCheckUtils]: 11: Hoare triple {4519#(= ~E_M~0 ~M_E~0)} call fire_delta_events2(); {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:43,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:43,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:43,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {4554#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:43,593 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4555#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {4519#(= ~E_M~0 ~M_E~0)} #707#return; {4518#false} is VALID [2022-02-20 19:56:43,593 INFO L272 TraceCheckUtils]: 18: Hoare triple {4518#false} call activate_threads2(); {4556#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {4556#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {4517#true} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {4517#true} assume !(1 == ~m_pc~0); {4517#true} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {4517#true} is_master_triggered_~__retres1~4#1 := 0; {4517#true} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {4517#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4517#true} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {4517#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {4517#true} is VALID [2022-02-20 19:56:43,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {4517#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4517#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; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {4517#true} assume 1 == ~t1_pc~0; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {4517#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {4517#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {4517#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {4517#true} is VALID [2022-02-20 19:56:43,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {4517#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {4517#true} is VALID [2022-02-20 19:56:43,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,596 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4517#true} {4518#false} #709#return; {4518#false} is VALID [2022-02-20 19:56:43,596 INFO L272 TraceCheckUtils]: 33: Hoare triple {4518#false} call reset_delta_events2(); {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:43,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {4553#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4517#true} is VALID [2022-02-20 19:56:43,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {4517#true} assume !(1 == ~T1_E~0); {4517#true} is VALID [2022-02-20 19:56:43,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {4517#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4517#true} is VALID [2022-02-20 19:56:43,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {4517#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4517#true} is VALID [2022-02-20 19:56:43,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,597 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4517#true} {4518#false} #711#return; {4518#false} is VALID [2022-02-20 19:56:43,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {4518#false} assume !false; {4518#false} is VALID [2022-02-20 19:56:43,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {4518#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_~tmp~5#1;havoc eval2_~tmp~5#1; {4518#false} is VALID [2022-02-20 19:56:43,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {4518#false} assume !false; {4518#false} is VALID [2022-02-20 19:56:43,598 INFO L272 TraceCheckUtils]: 43: Hoare triple {4518#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {4517#true} is VALID [2022-02-20 19:56:43,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {4517#true} havoc ~__retres1~6; {4517#true} is VALID [2022-02-20 19:56:43,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {4517#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4517#true} is VALID [2022-02-20 19:56:43,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {4517#true} #res := ~__retres1~6; {4517#true} is VALID [2022-02-20 19:56:43,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {4517#true} assume true; {4517#true} is VALID [2022-02-20 19:56:43,598 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4517#true} {4518#false} #713#return; {4518#false} is VALID [2022-02-20 19:56:43,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {4518#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; {4518#false} is VALID [2022-02-20 19:56:43,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {4518#false} assume 0 != eval2_~tmp~5#1; {4518#false} is VALID [2022-02-20 19:56:43,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {4518#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; {4518#false} is VALID [2022-02-20 19:56:43,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {4518#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {4518#false} is VALID [2022-02-20 19:56:43,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {4518#false} assume !(0 == ~m_pc~0); {4518#false} is VALID [2022-02-20 19:56:43,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {4518#false} assume 1 == ~m_pc~0; {4518#false} is VALID [2022-02-20 19:56:43,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {4518#false} assume ~token~0 != 1 + ~local~0; {4518#false} is VALID [2022-02-20 19:56:43,600 INFO L272 TraceCheckUtils]: 56: Hoare triple {4518#false} call error2(); {4518#false} is VALID [2022-02-20 19:56:43,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {4518#false} assume !false; {4518#false} is VALID [2022-02-20 19:56:43,600 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:56:43,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:43,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844178808] [2022-02-20 19:56:43,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844178808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:43,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:43,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:43,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853234752] [2022-02-20 19:56:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:43,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:43,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:43,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:43,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:43,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:43,639 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:45,841 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2022-02-20 19:56:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:56:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 672 transitions. [2022-02-20 19:56:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 672 transitions. [2022-02-20 19:56:45,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 672 transitions. [2022-02-20 19:56:46,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 672 edges. 672 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:46,434 INFO L225 Difference]: With dead ends: 1002 [2022-02-20 19:56:46,434 INFO L226 Difference]: Without dead ends: 717 [2022-02-20 19:56:46,435 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 19:56:46,436 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 530 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:46,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1134 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-02-20 19:56:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2022-02-20 19:56:46,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:46,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 717 states. Second operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:46,465 INFO L74 IsIncluded]: Start isIncluded. First operand 717 states. Second operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:46,466 INFO L87 Difference]: Start difference. First operand 717 states. Second operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,508 INFO L93 Difference]: Finished difference Result 717 states and 1017 transitions. [2022-02-20 19:56:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1017 transitions. [2022-02-20 19:56:46,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 717 states. [2022-02-20 19:56:46,515 INFO L87 Difference]: Start difference. First operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 717 states. [2022-02-20 19:56:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,558 INFO L93 Difference]: Finished difference Result 717 states and 1017 transitions. [2022-02-20 19:56:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1017 transitions. [2022-02-20 19:56:46,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:46,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2022-02-20 19:56:46,590 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2022-02-20 19:56:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:46,591 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2022-02-20 19:56:46,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2022-02-20 19:56:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:56:46,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:46,593 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] [2022-02-20 19:56:46,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:46,593 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2022-02-20 19:56:46,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:46,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316520099] [2022-02-20 19:56:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,625 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {8122#true} {8122#true} #705#return; {8122#true} is VALID [2022-02-20 19:56:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {8122#true} is VALID [2022-02-20 19:56:46,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} assume !(0 == ~T1_E~0); {8122#true} is VALID [2022-02-20 19:56:46,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} assume !(0 == ~E_M~0); {8122#true} is VALID [2022-02-20 19:56:46,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {8122#true} assume !(0 == ~E_1~0); {8122#true} is VALID [2022-02-20 19:56:46,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,635 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8122#true} {8122#true} #707#return; {8122#true} is VALID [2022-02-20 19:56:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {8158#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {8122#true} is VALID [2022-02-20 19:56:46,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} assume !(1 == ~m_pc~0); {8122#true} is VALID [2022-02-20 19:56:46,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} is_master_triggered_~__retres1~4#1 := 0; {8159#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:56:46,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {8159#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8160#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:56:46,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {8160#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {8161#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:56:46,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {8161#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {8123#false} is VALID [2022-02-20 19:56:46,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {8123#false} 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; {8123#false} is VALID [2022-02-20 19:56:46,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {8123#false} assume 1 == ~t1_pc~0; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {8123#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {8123#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {8123#false} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {8123#false} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {8123#false} assume true; {8123#false} is VALID [2022-02-20 19:56:46,715 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8123#false} {8122#true} #709#return; {8123#false} is VALID [2022-02-20 19:56:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {8122#true} is VALID [2022-02-20 19:56:46,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} assume !(1 == ~T1_E~0); {8122#true} is VALID [2022-02-20 19:56:46,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8122#true} is VALID [2022-02-20 19:56:46,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {8122#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8122#true} is VALID [2022-02-20 19:56:46,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,721 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8122#true} {8123#false} #711#return; {8123#false} is VALID [2022-02-20 19:56:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {8122#true} havoc ~__retres1~6; {8122#true} is VALID [2022-02-20 19:56:46,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8122#true} is VALID [2022-02-20 19:56:46,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} #res := ~__retres1~6; {8122#true} is VALID [2022-02-20 19:56:46,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,733 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8122#true} {8123#false} #713#return; {8123#false} is VALID [2022-02-20 19:56:46,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {8122#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {8122#true} is VALID [2022-02-20 19:56:46,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {8122#true} is VALID [2022-02-20 19:56:46,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {8122#true} is VALID [2022-02-20 19:56:46,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {8122#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {8122#true} call update_channels2(); {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8122#true} {8122#true} #705#return; {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {8122#true} assume { :begin_inline_init_threads2 } true; {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {8122#true} assume 1 == ~m_i~0;~m_st~0 := 0; {8122#true} is VALID [2022-02-20 19:56:46,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {8122#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {8122#true} is VALID [2022-02-20 19:56:46,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {8122#true} assume { :end_inline_init_threads2 } true; {8122#true} is VALID [2022-02-20 19:56:46,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {8122#true} call fire_delta_events2(); {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:46,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {8122#true} is VALID [2022-02-20 19:56:46,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {8122#true} assume !(0 == ~T1_E~0); {8122#true} is VALID [2022-02-20 19:56:46,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {8122#true} assume !(0 == ~E_M~0); {8122#true} is VALID [2022-02-20 19:56:46,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {8122#true} assume !(0 == ~E_1~0); {8122#true} is VALID [2022-02-20 19:56:46,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,737 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8122#true} {8122#true} #707#return; {8122#true} is VALID [2022-02-20 19:56:46,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {8122#true} call activate_threads2(); {8158#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:46,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {8158#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {8122#true} is VALID [2022-02-20 19:56:46,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {8122#true} assume !(1 == ~m_pc~0); {8122#true} is VALID [2022-02-20 19:56:46,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {8122#true} is_master_triggered_~__retres1~4#1 := 0; {8159#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:56:46,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {8159#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8160#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:56:46,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {8160#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {8161#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:56:46,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {8161#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {8123#false} is VALID [2022-02-20 19:56:46,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {8123#false} 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; {8123#false} is VALID [2022-02-20 19:56:46,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {8123#false} assume 1 == ~t1_pc~0; {8123#false} is VALID [2022-02-20 19:56:46,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {8123#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8123#false} is VALID [2022-02-20 19:56:46,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {8123#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8123#false} is VALID [2022-02-20 19:56:46,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {8123#false} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {8123#false} is VALID [2022-02-20 19:56:46,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {8123#false} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {8123#false} is VALID [2022-02-20 19:56:46,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {8123#false} assume true; {8123#false} is VALID [2022-02-20 19:56:46,746 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8123#false} {8122#true} #709#return; {8123#false} is VALID [2022-02-20 19:56:46,746 INFO L272 TraceCheckUtils]: 33: Hoare triple {8123#false} call reset_delta_events2(); {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:46,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {8157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {8122#true} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {8122#true} assume !(1 == ~T1_E~0); {8122#true} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {8122#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8122#true} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {8122#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8122#true} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,747 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8122#true} {8123#false} #711#return; {8123#false} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {8123#false} assume !false; {8123#false} is VALID [2022-02-20 19:56:46,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {8123#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_~tmp~5#1;havoc eval2_~tmp~5#1; {8123#false} is VALID [2022-02-20 19:56:46,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {8123#false} assume !false; {8123#false} is VALID [2022-02-20 19:56:46,748 INFO L272 TraceCheckUtils]: 43: Hoare triple {8123#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {8122#true} is VALID [2022-02-20 19:56:46,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {8122#true} havoc ~__retres1~6; {8122#true} is VALID [2022-02-20 19:56:46,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {8122#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8122#true} is VALID [2022-02-20 19:56:46,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {8122#true} #res := ~__retres1~6; {8122#true} is VALID [2022-02-20 19:56:46,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {8122#true} assume true; {8122#true} is VALID [2022-02-20 19:56:46,749 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8122#true} {8123#false} #713#return; {8123#false} is VALID [2022-02-20 19:56:46,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {8123#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; {8123#false} is VALID [2022-02-20 19:56:46,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {8123#false} assume 0 != eval2_~tmp~5#1; {8123#false} is VALID [2022-02-20 19:56:46,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {8123#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; {8123#false} is VALID [2022-02-20 19:56:46,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {8123#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {8123#false} is VALID [2022-02-20 19:56:46,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {8123#false} assume !(0 == ~m_pc~0); {8123#false} is VALID [2022-02-20 19:56:46,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {8123#false} assume 1 == ~m_pc~0; {8123#false} is VALID [2022-02-20 19:56:46,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {8123#false} assume ~token~0 != 1 + ~local~0; {8123#false} is VALID [2022-02-20 19:56:46,750 INFO L272 TraceCheckUtils]: 56: Hoare triple {8123#false} call error2(); {8123#false} is VALID [2022-02-20 19:56:46,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {8123#false} assume !false; {8123#false} is VALID [2022-02-20 19:56:46,750 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:56:46,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:46,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316520099] [2022-02-20 19:56:46,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316520099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:46,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:46,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:46,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192652940] [2022-02-20 19:56:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:46,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:46,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:46,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:46,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:46,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:46,793 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:48,681 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2022-02-20 19:56:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 500 transitions. [2022-02-20 19:56:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 500 transitions. [2022-02-20 19:56:48,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 500 transitions. [2022-02-20 19:56:49,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:49,111 INFO L225 Difference]: With dead ends: 1182 [2022-02-20 19:56:49,111 INFO L226 Difference]: Without dead ends: 723 [2022-02-20 19:56:49,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:56:49,113 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:49,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 977 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-02-20 19:56:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2022-02-20 19:56:49,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:49,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 723 states. Second operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:49,181 INFO L74 IsIncluded]: Start isIncluded. First operand 723 states. Second operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:49,182 INFO L87 Difference]: Start difference. First operand 723 states. Second operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:49,213 INFO L93 Difference]: Finished difference Result 723 states and 1034 transitions. [2022-02-20 19:56:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1034 transitions. [2022-02-20 19:56:49,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:49,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:49,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 723 states. [2022-02-20 19:56:49,218 INFO L87 Difference]: Start difference. First operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 723 states. [2022-02-20 19:56:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:49,248 INFO L93 Difference]: Finished difference Result 723 states and 1034 transitions. [2022-02-20 19:56:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1034 transitions. [2022-02-20 19:56:49,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:49,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:49,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:49,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:56:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2022-02-20 19:56:49,278 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2022-02-20 19:56:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:49,278 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2022-02-20 19:56:49,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2022-02-20 19:56:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:56:49,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:49,281 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] [2022-02-20 19:56:49,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:56:49,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2022-02-20 19:56:49,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:49,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889792795] [2022-02-20 19:56:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,317 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {11992#true} {11994#(= ~m_pc~0 ~t1_pc~0)} #705#return; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11992#true} is VALID [2022-02-20 19:56:49,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume !(0 == ~T1_E~0); {11992#true} is VALID [2022-02-20 19:56:49,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume !(0 == ~E_M~0); {11992#true} is VALID [2022-02-20 19:56:49,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {11992#true} assume !(0 == ~E_1~0); {11992#true} is VALID [2022-02-20 19:56:49,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,328 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11992#true} {11994#(= ~m_pc~0 ~t1_pc~0)} #707#return; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {12029#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {11992#true} is VALID [2022-02-20 19:56:49,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume !(1 == ~m_pc~0); {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,397 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {11994#(= ~m_pc~0 ~t1_pc~0)} #709#return; {11993#false} is VALID [2022-02-20 19:56:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11992#true} is VALID [2022-02-20 19:56:49,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume !(1 == ~T1_E~0); {11992#true} is VALID [2022-02-20 19:56:49,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11992#true} is VALID [2022-02-20 19:56:49,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {11992#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11992#true} is VALID [2022-02-20 19:56:49,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,403 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11992#true} {11993#false} #711#return; {11993#false} is VALID [2022-02-20 19:56:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:49,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {11992#true} havoc ~__retres1~6; {11992#true} is VALID [2022-02-20 19:56:49,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11992#true} is VALID [2022-02-20 19:56:49,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} #res := ~__retres1~6; {11992#true} is VALID [2022-02-20 19:56:49,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,408 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11992#true} {11993#false} #713#return; {11993#false} is VALID [2022-02-20 19:56:49,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {11992#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret27#1, start_simulation2_#t~ret28#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {11992#true} is VALID [2022-02-20 19:56:49,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,411 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11992#true} {11994#(= ~m_pc~0 ~t1_pc~0)} #705#return; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:49,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11992#true} is VALID [2022-02-20 19:56:49,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {11992#true} assume !(0 == ~T1_E~0); {11992#true} is VALID [2022-02-20 19:56:49,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {11992#true} assume !(0 == ~E_M~0); {11992#true} is VALID [2022-02-20 19:56:49,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {11992#true} assume !(0 == ~E_1~0); {11992#true} is VALID [2022-02-20 19:56:49,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,415 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11992#true} {11994#(= ~m_pc~0 ~t1_pc~0)} #707#return; {11994#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:49,416 INFO L272 TraceCheckUtils]: 18: Hoare triple {11994#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {12029#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:49,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {12029#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#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; {11992#true} is VALID [2022-02-20 19:56:49,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {11992#true} assume !(1 == ~m_pc~0); {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~6#1 := #t~ret24#1;havoc #t~ret24#1; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:49,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {12030#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~3#1 := #t~ret25#1;havoc #t~ret25#1; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:49,422 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12031#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {11994#(= ~m_pc~0 ~t1_pc~0)} #709#return; {11993#false} is VALID [2022-02-20 19:56:49,422 INFO L272 TraceCheckUtils]: 33: Hoare triple {11993#false} call reset_delta_events2(); {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:49,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {12028#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11992#true} is VALID [2022-02-20 19:56:49,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {11992#true} assume !(1 == ~T1_E~0); {11992#true} is VALID [2022-02-20 19:56:49,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {11992#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11992#true} is VALID [2022-02-20 19:56:49,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {11992#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11992#true} is VALID [2022-02-20 19:56:49,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11992#true} {11993#false} #711#return; {11993#false} is VALID [2022-02-20 19:56:49,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-02-20 19:56:49,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {11993#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_~tmp~5#1;havoc eval2_~tmp~5#1; {11993#false} is VALID [2022-02-20 19:56:49,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-02-20 19:56:49,423 INFO L272 TraceCheckUtils]: 43: Hoare triple {11993#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {11992#true} is VALID [2022-02-20 19:56:49,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {11992#true} havoc ~__retres1~6; {11992#true} is VALID [2022-02-20 19:56:49,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {11992#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11992#true} is VALID [2022-02-20 19:56:49,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {11992#true} #res := ~__retres1~6; {11992#true} is VALID [2022-02-20 19:56:49,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-02-20 19:56:49,424 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11992#true} {11993#false} #713#return; {11993#false} is VALID [2022-02-20 19:56:49,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {11993#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; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {11993#false} assume 0 != eval2_~tmp~5#1; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {11993#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; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {11993#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1, master_#t~nondet20#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet19#1 && master_#t~nondet19#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet19#1;havoc master_#t~nondet19#1; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {11993#false} assume !(0 == ~m_pc~0); {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {11993#false} assume 1 == ~m_pc~0; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {11993#false} assume ~token~0 != 1 + ~local~0; {11993#false} is VALID [2022-02-20 19:56:49,425 INFO L272 TraceCheckUtils]: 56: Hoare triple {11993#false} call error2(); {11993#false} is VALID [2022-02-20 19:56:49,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-02-20 19:56:49,426 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:56:49,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:49,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889792795] [2022-02-20 19:56:49,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889792795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:49,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:49,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:49,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432626668] [2022-02-20 19:56:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:49,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:49,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:49,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:49,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:49,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:49,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:49,467 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:53,640 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2022-02-20 19:56:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:56:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:56:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 921 transitions. [2022-02-20 19:56:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 921 transitions. [2022-02-20 19:56:53,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 921 transitions. [2022-02-20 19:56:54,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 921 edges. 921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:54,699 INFO L225 Difference]: With dead ends: 2468 [2022-02-20 19:56:54,699 INFO L226 Difference]: Without dead ends: 1994 [2022-02-20 19:56:54,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:56:54,702 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 958 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:54,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 973 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:56:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-02-20 19:56:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2022-02-20 19:56:55,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:55,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1994 states. Second operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-02-20 19:56:55,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1994 states. Second operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-02-20 19:56:55,511 INFO L87 Difference]: Start difference. First operand 1994 states. Second operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-02-20 19:56:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,694 INFO L93 Difference]: Finished difference Result 1994 states and 2834 transitions. [2022-02-20 19:56:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2834 transitions. [2022-02-20 19:56:55,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) Second operand 1994 states. [2022-02-20 19:56:55,722 INFO L87 Difference]: Start difference. First operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) Second operand 1994 states. [2022-02-20 19:56:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,910 INFO L93 Difference]: Finished difference Result 1994 states and 2834 transitions. [2022-02-20 19:56:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2834 transitions. [2022-02-20 19:56:55,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:55,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-02-20 19:56:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2022-02-20 19:56:56,116 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2022-02-20 19:56:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:56,117 INFO L470 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2022-02-20 19:56:56,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:56:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2022-02-20 19:56:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:56,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:56,120 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:56:56,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:56:56,121 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-02-20 19:56:56,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:56,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133790587] [2022-02-20 19:56:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {21719#(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); {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21681#(= ~q_read_ev~0 2)} #681#return; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {21721#(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; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {21722#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {21722#(= |old(~q_read_ev~0)| 0)} assume true; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21722#(= |old(~q_read_ev~0)| 0)} {21681#(= ~q_read_ev~0 2)} #683#return; {21680#false} is VALID [2022-02-20 19:56:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {21679#true} havoc ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {21679#true} assume !(1 == ~p_dw_pc~0); {21679#true} is VALID [2022-02-20 19:56:56,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} ~__retres1~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {21679#true} #res := ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,225 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21679#true} {21679#true} #677#return; {21679#true} is VALID [2022-02-20 19:56:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {21679#true} havoc ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {21679#true} assume 1 == ~c_dr_pc~0; {21679#true} is VALID [2022-02-20 19:56:56,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21679#true} is VALID [2022-02-20 19:56:56,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {21679#true} #res := ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,230 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21679#true} {21679#true} #679#return; {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {21723#(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; {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L272 TraceCheckUtils]: 1: Hoare triple {21679#true} call #t~ret8 := is_do_write_p_triggered(); {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} havoc ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {21679#true} assume !(1 == ~p_dw_pc~0); {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {21679#true} ~__retres1~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {21679#true} #res := ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21679#true} {21679#true} #677#return; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {21679#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {21679#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L272 TraceCheckUtils]: 10: Hoare triple {21679#true} call #t~ret9 := is_do_read_c_triggered(); {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {21679#true} havoc ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {21679#true} assume 1 == ~c_dr_pc~0; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {21679#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {21679#true} #res := ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21679#true} {21679#true} #679#return; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {21679#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {21679#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,234 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21679#true} {21680#false} #685#return; {21680#false} is VALID [2022-02-20 19:56:56,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {21721#(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; {21679#true} is VALID [2022-02-20 19:56:56,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {21679#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21679#true} is VALID [2022-02-20 19:56:56,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21679#true} {21680#false} #687#return; {21680#false} is VALID [2022-02-20 19:56:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {21679#true} havoc ~__retres1~2; {21679#true} is VALID [2022-02-20 19:56:56,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {21679#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21679#true} is VALID [2022-02-20 19:56:56,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} #res := ~__retres1~2; {21679#true} is VALID [2022-02-20 19:56:56,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21679#true} {21680#false} #689#return; {21680#false} is VALID [2022-02-20 19:56:56,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {21679#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {21679#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {21679#true} is VALID [2022-02-20 19:56:56,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {21679#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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;~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; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {21681#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {21681#(= ~q_read_ev~0 2)} call update_channels1(); {21719#(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:56:56,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {21719#(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); {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,264 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21720#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {21681#(= ~q_read_ev~0 2)} #681#return; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {21681#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {21681#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {21681#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {21681#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {21681#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:56,266 INFO L272 TraceCheckUtils]: 12: Hoare triple {21681#(= ~q_read_ev~0 2)} call fire_delta_events1(); {21721#(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:56:56,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {21721#(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; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {21722#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {21722#(= |old(~q_read_ev~0)| 0)} assume true; {21722#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:56,267 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21722#(= |old(~q_read_ev~0)| 0)} {21681#(= ~q_read_ev~0 2)} #683#return; {21680#false} is VALID [2022-02-20 19:56:56,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {21680#false} call activate_threads1(); {21723#(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:56:56,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {21723#(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; {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {21679#true} call #t~ret8 := is_do_write_p_triggered(); {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {21679#true} havoc ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {21679#true} assume !(1 == ~p_dw_pc~0); {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {21679#true} ~__retres1~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {21679#true} #res := ~__retres1~0; {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,268 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21679#true} {21679#true} #677#return; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {21679#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {21679#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L272 TraceCheckUtils]: 28: Hoare triple {21679#true} call #t~ret9 := is_do_read_c_triggered(); {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {21679#true} havoc ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {21679#true} assume 1 == ~c_dr_pc~0; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {21679#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {21679#true} #res := ~__retres1~1; {21679#true} is VALID [2022-02-20 19:56:56,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21679#true} {21679#true} #679#return; {21679#true} is VALID [2022-02-20 19:56:56,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {21679#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21679#true} is VALID [2022-02-20 19:56:56,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {21679#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21679#true} is VALID [2022-02-20 19:56:56,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21679#true} {21680#false} #685#return; {21680#false} is VALID [2022-02-20 19:56:56,270 INFO L272 TraceCheckUtils]: 39: Hoare triple {21680#false} call reset_delta_events1(); {21721#(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:56:56,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {21721#(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; {21679#true} is VALID [2022-02-20 19:56:56,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {21679#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21679#true} is VALID [2022-02-20 19:56:56,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,271 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21679#true} {21680#false} #687#return; {21680#false} is VALID [2022-02-20 19:56:56,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {21680#false} assume !false; {21680#false} is VALID [2022-02-20 19:56:56,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {21680#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; {21680#false} is VALID [2022-02-20 19:56:56,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {21680#false} assume !false; {21680#false} is VALID [2022-02-20 19:56:56,271 INFO L272 TraceCheckUtils]: 47: Hoare triple {21680#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21679#true} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {21679#true} havoc ~__retres1~2; {21679#true} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {21679#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21679#true} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {21679#true} #res := ~__retres1~2; {21679#true} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {21679#true} assume true; {21679#true} is VALID [2022-02-20 19:56:56,272 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21679#true} {21680#false} #689#return; {21680#false} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {21680#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; {21680#false} is VALID [2022-02-20 19:56:56,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {21680#false} assume 0 != eval1_~tmp___1~0#1; {21680#false} is VALID [2022-02-20 19:56:56,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {21680#false} assume !(0 == ~p_dw_st~0); {21680#false} is VALID [2022-02-20 19:56:56,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {21680#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; {21680#false} is VALID [2022-02-20 19:56:56,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {21680#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; {21680#false} is VALID [2022-02-20 19:56:56,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {21680#false} assume 0 == ~c_dr_pc~0; {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {21680#false} assume !false; {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {21680#false} assume !(1 == ~q_free~0); {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {21680#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; {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {21680#false} assume !(~p_last_write~0 == ~c_last_read~0); {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L272 TraceCheckUtils]: 63: Hoare triple {21680#false} call error1(); {21680#false} is VALID [2022-02-20 19:56:56,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {21680#false} assume !false; {21680#false} is VALID [2022-02-20 19:56:56,275 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:56:56,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:56,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133790587] [2022-02-20 19:56:56,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133790587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:56,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:56,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:56,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309775686] [2022-02-20 19:56:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:56,277 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:56:56,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:56,278 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:56:56,316 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:56:56,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:56,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:56,318 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 transitions. 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:56:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:59,071 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2022-02-20 19:56:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:59,071 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:56:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:59,072 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:56:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 603 transitions. [2022-02-20 19:56:59,079 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:56:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 603 transitions. [2022-02-20 19:56:59,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 603 transitions. [2022-02-20 19:56:59,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:59,781 INFO L225 Difference]: With dead ends: 1962 [2022-02-20 19:56:59,782 INFO L226 Difference]: Without dead ends: 1874 [2022-02-20 19:56:59,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:56:59,786 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 543 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:59,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 825 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-02-20 19:57:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2022-02-20 19:57:00,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:00,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1874 states. Second operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-02-20 19:57:00,634 INFO L74 IsIncluded]: Start isIncluded. First operand 1874 states. Second operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-02-20 19:57:00,637 INFO L87 Difference]: Start difference. First operand 1874 states. Second operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-02-20 19:57:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,760 INFO L93 Difference]: Finished difference Result 1874 states and 2617 transitions. [2022-02-20 19:57:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2617 transitions. [2022-02-20 19:57:00,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) Second operand 1874 states. [2022-02-20 19:57:00,771 INFO L87 Difference]: Start difference. First operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) Second operand 1874 states. [2022-02-20 19:57:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,880 INFO L93 Difference]: Finished difference Result 1874 states and 2617 transitions. [2022-02-20 19:57:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2617 transitions. [2022-02-20 19:57:00,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:00,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-02-20 19:57:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2022-02-20 19:57:01,065 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2022-02-20 19:57:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:01,065 INFO L470 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2022-02-20 19:57:01,065 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:57:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2022-02-20 19:57:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:01,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:01,067 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:57:01,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:01,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-02-20 19:57:01,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:01,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209953894] [2022-02-20 19:57:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {30691#(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); {30692#(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:57:01,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {30692#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {30692#(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:57:01,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30692#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {30653#(= ~q_write_ev~0 ~q_read_ev~0)} #681#return; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {30692#(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); {30693#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {30693#(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; {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {30653#(= ~q_write_ev~0 ~q_read_ev~0)} #683#return; {30652#false} is VALID [2022-02-20 19:57:01,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {30651#true} havoc ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {30651#true} assume !(1 == ~p_dw_pc~0); {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} ~__retres1~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {30651#true} #res := ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30651#true} {30651#true} #677#return; {30651#true} is VALID [2022-02-20 19:57:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {30651#true} havoc ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {30651#true} assume 1 == ~c_dr_pc~0; {30651#true} is VALID [2022-02-20 19:57:01,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {30651#true} is VALID [2022-02-20 19:57:01,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {30651#true} #res := ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30651#true} {30651#true} #679#return; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {30695#(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; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L272 TraceCheckUtils]: 1: Hoare triple {30651#true} call #t~ret8 := is_do_write_p_triggered(); {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} havoc ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {30651#true} assume !(1 == ~p_dw_pc~0); {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {30651#true} ~__retres1~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {30651#true} #res := ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30651#true} {30651#true} #677#return; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {30651#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {30651#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L272 TraceCheckUtils]: 10: Hoare triple {30651#true} call #t~ret9 := is_do_read_c_triggered(); {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {30651#true} havoc ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {30651#true} assume 1 == ~c_dr_pc~0; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {30651#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {30651#true} #res := ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30651#true} {30651#true} #679#return; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {30651#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {30651#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,178 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30651#true} {30652#false} #685#return; {30652#false} is VALID [2022-02-20 19:57:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {30692#(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); {30651#true} is VALID [2022-02-20 19:57:01,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {30651#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30651#true} is VALID [2022-02-20 19:57:01,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30651#true} {30652#false} #687#return; {30652#false} is VALID [2022-02-20 19:57:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {30651#true} havoc ~__retres1~2; {30651#true} is VALID [2022-02-20 19:57:01,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {30651#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30651#true} is VALID [2022-02-20 19:57:01,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} #res := ~__retres1~2; {30651#true} is VALID [2022-02-20 19:57:01,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,186 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30651#true} {30652#false} #689#return; {30652#false} is VALID [2022-02-20 19:57:01,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {30651#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {30651#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {30651#true} is VALID [2022-02-20 19:57:01,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {30651#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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;~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; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {30653#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {30691#(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:57:01,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {30691#(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); {30692#(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:57:01,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {30692#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {30692#(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:57:01,195 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30692#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {30653#(= ~q_write_ev~0 ~q_read_ev~0)} #681#return; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {30653#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,197 INFO L272 TraceCheckUtils]: 12: Hoare triple {30653#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {30692#(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:57:01,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {30692#(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); {30693#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {30693#(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; {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:01,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30694#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {30653#(= ~q_write_ev~0 ~q_read_ev~0)} #683#return; {30652#false} is VALID [2022-02-20 19:57:01,199 INFO L272 TraceCheckUtils]: 17: Hoare triple {30652#false} call activate_threads1(); {30695#(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:57:01,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {30695#(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; {30651#true} is VALID [2022-02-20 19:57:01,199 INFO L272 TraceCheckUtils]: 19: Hoare triple {30651#true} call #t~ret8 := is_do_write_p_triggered(); {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {30651#true} havoc ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {30651#true} assume !(1 == ~p_dw_pc~0); {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {30651#true} ~__retres1~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {30651#true} #res := ~__retres1~0; {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30651#true} {30651#true} #677#return; {30651#true} is VALID [2022-02-20 19:57:01,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {30651#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {30651#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L272 TraceCheckUtils]: 28: Hoare triple {30651#true} call #t~ret9 := is_do_read_c_triggered(); {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {30651#true} havoc ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {30651#true} assume 1 == ~c_dr_pc~0; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {30651#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {30651#true} #res := ~__retres1~1; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,201 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30651#true} {30651#true} #679#return; {30651#true} is VALID [2022-02-20 19:57:01,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {30651#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30651#true} is VALID [2022-02-20 19:57:01,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {30651#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30651#true} is VALID [2022-02-20 19:57:01,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,202 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30651#true} {30652#false} #685#return; {30652#false} is VALID [2022-02-20 19:57:01,202 INFO L272 TraceCheckUtils]: 39: Hoare triple {30652#false} call reset_delta_events1(); {30692#(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:57:01,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {30692#(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); {30651#true} is VALID [2022-02-20 19:57:01,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {30651#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30651#true} is VALID [2022-02-20 19:57:01,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,203 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30651#true} {30652#false} #687#return; {30652#false} is VALID [2022-02-20 19:57:01,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {30652#false} assume !false; {30652#false} is VALID [2022-02-20 19:57:01,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {30652#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; {30652#false} is VALID [2022-02-20 19:57:01,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {30652#false} assume !false; {30652#false} is VALID [2022-02-20 19:57:01,203 INFO L272 TraceCheckUtils]: 47: Hoare triple {30652#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30651#true} is VALID [2022-02-20 19:57:01,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {30651#true} havoc ~__retres1~2; {30651#true} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {30651#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30651#true} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {30651#true} #res := ~__retres1~2; {30651#true} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {30651#true} assume true; {30651#true} is VALID [2022-02-20 19:57:01,204 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30651#true} {30652#false} #689#return; {30652#false} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {30652#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; {30652#false} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {30652#false} assume 0 != eval1_~tmp___1~0#1; {30652#false} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {30652#false} assume !(0 == ~p_dw_st~0); {30652#false} is VALID [2022-02-20 19:57:01,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {30652#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; {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {30652#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; {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {30652#false} assume 0 == ~c_dr_pc~0; {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {30652#false} assume !false; {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {30652#false} assume !(1 == ~q_free~0); {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {30652#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; {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {30652#false} assume !(~p_last_write~0 == ~c_last_read~0); {30652#false} is VALID [2022-02-20 19:57:01,205 INFO L272 TraceCheckUtils]: 63: Hoare triple {30652#false} call error1(); {30652#false} is VALID [2022-02-20 19:57:01,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {30652#false} assume !false; {30652#false} is VALID [2022-02-20 19:57:01,206 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:57:01,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:01,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209953894] [2022-02-20 19:57:01,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209953894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:01,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:01,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:01,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547969788] [2022-02-20 19:57:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:01,207 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:57:01,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:01,208 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:57:01,247 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:57:01,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:01,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:01,248 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 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:57:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,607 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2022-02-20 19:57:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:04,607 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:57:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:04,608 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:57:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 626 transitions. [2022-02-20 19:57:04,613 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:57:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 626 transitions. [2022-02-20 19:57:04,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 626 transitions. [2022-02-20 19:57:05,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:05,244 INFO L225 Difference]: With dead ends: 2182 [2022-02-20 19:57:05,244 INFO L226 Difference]: Without dead ends: 2005 [2022-02-20 19:57:05,245 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:57:05,245 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 566 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:05,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 1258 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:57:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-02-20 19:57:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2022-02-20 19:57:06,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:06,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2005 states. Second operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-02-20 19:57:06,117 INFO L74 IsIncluded]: Start isIncluded. First operand 2005 states. Second operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-02-20 19:57:06,120 INFO L87 Difference]: Start difference. First operand 2005 states. Second operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-02-20 19:57:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,290 INFO L93 Difference]: Finished difference Result 2005 states and 2800 transitions. [2022-02-20 19:57:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2800 transitions. [2022-02-20 19:57:06,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) Second operand 2005 states. [2022-02-20 19:57:06,301 INFO L87 Difference]: Start difference. First operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) Second operand 2005 states. [2022-02-20 19:57:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,464 INFO L93 Difference]: Finished difference Result 2005 states and 2800 transitions. [2022-02-20 19:57:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2800 transitions. [2022-02-20 19:57:06,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:06,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:06,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:06,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-02-20 19:57:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2022-02-20 19:57:06,688 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2022-02-20 19:57:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:06,688 INFO L470 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2022-02-20 19:57:06,689 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:57:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2022-02-20 19:57:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:06,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:06,690 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:57:06,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:06,695 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2022-02-20 19:57:06,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:06,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818863020] [2022-02-20 19:57:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {40353#(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); {40314#true} is VALID [2022-02-20 19:57:06,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40314#true} {40314#true} #681#return; {40314#true} is VALID [2022-02-20 19:57:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {40354#(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); {40314#true} is VALID [2022-02-20 19:57:06,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume !(0 == ~q_write_ev~0); {40314#true} is VALID [2022-02-20 19:57:06,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40314#true} {40314#true} #683#return; {40314#true} is VALID [2022-02-20 19:57:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {40314#true} havoc ~__retres1~0; {40314#true} is VALID [2022-02-20 19:57:06,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume !(1 == ~p_dw_pc~0); {40314#true} is VALID [2022-02-20 19:57:06,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} ~__retres1~0 := 0; {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:06,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,834 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {40314#true} #677#return; {40362#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {40314#true} havoc ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume 1 == ~c_dr_pc~0; {40314#true} is VALID [2022-02-20 19:57:06,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {40314#true} is VALID [2022-02-20 19:57:06,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {40314#true} #res := ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,840 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40314#true} {40315#false} #679#return; {40315#false} is VALID [2022-02-20 19:57:06,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {40355#(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; {40314#true} is VALID [2022-02-20 19:57:06,841 INFO L272 TraceCheckUtils]: 1: Hoare triple {40314#true} call #t~ret8 := is_do_write_p_triggered(); {40314#true} is VALID [2022-02-20 19:57:06,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} havoc ~__retres1~0; {40314#true} is VALID [2022-02-20 19:57:06,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {40314#true} assume !(1 == ~p_dw_pc~0); {40314#true} is VALID [2022-02-20 19:57:06,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {40314#true} ~__retres1~0 := 0; {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:06,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,843 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {40314#true} #677#return; {40362#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:06,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {40362#(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; {40363#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {40363#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {40315#false} is VALID [2022-02-20 19:57:06,844 INFO L272 TraceCheckUtils]: 10: Hoare triple {40315#false} call #t~ret9 := is_do_read_c_triggered(); {40314#true} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {40314#true} havoc ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {40314#true} assume 1 == ~c_dr_pc~0; {40314#true} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {40314#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {40314#true} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {40314#true} #res := ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,845 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40314#true} {40315#false} #679#return; {40315#false} is VALID [2022-02-20 19:57:06,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {40315#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40315#false} is VALID [2022-02-20 19:57:06,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {40315#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {40315#false} is VALID [2022-02-20 19:57:06,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {40315#false} assume true; {40315#false} is VALID [2022-02-20 19:57:06,845 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40315#false} {40314#true} #685#return; {40315#false} is VALID [2022-02-20 19:57:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {40354#(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); {40314#true} is VALID [2022-02-20 19:57:06,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40314#true} is VALID [2022-02-20 19:57:06,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40314#true} {40315#false} #687#return; {40315#false} is VALID [2022-02-20 19:57:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:06,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {40314#true} havoc ~__retres1~2; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} #res := ~__retres1~2; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40314#true} {40315#false} #689#return; {40315#false} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {40314#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {40314#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {40314#true} is VALID [2022-02-20 19:57:06,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {40314#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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;~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; {40314#true} is VALID [2022-02-20 19:57:06,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {40314#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {40314#true} is VALID [2022-02-20 19:57:06,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {40314#true} call update_channels1(); {40353#(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:57:06,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {40353#(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); {40314#true} is VALID [2022-02-20 19:57:06,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40314#true} {40314#true} #681#return; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {40314#true} assume { :begin_inline_init_threads1 } true; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {40314#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {40314#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {40314#true} assume { :end_inline_init_threads1 } true; {40314#true} is VALID [2022-02-20 19:57:06,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {40314#true} call fire_delta_events1(); {40354#(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:57:06,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {40354#(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); {40314#true} is VALID [2022-02-20 19:57:06,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {40314#true} assume !(0 == ~q_write_ev~0); {40314#true} is VALID [2022-02-20 19:57:06,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,858 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40314#true} {40314#true} #683#return; {40314#true} is VALID [2022-02-20 19:57:06,858 INFO L272 TraceCheckUtils]: 17: Hoare triple {40314#true} call activate_threads1(); {40355#(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:57:06,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {40355#(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; {40314#true} is VALID [2022-02-20 19:57:06,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {40314#true} call #t~ret8 := is_do_write_p_triggered(); {40314#true} is VALID [2022-02-20 19:57:06,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {40314#true} havoc ~__retres1~0; {40314#true} is VALID [2022-02-20 19:57:06,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {40314#true} assume !(1 == ~p_dw_pc~0); {40314#true} is VALID [2022-02-20 19:57:06,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {40314#true} ~__retres1~0 := 0; {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:06,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {40370#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:06,861 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40371#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {40314#true} #677#return; {40362#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:06,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {40362#(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; {40363#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:06,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {40363#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {40315#false} is VALID [2022-02-20 19:57:06,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {40315#false} call #t~ret9 := is_do_read_c_triggered(); {40314#true} is VALID [2022-02-20 19:57:06,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {40314#true} havoc ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {40314#true} assume 1 == ~c_dr_pc~0; {40314#true} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {40314#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {40314#true} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {40314#true} #res := ~__retres1~1; {40314#true} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,876 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {40314#true} {40315#false} #679#return; {40315#false} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {40315#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40315#false} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {40315#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {40315#false} is VALID [2022-02-20 19:57:06,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {40315#false} assume true; {40315#false} is VALID [2022-02-20 19:57:06,878 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40315#false} {40314#true} #685#return; {40315#false} is VALID [2022-02-20 19:57:06,878 INFO L272 TraceCheckUtils]: 39: Hoare triple {40315#false} call reset_delta_events1(); {40354#(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:57:06,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {40354#(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); {40314#true} is VALID [2022-02-20 19:57:06,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {40314#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {40314#true} is VALID [2022-02-20 19:57:06,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,878 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40314#true} {40315#false} #687#return; {40315#false} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {40315#false} assume !false; {40315#false} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {40315#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; {40315#false} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {40315#false} assume !false; {40315#false} is VALID [2022-02-20 19:57:06,879 INFO L272 TraceCheckUtils]: 47: Hoare triple {40315#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40314#true} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {40314#true} havoc ~__retres1~2; {40314#true} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {40314#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40314#true} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {40314#true} #res := ~__retres1~2; {40314#true} is VALID [2022-02-20 19:57:06,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {40314#true} assume true; {40314#true} is VALID [2022-02-20 19:57:06,880 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40314#true} {40315#false} #689#return; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {40315#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; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {40315#false} assume 0 != eval1_~tmp___1~0#1; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {40315#false} assume !(0 == ~p_dw_st~0); {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {40315#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; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {40315#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; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {40315#false} assume 0 == ~c_dr_pc~0; {40315#false} is VALID [2022-02-20 19:57:06,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {40315#false} assume !false; {40315#false} is VALID [2022-02-20 19:57:06,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {40315#false} assume !(1 == ~q_free~0); {40315#false} is VALID [2022-02-20 19:57:06,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {40315#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; {40315#false} is VALID [2022-02-20 19:57:06,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {40315#false} assume !(~p_last_write~0 == ~c_last_read~0); {40315#false} is VALID [2022-02-20 19:57:06,881 INFO L272 TraceCheckUtils]: 63: Hoare triple {40315#false} call error1(); {40315#false} is VALID [2022-02-20 19:57:06,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {40315#false} assume !false; {40315#false} is VALID [2022-02-20 19:57:06,882 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:57:06,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:06,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818863020] [2022-02-20 19:57:06,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818863020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:06,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:06,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:06,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887822210] [2022-02-20 19:57:06,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:06,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:06,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:06,922 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:57:06,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:06,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:06,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:06,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:06,924 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:09,693 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2022-02-20 19:57:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:09,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 444 transitions. [2022-02-20 19:57:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 444 transitions. [2022-02-20 19:57:09,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 444 transitions. [2022-02-20 19:57:09,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:10,182 INFO L225 Difference]: With dead ends: 2232 [2022-02-20 19:57:10,182 INFO L226 Difference]: Without dead ends: 1965 [2022-02-20 19:57:10,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:10,183 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 212 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:10,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1279 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:57:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-02-20 19:57:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2022-02-20 19:57:11,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:11,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1965 states. Second operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-02-20 19:57:11,041 INFO L74 IsIncluded]: Start isIncluded. First operand 1965 states. Second operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-02-20 19:57:11,046 INFO L87 Difference]: Start difference. First operand 1965 states. Second operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-02-20 19:57:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,206 INFO L93 Difference]: Finished difference Result 1965 states and 2741 transitions. [2022-02-20 19:57:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2741 transitions. [2022-02-20 19:57:11,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:11,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:11,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) Second operand 1965 states. [2022-02-20 19:57:11,219 INFO L87 Difference]: Start difference. First operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) Second operand 1965 states. [2022-02-20 19:57:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,393 INFO L93 Difference]: Finished difference Result 1965 states and 2741 transitions. [2022-02-20 19:57:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2741 transitions. [2022-02-20 19:57:11,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:11,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:11,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:11,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-02-20 19:57:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2022-02-20 19:57:11,643 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2022-02-20 19:57:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:11,644 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2022-02-20 19:57:11,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2022-02-20 19:57:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:11,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:11,651 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:57:11,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:11,651 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2022-02-20 19:57:11,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:11,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001747198] [2022-02-20 19:57:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {50002#(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); {49962#true} is VALID [2022-02-20 19:57:11,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49962#true} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #681#return; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {50003#(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); {49962#true} is VALID [2022-02-20 19:57:11,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume !(0 == ~q_write_ev~0); {49962#true} is VALID [2022-02-20 19:57:11,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49962#true} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #683#return; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#true} havoc ~__retres1~0; {49962#true} is VALID [2022-02-20 19:57:11,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume !(1 == ~p_dw_pc~0); {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,781 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {49962#true} #677#return; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#true} havoc ~__retres1~1; {49962#true} is VALID [2022-02-20 19:57:11,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume 1 == ~c_dr_pc~0; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,810 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #679#return; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {50004#(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; {49962#true} is VALID [2022-02-20 19:57:11,810 INFO L272 TraceCheckUtils]: 1: Hoare triple {49962#true} call #t~ret8 := is_do_write_p_triggered(); {49962#true} is VALID [2022-02-20 19:57:11,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#true} havoc ~__retres1~0; {49962#true} is VALID [2022-02-20 19:57:11,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {49962#true} assume !(1 == ~p_dw_pc~0); {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,812 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {49962#true} #677#return; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,813 INFO L272 TraceCheckUtils]: 10: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {49962#true} is VALID [2022-02-20 19:57:11,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {49962#true} havoc ~__retres1~1; {49962#true} is VALID [2022-02-20 19:57:11,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {49962#true} assume 1 == ~c_dr_pc~0; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #679#return; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,817 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #685#return; {49963#false} is VALID [2022-02-20 19:57:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {50003#(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); {49962#true} is VALID [2022-02-20 19:57:11,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {49962#true} is VALID [2022-02-20 19:57:11,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49962#true} {49963#false} #687#return; {49963#false} is VALID [2022-02-20 19:57:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:11,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#true} havoc ~__retres1~2; {49962#true} is VALID [2022-02-20 19:57:11,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49962#true} is VALID [2022-02-20 19:57:11,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#true} #res := ~__retres1~2; {49962#true} is VALID [2022-02-20 19:57:11,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,831 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {49962#true} {49963#false} #689#return; {49963#false} is VALID [2022-02-20 19:57:11,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {49962#true} is VALID [2022-02-20 19:57:11,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {49962#true} is VALID [2022-02-20 19:57:11,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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;~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; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {49964#(= ~c_dr_pc~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {50002#(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:57:11,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {50002#(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); {49962#true} is VALID [2022-02-20 19:57:11,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,833 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {49962#true} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #681#return; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,835 INFO L272 TraceCheckUtils]: 12: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {50003#(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:57:11,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {50003#(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); {49962#true} is VALID [2022-02-20 19:57:11,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {49962#true} assume !(0 == ~q_write_ev~0); {49962#true} is VALID [2022-02-20 19:57:11,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,836 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49962#true} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #683#return; {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:11,837 INFO L272 TraceCheckUtils]: 17: Hoare triple {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {50004#(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:57:11,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {50004#(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; {49962#true} is VALID [2022-02-20 19:57:11,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {49962#true} call #t~ret8 := is_do_write_p_triggered(); {49962#true} is VALID [2022-02-20 19:57:11,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {49962#true} havoc ~__retres1~0; {49962#true} is VALID [2022-02-20 19:57:11,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {49962#true} assume !(1 == ~p_dw_pc~0); {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,839 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {49962#true} #677#return; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:11,840 INFO L272 TraceCheckUtils]: 28: Hoare triple {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {49962#true} is VALID [2022-02-20 19:57:11,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {49962#true} havoc ~__retres1~1; {49962#true} is VALID [2022-02-20 19:57:11,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {49962#true} assume 1 == ~c_dr_pc~0; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:11,842 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50019#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {50011#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #679#return; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:11,845 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {50018#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {49964#(= ~c_dr_pc~0 ~p_dw_pc~0)} #685#return; {49963#false} is VALID [2022-02-20 19:57:11,845 INFO L272 TraceCheckUtils]: 39: Hoare triple {49963#false} call reset_delta_events1(); {50003#(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:57:11,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {50003#(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); {49962#true} is VALID [2022-02-20 19:57:11,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {49962#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {49962#true} is VALID [2022-02-20 19:57:11,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,845 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {49962#true} {49963#false} #687#return; {49963#false} is VALID [2022-02-20 19:57:11,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {49963#false} assume !false; {49963#false} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {49963#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; {49963#false} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {49963#false} assume !false; {49963#false} is VALID [2022-02-20 19:57:11,846 INFO L272 TraceCheckUtils]: 47: Hoare triple {49963#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {49962#true} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {49962#true} havoc ~__retres1~2; {49962#true} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {49962#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49962#true} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {49962#true} #res := ~__retres1~2; {49962#true} is VALID [2022-02-20 19:57:11,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {49962#true} assume true; {49962#true} is VALID [2022-02-20 19:57:11,847 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {49962#true} {49963#false} #689#return; {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {49963#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; {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {49963#false} assume 0 != eval1_~tmp___1~0#1; {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {49963#false} assume !(0 == ~p_dw_st~0); {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {49963#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; {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {49963#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; {49963#false} is VALID [2022-02-20 19:57:11,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {49963#false} assume 0 == ~c_dr_pc~0; {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {49963#false} assume !false; {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {49963#false} assume !(1 == ~q_free~0); {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {49963#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; {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {49963#false} assume !(~p_last_write~0 == ~c_last_read~0); {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L272 TraceCheckUtils]: 63: Hoare triple {49963#false} call error1(); {49963#false} is VALID [2022-02-20 19:57:11,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {49963#false} assume !false; {49963#false} is VALID [2022-02-20 19:57:11,849 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:57:11,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:11,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001747198] [2022-02-20 19:57:11,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001747198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:11,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:11,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:11,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652463611] [2022-02-20 19:57:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:11,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:11,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:11,893 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:57:11,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:11,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:11,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:11,894 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,487 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2022-02-20 19:57:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:18,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1093 transitions. [2022-02-20 19:57:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1093 transitions. [2022-02-20 19:57:18,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1093 transitions. [2022-02-20 19:57:19,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1093 edges. 1093 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:19,784 INFO L225 Difference]: With dead ends: 3598 [2022-02-20 19:57:19,784 INFO L226 Difference]: Without dead ends: 3326 [2022-02-20 19:57:19,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 19:57:19,786 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 1549 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:19,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 1321 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 19:57:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-02-20 19:57:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2022-02-20 19:57:21,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:21,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3326 states. Second operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-02-20 19:57:21,930 INFO L74 IsIncluded]: Start isIncluded. First operand 3326 states. Second operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-02-20 19:57:21,933 INFO L87 Difference]: Start difference. First operand 3326 states. Second operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-02-20 19:57:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,263 INFO L93 Difference]: Finished difference Result 3326 states and 4508 transitions. [2022-02-20 19:57:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4508 transitions. [2022-02-20 19:57:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) Second operand 3326 states. [2022-02-20 19:57:22,282 INFO L87 Difference]: Start difference. First operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) Second operand 3326 states. [2022-02-20 19:57:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,690 INFO L93 Difference]: Finished difference Result 3326 states and 4508 transitions. [2022-02-20 19:57:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4508 transitions. [2022-02-20 19:57:22,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:22,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:22,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:22,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-02-20 19:57:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2022-02-20 19:57:23,142 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2022-02-20 19:57:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:23,142 INFO L470 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2022-02-20 19:57:23,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2022-02-20 19:57:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:23,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:23,144 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:57:23,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:23,144 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2022-02-20 19:57:23,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:23,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645228025] [2022-02-20 19:57:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {65756#(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); {65717#true} is VALID [2022-02-20 19:57:23,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65717#true} {65717#true} #681#return; {65717#true} is VALID [2022-02-20 19:57:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {65757#(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); {65717#true} is VALID [2022-02-20 19:57:23,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume !(0 == ~q_write_ev~0); {65717#true} is VALID [2022-02-20 19:57:23,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65717#true} {65717#true} #683#return; {65717#true} is VALID [2022-02-20 19:57:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {65717#true} havoc ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume !(1 == ~p_dw_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} ~__retres1~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {65717#true} #res := ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,217 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65717#true} {65717#true} #677#return; {65717#true} is VALID [2022-02-20 19:57:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {65717#true} havoc ~__retres1~1; {65717#true} is VALID [2022-02-20 19:57:23,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume !(1 == ~c_dr_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} ~__retres1~1 := 0; {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:23,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,246 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {65717#true} #679#return; {65771#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {65758#(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; {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L272 TraceCheckUtils]: 1: Hoare triple {65717#true} call #t~ret8 := is_do_write_p_triggered(); {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} havoc ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {65717#true} assume !(1 == ~p_dw_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {65717#true} ~__retres1~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {65717#true} #res := ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65717#true} {65717#true} #677#return; {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {65717#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {65717#true} assume !(0 != ~tmp~1); {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {65717#true} call #t~ret9 := is_do_read_c_triggered(); {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {65717#true} havoc ~__retres1~1; {65717#true} is VALID [2022-02-20 19:57:23,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {65717#true} assume !(1 == ~c_dr_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {65717#true} ~__retres1~1 := 0; {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:23,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,250 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {65717#true} #679#return; {65771#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:23,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {65771#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65772#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:23,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {65772#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {65718#false} is VALID [2022-02-20 19:57:23,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {65718#false} assume true; {65718#false} is VALID [2022-02-20 19:57:23,251 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {65718#false} {65717#true} #685#return; {65718#false} is VALID [2022-02-20 19:57:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {65757#(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); {65717#true} is VALID [2022-02-20 19:57:23,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {65717#true} is VALID [2022-02-20 19:57:23,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65717#true} {65718#false} #687#return; {65718#false} is VALID [2022-02-20 19:57:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:23,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {65717#true} havoc ~__retres1~2; {65717#true} is VALID [2022-02-20 19:57:23,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65717#true} is VALID [2022-02-20 19:57:23,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} #res := ~__retres1~2; {65717#true} is VALID [2022-02-20 19:57:23,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,259 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65717#true} {65718#false} #689#return; {65718#false} is VALID [2022-02-20 19:57:23,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {65717#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(19, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {65717#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1;assume -2147483648 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 2147483647; {65717#true} is VALID [2022-02-20 19:57:23,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {65717#true} assume 0 != main_#t~nondet29#1;havoc main_#t~nondet29#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;~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; {65717#true} is VALID [2022-02-20 19:57:23,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {65717#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {65717#true} call update_channels1(); {65756#(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:57:23,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {65756#(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); {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65717#true} {65717#true} #681#return; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {65717#true} assume { :begin_inline_init_threads1 } true; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {65717#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {65717#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {65717#true} assume { :end_inline_init_threads1 } true; {65717#true} is VALID [2022-02-20 19:57:23,262 INFO L272 TraceCheckUtils]: 12: Hoare triple {65717#true} call fire_delta_events1(); {65757#(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:57:23,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {65757#(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); {65717#true} is VALID [2022-02-20 19:57:23,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {65717#true} assume !(0 == ~q_write_ev~0); {65717#true} is VALID [2022-02-20 19:57:23,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,262 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65717#true} {65717#true} #683#return; {65717#true} is VALID [2022-02-20 19:57:23,263 INFO L272 TraceCheckUtils]: 17: Hoare triple {65717#true} call activate_threads1(); {65758#(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:57:23,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {65758#(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; {65717#true} is VALID [2022-02-20 19:57:23,263 INFO L272 TraceCheckUtils]: 19: Hoare triple {65717#true} call #t~ret8 := is_do_write_p_triggered(); {65717#true} is VALID [2022-02-20 19:57:23,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {65717#true} havoc ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {65717#true} assume !(1 == ~p_dw_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {65717#true} ~__retres1~0 := 0; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {65717#true} #res := ~__retres1~0; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65717#true} {65717#true} #677#return; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {65717#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {65717#true} assume !(0 != ~tmp~1); {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L272 TraceCheckUtils]: 28: Hoare triple {65717#true} call #t~ret9 := is_do_read_c_triggered(); {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {65717#true} havoc ~__retres1~1; {65717#true} is VALID [2022-02-20 19:57:23,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {65717#true} assume !(1 == ~c_dr_pc~0); {65717#true} is VALID [2022-02-20 19:57:23,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {65717#true} ~__retres1~1 := 0; {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:23,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {65773#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:23,266 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {65774#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {65717#true} #679#return; {65771#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:23,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {65771#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65772#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:23,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {65772#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {65718#false} is VALID [2022-02-20 19:57:23,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {65718#false} assume true; {65718#false} is VALID [2022-02-20 19:57:23,267 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {65718#false} {65717#true} #685#return; {65718#false} is VALID [2022-02-20 19:57:23,268 INFO L272 TraceCheckUtils]: 39: Hoare triple {65718#false} call reset_delta_events1(); {65757#(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:57:23,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {65757#(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); {65717#true} is VALID [2022-02-20 19:57:23,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {65717#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {65717#true} is VALID [2022-02-20 19:57:23,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,268 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {65717#true} {65718#false} #687#return; {65718#false} is VALID [2022-02-20 19:57:23,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {65718#false} assume !false; {65718#false} is VALID [2022-02-20 19:57:23,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {65718#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; {65718#false} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {65718#false} assume !false; {65718#false} is VALID [2022-02-20 19:57:23,269 INFO L272 TraceCheckUtils]: 47: Hoare triple {65718#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65717#true} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {65717#true} havoc ~__retres1~2; {65717#true} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {65717#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65717#true} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {65717#true} #res := ~__retres1~2; {65717#true} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {65717#true} assume true; {65717#true} is VALID [2022-02-20 19:57:23,269 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {65717#true} {65718#false} #689#return; {65718#false} is VALID [2022-02-20 19:57:23,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {65718#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; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {65718#false} assume 0 != eval1_~tmp___1~0#1; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {65718#false} assume !(0 == ~p_dw_st~0); {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {65718#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; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {65718#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; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {65718#false} assume 0 == ~c_dr_pc~0; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {65718#false} assume !false; {65718#false} is VALID [2022-02-20 19:57:23,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {65718#false} assume !(1 == ~q_free~0); {65718#false} is VALID [2022-02-20 19:57:23,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {65718#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; {65718#false} is VALID [2022-02-20 19:57:23,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {65718#false} assume !(~p_last_write~0 == ~c_last_read~0); {65718#false} is VALID [2022-02-20 19:57:23,271 INFO L272 TraceCheckUtils]: 63: Hoare triple {65718#false} call error1(); {65718#false} is VALID [2022-02-20 19:57:23,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {65718#false} assume !false; {65718#false} is VALID [2022-02-20 19:57:23,271 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:57:23,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:23,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645228025] [2022-02-20 19:57:23,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645228025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:23,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:23,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:23,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604839685] [2022-02-20 19:57:23,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:57:23,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:23,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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:57:23,316 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:57:23,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:23,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:23,318 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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)