./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:54:37,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:54:37,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:54:37,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:54:37,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:54:37,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:54:37,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:54:37,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:54:37,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:54:37,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:54:37,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:54:37,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:54:37,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:54:37,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:54:37,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:54:37,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:54:37,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:54:37,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:54:37,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:54:37,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:54:37,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:54:37,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:54:37,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:54:37,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:54:37,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:54:37,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:54:37,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:54:37,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:54:37,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:54:37,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:54:37,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:54:37,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:54:37,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:54:37,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:54:37,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:54:37,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:54:37,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:54:37,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:54:37,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:54:37,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:54:37,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:54:37,974 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:54:37,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:54:37,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:54:38,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:54:38,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:54:38,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:54:38,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:54:38,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:54:38,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:54:38,001 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:54:38,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:54:38,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:54:38,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:54:38,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:54:38,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:54:38,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:54:38,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:54:38,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:54:38,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:54:38,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:38,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:54:38,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:54:38,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:54:38,006 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 -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2022-02-20 19:54:38,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:54:38,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:54:38,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:54:38,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:54:38,204 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:54:38,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-02-20 19:54:38,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003cbba24/0237f60660e24d9bb467a3a2130aa947/FLAG30aa6d0b0 [2022-02-20 19:54:38,625 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:54:38,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-02-20 19:54:38,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003cbba24/0237f60660e24d9bb467a3a2130aa947/FLAG30aa6d0b0 [2022-02-20 19:54:39,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003cbba24/0237f60660e24d9bb467a3a2130aa947 [2022-02-20 19:54:39,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:54:39,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:54:39,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:39,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:54:39,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:54:39,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fadd7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39, skipping insertion in model container [2022-02-20 19:54:39,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:54:39,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:54:39,227 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_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-02-20 19:54:39,261 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_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-02-20 19:54:39,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:39,294 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:54:39,302 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_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-02-20 19:54:39,314 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_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-02-20 19:54:39,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:39,352 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:54:39,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39 WrapperNode [2022-02-20 19:54:39,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:39,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:39,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:54:39,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:54:39,359 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:54:39" (1/1) ... [2022-02-20 19:54:39,368 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:54:39" (1/1) ... [2022-02-20 19:54:39,399 INFO L137 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 475 [2022-02-20 19:54:39,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:39,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:54:39,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:54:39,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:54:39,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:54:39,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:54:39,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:54:39,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:54:39,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (1/1) ... [2022-02-20 19:54:39,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:39,469 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:54:39,477 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:54:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:54:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:54:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:54:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-02-20 19:54:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-02-20 19:54:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:54:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:54:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:54:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:54:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:54:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:54:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:54:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:54:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:54:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:54:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:54:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:54:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:54:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:54:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:54:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:54:39,499 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:54:39,596 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:54:39,612 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:54:39,988 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:54:39,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:54:39,995 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:54:39,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:39 BoogieIcfgContainer [2022-02-20 19:54:39,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:54:39,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:54:39,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:54:40,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:54:40,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:54:39" (1/3) ... [2022-02-20 19:54:40,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763af7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:40, skipping insertion in model container [2022-02-20 19:54:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:39" (2/3) ... [2022-02-20 19:54:40,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7763af7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:40, skipping insertion in model container [2022-02-20 19:54:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:39" (3/3) ... [2022-02-20 19:54:40,002 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-02-20 19:54:40,005 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:54:40,006 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:54:40,035 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:54:40,040 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:54:40,041 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:54:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 170 states have (on average 1.5647058823529412) internal successors, (266), 175 states have internal predecessors, (266), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 19:54:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:54:40,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:40,078 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] [2022-02-20 19:54:40,078 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:40,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1508854302, now seen corresponding path program 1 times [2022-02-20 19:54:40,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:40,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94722471] [2022-02-20 19:54:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#true} havoc ~__retres1~2; {207#true} is VALID [2022-02-20 19:54:40,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(= ~p_dw_st~0 0)} assume true; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,315 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {209#(= ~p_dw_st~0 0)} {209#(= ~p_dw_st~0 0)} #702#return; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:54:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {207#true} is VALID [2022-02-20 19:54:40,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} assume 1 == ~p_dw_pc~0; {207#true} is VALID [2022-02-20 19:54:40,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {207#true} is VALID [2022-02-20 19:54:40,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {207#true} is VALID [2022-02-20 19:54:40,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {207#true} is VALID [2022-02-20 19:54:40,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {207#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {207#true} is VALID [2022-02-20 19:54:40,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {207#true} is VALID [2022-02-20 19:54:40,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#true} assume !(1 == ~c_dr_pc~0); {207#true} is VALID [2022-02-20 19:54:40,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {207#true} is VALID [2022-02-20 19:54:40,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {207#true} is VALID [2022-02-20 19:54:40,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {207#true} is VALID [2022-02-20 19:54:40,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {207#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {207#true} is VALID [2022-02-20 19:54:40,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#true} assume true; {207#true} is VALID [2022-02-20 19:54:40,349 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {207#true} {208#false} #706#return; {208#false} is VALID [2022-02-20 19:54:40,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {207#true} is VALID [2022-02-20 19:54:40,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {207#true} is VALID [2022-02-20 19:54:40,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {207#true} is VALID [2022-02-20 19:54:40,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {207#true} is VALID [2022-02-20 19:54:40,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#(= ~p_dw_st~0 0)} assume !false; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(= ~p_dw_st~0 0)} assume !false; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,356 INFO L272 TraceCheckUtils]: 10: Hoare triple {209#(= ~p_dw_st~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {207#true} is VALID [2022-02-20 19:54:40,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {207#true} havoc ~__retres1~2; {207#true} is VALID [2022-02-20 19:54:40,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#(= ~p_dw_st~0 0)} assume true; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {209#(= ~p_dw_st~0 0)} {209#(= ~p_dw_st~0 0)} #702#return; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {209#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {209#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {209#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:40,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {209#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {208#false} is VALID [2022-02-20 19:54:40,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {208#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {208#false} is VALID [2022-02-20 19:54:40,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#false} assume 0 != eval1_~tmp___0~1#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; {208#false} is VALID [2022-02-20 19:54:40,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {208#false} assume 0 == ~c_dr_pc~0; {208#false} is VALID [2022-02-20 19:54:40,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 19:54:40,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {208#false} assume !(1 == ~q_free~0); {208#false} is VALID [2022-02-20 19:54:40,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {208#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_read_ev~0 := 1; {208#false} is VALID [2022-02-20 19:54:40,361 INFO L272 TraceCheckUtils]: 25: Hoare triple {208#false} call immediate_notify_threads(); {229#(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:54:40,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {229#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {207#true} is VALID [2022-02-20 19:54:40,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {207#true} assume 1 == ~p_dw_pc~0; {207#true} is VALID [2022-02-20 19:54:40,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {207#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {207#true} is VALID [2022-02-20 19:54:40,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {207#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {207#true} is VALID [2022-02-20 19:54:40,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {207#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {207#true} is VALID [2022-02-20 19:54:40,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {207#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {207#true} is VALID [2022-02-20 19:54:40,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {207#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {207#true} is VALID [2022-02-20 19:54:40,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {207#true} assume !(1 == ~c_dr_pc~0); {207#true} is VALID [2022-02-20 19:54:40,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {207#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {207#true} is VALID [2022-02-20 19:54:40,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {207#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {207#true} is VALID [2022-02-20 19:54:40,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {207#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {207#true} is VALID [2022-02-20 19:54:40,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {207#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {207#true} is VALID [2022-02-20 19:54:40,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {207#true} assume true; {207#true} is VALID [2022-02-20 19:54:40,369 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {207#true} {208#false} #706#return; {208#false} is VALID [2022-02-20 19:54:40,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {208#false} ~q_read_ev~0 := 2; {208#false} is VALID [2022-02-20 19:54:40,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {208#false} assume !(~p_last_write~0 == ~c_last_read~0); {208#false} is VALID [2022-02-20 19:54:40,370 INFO L272 TraceCheckUtils]: 42: Hoare triple {208#false} call error1(); {208#false} is VALID [2022-02-20 19:54:40,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 19:54:40,370 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:54:40,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:40,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94722471] [2022-02-20 19:54:40,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94722471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:40,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:40,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:40,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769766070] [2022-02-20 19:54:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:40,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:40,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:40,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:40,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:40,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:40,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:40,439 INFO L87 Difference]: Start difference. First operand has 204 states, 170 states have (on average 1.5647058823529412) internal successors, (266), 175 states have internal predecessors, (266), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:40,996 INFO L93 Difference]: Finished difference Result 463 states and 708 transitions. [2022-02-20 19:54:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-02-20 19:54:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-02-20 19:54:41,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 708 transitions. [2022-02-20 19:54:41,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:41,524 INFO L225 Difference]: With dead ends: 463 [2022-02-20 19:54:41,524 INFO L226 Difference]: Without dead ends: 264 [2022-02-20 19:54:41,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:41,529 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 344 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:41,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 530 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-02-20 19:54:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2022-02-20 19:54:41,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:41,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2022-02-20 19:54:41,575 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2022-02-20 19:54:41,576 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2022-02-20 19:54:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,589 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2022-02-20 19:54:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2022-02-20 19:54:41,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) Second operand 264 states. [2022-02-20 19:54:41,594 INFO L87 Difference]: Start difference. First operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) Second operand 264 states. [2022-02-20 19:54:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,602 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2022-02-20 19:54:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2022-02-20 19:54:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:41,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 223 states have internal predecessors, (313), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2022-02-20 19:54:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 369 transitions. [2022-02-20 19:54:41,616 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 369 transitions. Word has length 44 [2022-02-20 19:54:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:41,617 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 369 transitions. [2022-02-20 19:54:41,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 369 transitions. [2022-02-20 19:54:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:41,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:41,619 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] [2022-02-20 19:54:41,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:54:41,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 513116413, now seen corresponding path program 1 times [2022-02-20 19:54:41,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:41,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453930024] [2022-02-20 19:54:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {1757#true} havoc ~__retres1~2; {1757#true} is VALID [2022-02-20 19:54:41,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1757#true} is VALID [2022-02-20 19:54:41,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#true} #res := ~__retres1~2; {1757#true} is VALID [2022-02-20 19:54:41,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-02-20 19:54:41,692 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1757#true} {1759#(= ~q_free~0 1)} #702#return; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {1779#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1757#true} is VALID [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#true} assume 1 == ~p_dw_pc~0; {1757#true} is VALID [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1757#true} is VALID [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {1757#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1757#true} is VALID [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {1757#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1757#true} is VALID [2022-02-20 19:54:41,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1757#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {1757#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1757#true} assume !(1 == ~c_dr_pc~0); {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {1757#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {1757#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1757#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {1757#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1757#true} is VALID [2022-02-20 19:54:41,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-02-20 19:54:41,709 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1757#true} {1758#false} #706#return; {1758#false} is VALID [2022-02-20 19:54:41,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1757#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {1757#true} is VALID [2022-02-20 19:54:41,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {1757#true} is VALID [2022-02-20 19:54:41,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {1759#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {1759#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {1759#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1759#(= ~q_free~0 1)} assume !false; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {1759#(= ~q_free~0 1)} assume !false; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {1759#(= ~q_free~0 1)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {1757#true} is VALID [2022-02-20 19:54:41,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1757#true} havoc ~__retres1~2; {1757#true} is VALID [2022-02-20 19:54:41,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1757#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1757#true} is VALID [2022-02-20 19:54:41,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1757#true} #res := ~__retres1~2; {1757#true} is VALID [2022-02-20 19:54:41,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-02-20 19:54:41,713 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1757#true} {1759#(= ~q_free~0 1)} #702#return; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {1759#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {1759#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {1759#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1759#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~1#1); {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1759#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {1759#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~1#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; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1759#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1759#(= ~q_free~0 1)} assume !false; {1759#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:41,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {1759#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {1758#false} is VALID [2022-02-20 19:54:41,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {1758#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_read_ev~0 := 1; {1758#false} is VALID [2022-02-20 19:54:41,716 INFO L272 TraceCheckUtils]: 26: Hoare triple {1758#false} call immediate_notify_threads(); {1779#(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:54:41,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {1779#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1757#true} is VALID [2022-02-20 19:54:41,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {1757#true} assume 1 == ~p_dw_pc~0; {1757#true} is VALID [2022-02-20 19:54:41,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {1757#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {1757#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1757#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {1757#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {1757#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {1757#true} assume !(1 == ~c_dr_pc~0); {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {1757#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1757#true} is VALID [2022-02-20 19:54:41,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {1757#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1757#true} is VALID [2022-02-20 19:54:41,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {1757#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1757#true} is VALID [2022-02-20 19:54:41,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {1757#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1757#true} is VALID [2022-02-20 19:54:41,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-02-20 19:54:41,718 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1757#true} {1758#false} #706#return; {1758#false} is VALID [2022-02-20 19:54:41,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {1758#false} ~q_read_ev~0 := 2; {1758#false} is VALID [2022-02-20 19:54:41,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {1758#false} assume !(~p_last_write~0 == ~c_last_read~0); {1758#false} is VALID [2022-02-20 19:54:41,718 INFO L272 TraceCheckUtils]: 43: Hoare triple {1758#false} call error1(); {1758#false} is VALID [2022-02-20 19:54:41,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {1758#false} assume !false; {1758#false} is VALID [2022-02-20 19:54:41,719 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:54:41,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:41,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453930024] [2022-02-20 19:54:41,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453930024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:41,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:41,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:41,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620615775] [2022-02-20 19:54:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:41,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:41,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:41,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:41,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:41,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:41,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:41,745 INFO L87 Difference]: Start difference. First operand 258 states and 369 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,219 INFO L93 Difference]: Finished difference Result 506 states and 709 transitions. [2022-02-20 19:54:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:42,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-02-20 19:54:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-02-20 19:54:42,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-02-20 19:54:42,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:42,474 INFO L225 Difference]: With dead ends: 506 [2022-02-20 19:54:42,474 INFO L226 Difference]: Without dead ends: 382 [2022-02-20 19:54:42,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:42,476 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 168 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:42,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 648 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-02-20 19:54:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 325. [2022-02-20 19:54:42,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:42,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2022-02-20 19:54:42,491 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2022-02-20 19:54:42,491 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2022-02-20 19:54:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,501 INFO L93 Difference]: Finished difference Result 382 states and 533 transitions. [2022-02-20 19:54:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 533 transitions. [2022-02-20 19:54:42,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:42,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:42,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) Second operand 382 states. [2022-02-20 19:54:42,504 INFO L87 Difference]: Start difference. First operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) Second operand 382 states. [2022-02-20 19:54:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,514 INFO L93 Difference]: Finished difference Result 382 states and 533 transitions. [2022-02-20 19:54:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 533 transitions. [2022-02-20 19:54:42,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:42,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:42,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:42,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 280 states have (on average 1.417857142857143) internal successors, (397), 284 states have internal predecessors, (397), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2022-02-20 19:54:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 459 transitions. [2022-02-20 19:54:42,548 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 459 transitions. Word has length 45 [2022-02-20 19:54:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:42,549 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 459 transitions. [2022-02-20 19:54:42,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 459 transitions. [2022-02-20 19:54:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:42,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:42,550 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] [2022-02-20 19:54:42,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:42,551 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash -771241048, now seen corresponding path program 1 times [2022-02-20 19:54:42,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:42,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116916245] [2022-02-20 19:54:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {3685#true} havoc ~__retres1~2; {3685#true} is VALID [2022-02-20 19:54:42,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3685#true} is VALID [2022-02-20 19:54:42,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3685#true} #res := ~__retres1~2; {3685#true} is VALID [2022-02-20 19:54:42,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-02-20 19:54:42,586 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3685#true} {3687#(= ~c_dr_pc~0 0)} #702#return; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {3707#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3685#true} is VALID [2022-02-20 19:54:42,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#true} assume 1 == ~p_dw_pc~0; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {3685#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {3685#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {3685#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {3685#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {3685#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3685#true} is VALID [2022-02-20 19:54:42,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {3685#true} assume !(1 == ~c_dr_pc~0); {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {3685#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {3685#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {3685#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {3685#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-02-20 19:54:42,598 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3685#true} {3686#false} #706#return; {3686#false} is VALID [2022-02-20 19:54:42,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {3685#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {3685#true} is VALID [2022-02-20 19:54:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {3685#true} is VALID [2022-02-20 19:54:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3685#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume !false; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {3687#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume !false; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,602 INFO L272 TraceCheckUtils]: 10: Hoare triple {3687#(= ~c_dr_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {3685#true} is VALID [2022-02-20 19:54:42,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {3685#true} havoc ~__retres1~2; {3685#true} is VALID [2022-02-20 19:54:42,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {3685#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3685#true} is VALID [2022-02-20 19:54:42,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {3685#true} #res := ~__retres1~2; {3685#true} is VALID [2022-02-20 19:54:42,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-02-20 19:54:42,603 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3685#true} {3687#(= ~c_dr_pc~0 0)} #702#return; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~1#1); {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~1#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; {3687#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:42,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {3687#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {3686#false} is VALID [2022-02-20 19:54:42,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {3686#false} assume 1 == ~c_dr_pc~0; {3686#false} is VALID [2022-02-20 19:54:42,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {3686#false} do_read_c_~a~0#1 := ~a_t~0; {3686#false} is VALID [2022-02-20 19:54:42,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {3686#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_read_ev~0 := 1; {3686#false} is VALID [2022-02-20 19:54:42,606 INFO L272 TraceCheckUtils]: 26: Hoare triple {3686#false} call immediate_notify_threads(); {3707#(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:54:42,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {3707#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3685#true} is VALID [2022-02-20 19:54:42,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {3685#true} assume 1 == ~p_dw_pc~0; {3685#true} is VALID [2022-02-20 19:54:42,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {3685#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {3685#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {3685#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {3685#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {3685#true} assume !(1 == ~c_dr_pc~0); {3685#true} is VALID [2022-02-20 19:54:42,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {3685#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3685#true} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {3685#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3685#true} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {3685#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3685#true} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {3685#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3685#true} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {3685#true} assume true; {3685#true} is VALID [2022-02-20 19:54:42,608 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3685#true} {3686#false} #706#return; {3686#false} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {3686#false} ~q_read_ev~0 := 2; {3686#false} is VALID [2022-02-20 19:54:42,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {3686#false} assume !(~p_last_write~0 == ~c_last_read~0); {3686#false} is VALID [2022-02-20 19:54:42,609 INFO L272 TraceCheckUtils]: 43: Hoare triple {3686#false} call error1(); {3686#false} is VALID [2022-02-20 19:54:42,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {3686#false} assume !false; {3686#false} is VALID [2022-02-20 19:54:42,609 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:54:42,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:42,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116916245] [2022-02-20 19:54:42,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116916245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:42,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:42,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:42,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226310395] [2022-02-20 19:54:42,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:42,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:42,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:42,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:42,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:42,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:42,648 INFO L87 Difference]: Start difference. First operand 325 states and 459 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:43,022 INFO L93 Difference]: Finished difference Result 733 states and 1018 transitions. [2022-02-20 19:54:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-02-20 19:54:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-02-20 19:54:43,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-02-20 19:54:43,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:43,318 INFO L225 Difference]: With dead ends: 733 [2022-02-20 19:54:43,319 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 19:54:43,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:43,320 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 353 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:43,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 522 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 19:54:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 490. [2022-02-20 19:54:43,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:43,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2022-02-20 19:54:43,336 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2022-02-20 19:54:43,337 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2022-02-20 19:54:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:43,352 INFO L93 Difference]: Finished difference Result 542 states and 740 transitions. [2022-02-20 19:54:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 740 transitions. [2022-02-20 19:54:43,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:43,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:43,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) Second operand 542 states. [2022-02-20 19:54:43,355 INFO L87 Difference]: Start difference. First operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) Second operand 542 states. [2022-02-20 19:54:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:43,369 INFO L93 Difference]: Finished difference Result 542 states and 740 transitions. [2022-02-20 19:54:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 740 transitions. [2022-02-20 19:54:43,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:43,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:43,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:43,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 426 states have (on average 1.3779342723004695) internal successors, (587), 433 states have internal predecessors, (587), 40 states have call successors, (40), 21 states have call predecessors, (40), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2022-02-20 19:54:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 677 transitions. [2022-02-20 19:54:43,386 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 677 transitions. Word has length 45 [2022-02-20 19:54:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:43,386 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 677 transitions. [2022-02-20 19:54:43,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 677 transitions. [2022-02-20 19:54:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 19:54:43,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:43,388 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:43,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:43,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 34524914, now seen corresponding path program 1 times [2022-02-20 19:54:43,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:43,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219893708] [2022-02-20 19:54:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:43,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {6468#true} havoc ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6468#true} is VALID [2022-02-20 19:54:43,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} #res := ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,427 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6468#true} {6468#true} #702#return; {6468#true} is VALID [2022-02-20 19:54:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:54:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:43,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {6468#true} havoc ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6468#true} is VALID [2022-02-20 19:54:43,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} #res := ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,431 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6468#true} {6475#(= ~c_dr_st~0 2)} #702#return; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {6495#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#true} assume 1 == ~p_dw_pc~0; {6468#true} is VALID [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6468#true} is VALID [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {6468#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {6468#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6468#true} is VALID [2022-02-20 19:54:43,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {6468#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {6468#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {6468#true} assume !(1 == ~c_dr_pc~0); {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {6468#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {6468#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {6468#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {6468#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,445 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6468#true} {6469#false} #706#return; {6469#false} is VALID [2022-02-20 19:54:43,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {6468#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {6468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {6468#true} is VALID [2022-02-20 19:54:43,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {6468#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {6468#true} is VALID [2022-02-20 19:54:43,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {6468#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {6468#true} is VALID [2022-02-20 19:54:43,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {6468#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {6468#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {6468#true} assume { :end_inline_init_threads1 } true; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {6468#true} assume !false; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {6468#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {6468#true} assume !false; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L272 TraceCheckUtils]: 10: Hoare triple {6468#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {6468#true} havoc ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {6468#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {6468#true} #res := ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6468#true} {6468#true} #702#return; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {6468#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {6468#true} assume 0 != eval1_~tmp___1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {6468#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {6468#true} assume !(0 != eval1_~tmp~1#1); {6468#true} is VALID [2022-02-20 19:54:43,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {6468#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6468#true} is VALID [2022-02-20 19:54:43,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {6468#true} assume 0 != eval1_~tmp___0~1#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; {6468#true} is VALID [2022-02-20 19:54:43,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {6468#true} assume 0 == ~c_dr_pc~0; {6468#true} is VALID [2022-02-20 19:54:43,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {6468#true} assume !false; {6468#true} is VALID [2022-02-20 19:54:43,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {6468#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {6475#(= ~c_dr_st~0 2)} assume { :end_inline_do_read_c } true; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {6475#(= ~c_dr_st~0 2)} assume !false; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {6475#(= ~c_dr_st~0 2)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6468#true} is VALID [2022-02-20 19:54:43,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {6468#true} havoc ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {6468#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6468#true} is VALID [2022-02-20 19:54:43,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {6468#true} #res := ~__retres1~2; {6468#true} is VALID [2022-02-20 19:54:43,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,454 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6468#true} {6475#(= ~c_dr_st~0 2)} #702#return; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {6475#(= ~c_dr_st~0 2)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {6475#(= ~c_dr_st~0 2)} assume 0 != eval1_~tmp___1~0#1; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {6475#(= ~c_dr_st~0 2)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {6475#(= ~c_dr_st~0 2)} assume !(0 != eval1_~tmp~1#1); {6475#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:43,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {6475#(= ~c_dr_st~0 2)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6469#false} is VALID [2022-02-20 19:54:43,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {6469#false} assume 0 != eval1_~tmp___0~1#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; {6469#false} is VALID [2022-02-20 19:54:43,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {6469#false} assume !(0 == ~c_dr_pc~0); {6469#false} is VALID [2022-02-20 19:54:43,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {6469#false} assume 1 == ~c_dr_pc~0; {6469#false} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {6469#false} do_read_c_~a~0#1 := ~a_t~0; {6469#false} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {6469#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_read_ev~0 := 1; {6469#false} is VALID [2022-02-20 19:54:43,457 INFO L272 TraceCheckUtils]: 43: Hoare triple {6469#false} call immediate_notify_threads(); {6495#(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:54:43,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {6468#true} assume 1 == ~p_dw_pc~0; {6468#true} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {6468#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6468#true} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {6468#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6468#true} is VALID [2022-02-20 19:54:43,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {6468#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {6468#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {6468#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {6468#true} assume !(1 == ~c_dr_pc~0); {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {6468#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {6468#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {6468#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {6468#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6468#true} is VALID [2022-02-20 19:54:43,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {6468#true} assume true; {6468#true} is VALID [2022-02-20 19:54:43,459 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6468#true} {6469#false} #706#return; {6469#false} is VALID [2022-02-20 19:54:43,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {6469#false} ~q_read_ev~0 := 2; {6469#false} is VALID [2022-02-20 19:54:43,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {6469#false} assume !(~p_last_write~0 == ~c_last_read~0); {6469#false} is VALID [2022-02-20 19:54:43,459 INFO L272 TraceCheckUtils]: 60: Hoare triple {6469#false} call error1(); {6469#false} is VALID [2022-02-20 19:54:43,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {6469#false} assume !false; {6469#false} is VALID [2022-02-20 19:54:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:54:43,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:43,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219893708] [2022-02-20 19:54:43,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219893708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:43,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:43,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:43,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885415943] [2022-02-20 19:54:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:43,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:43,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:43,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:43,489 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:54:43,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:43,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:43,490 INFO L87 Difference]: Start difference. First operand 490 states and 677 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:43,985 INFO L93 Difference]: Finished difference Result 1074 states and 1462 transitions. [2022-02-20 19:54:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:43,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 19:54:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 19:54:43,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-02-20 19:54:44,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:44,256 INFO L225 Difference]: With dead ends: 1074 [2022-02-20 19:54:44,257 INFO L226 Difference]: Without dead ends: 718 [2022-02-20 19:54:44,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:44,258 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 152 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:44,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 703 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-02-20 19:54:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 680. [2022-02-20 19:54:44,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:44,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 718 states. Second operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2022-02-20 19:54:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 718 states. Second operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2022-02-20 19:54:44,277 INFO L87 Difference]: Start difference. First operand 718 states. Second operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2022-02-20 19:54:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:44,297 INFO L93 Difference]: Finished difference Result 718 states and 961 transitions. [2022-02-20 19:54:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 961 transitions. [2022-02-20 19:54:44,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:44,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:44,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) Second operand 718 states. [2022-02-20 19:54:44,300 INFO L87 Difference]: Start difference. First operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) Second operand 718 states. [2022-02-20 19:54:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:44,320 INFO L93 Difference]: Finished difference Result 718 states and 961 transitions. [2022-02-20 19:54:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 961 transitions. [2022-02-20 19:54:44,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:44,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:44,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:44,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 592 states have (on average 1.3293918918918919) internal successors, (787), 601 states have internal predecessors, (787), 54 states have call successors, (54), 29 states have call predecessors, (54), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2022-02-20 19:54:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 915 transitions. [2022-02-20 19:54:44,345 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 915 transitions. Word has length 62 [2022-02-20 19:54:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:44,346 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 915 transitions. [2022-02-20 19:54:44,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 915 transitions. [2022-02-20 19:54:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:54:44,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:44,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:44,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:44,347 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash 722596803, now seen corresponding path program 1 times [2022-02-20 19:54:44,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:44,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056008795] [2022-02-20 19:54:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {10354#true} havoc ~__retres1~2; {10354#true} is VALID [2022-02-20 19:54:44,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {10354#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10354#true} is VALID [2022-02-20 19:54:44,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {10354#true} #res := ~__retres1~2; {10354#true} is VALID [2022-02-20 19:54:44,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,378 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10354#true} {10356#(= ~p_dw_pc~0 0)} #702#return; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 19:54:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {10390#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {10354#true} assume 1 == ~p_dw_pc~0; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {10354#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {10354#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {10354#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {10354#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {10354#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {10354#true} assume !(1 == ~c_dr_pc~0); {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {10354#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {10354#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {10354#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {10354#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,388 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10354#true} {10355#false} #704#return; {10355#false} is VALID [2022-02-20 19:54:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:54:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {10390#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {10354#true} assume 1 == ~p_dw_pc~0; {10354#true} is VALID [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {10354#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10354#true} is VALID [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {10354#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {10354#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10354#true} is VALID [2022-02-20 19:54:44,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {10354#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {10354#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {10354#true} assume !(1 == ~c_dr_pc~0); {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {10354#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {10354#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {10354#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {10354#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,395 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10354#true} {10355#false} #706#return; {10355#false} is VALID [2022-02-20 19:54:44,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {10354#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {10354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {10354#true} is VALID [2022-02-20 19:54:44,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {10354#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume !false; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {10356#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume !false; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,398 INFO L272 TraceCheckUtils]: 10: Hoare triple {10356#(= ~p_dw_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {10354#true} is VALID [2022-02-20 19:54:44,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {10354#true} havoc ~__retres1~2; {10354#true} is VALID [2022-02-20 19:54:44,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {10354#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10354#true} is VALID [2022-02-20 19:54:44,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {10354#true} #res := ~__retres1~2; {10354#true} is VALID [2022-02-20 19:54:44,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10354#true} {10356#(= ~p_dw_pc~0 0)} #702#return; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {10356#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {10356#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {10355#false} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {10355#false} assume 1 == ~p_dw_pc~0; {10355#false} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {10355#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {10355#false} is VALID [2022-02-20 19:54:44,401 INFO L272 TraceCheckUtils]: 23: Hoare triple {10355#false} call immediate_notify_threads(); {10390#(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:54:44,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {10390#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {10354#true} assume 1 == ~p_dw_pc~0; {10354#true} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {10354#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10354#true} is VALID [2022-02-20 19:54:44,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {10354#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {10354#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {10354#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {10354#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {10354#true} assume !(1 == ~c_dr_pc~0); {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {10354#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {10354#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {10354#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {10354#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,403 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10354#true} {10355#false} #704#return; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {10355#false} ~q_write_ev~0 := 2; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {10355#false} assume !false; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {10355#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {10355#false} assume { :end_inline_do_write_p } true; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#false} assume 0 != eval1_~tmp___0~1#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; {10355#false} is VALID [2022-02-20 19:54:44,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {10355#false} assume 0 == ~c_dr_pc~0; {10355#false} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {10355#false} assume !false; {10355#false} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {10355#false} assume !(1 == ~q_free~0); {10355#false} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {10355#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_read_ev~0 := 1; {10355#false} is VALID [2022-02-20 19:54:44,404 INFO L272 TraceCheckUtils]: 48: Hoare triple {10355#false} call immediate_notify_threads(); {10390#(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:54:44,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {10390#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {10354#true} assume 1 == ~p_dw_pc~0; {10354#true} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {10354#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {10354#true} is VALID [2022-02-20 19:54:44,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {10354#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {10354#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {10354#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {10354#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {10354#true} assume !(1 == ~c_dr_pc~0); {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {10354#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {10354#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {10354#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {10354#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {10354#true} is VALID [2022-02-20 19:54:44,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {10354#true} assume true; {10354#true} is VALID [2022-02-20 19:54:44,406 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10354#true} {10355#false} #706#return; {10355#false} is VALID [2022-02-20 19:54:44,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {10355#false} ~q_read_ev~0 := 2; {10355#false} is VALID [2022-02-20 19:54:44,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {10355#false} assume !(~p_last_write~0 == ~c_last_read~0); {10355#false} is VALID [2022-02-20 19:54:44,406 INFO L272 TraceCheckUtils]: 65: Hoare triple {10355#false} call error1(); {10355#false} is VALID [2022-02-20 19:54:44,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {10355#false} assume !false; {10355#false} is VALID [2022-02-20 19:54:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 19:54:44,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:44,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056008795] [2022-02-20 19:54:44,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056008795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:44,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:44,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:44,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599255665] [2022-02-20 19:54:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:44,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:44,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:44,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:44,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:44,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:44,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:44,436 INFO L87 Difference]: Start difference. First operand 680 states and 915 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:44,858 INFO L93 Difference]: Finished difference Result 1333 states and 1768 transitions. [2022-02-20 19:54:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-02-20 19:54:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-02-20 19:54:44,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-02-20 19:54:45,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:45,147 INFO L225 Difference]: With dead ends: 1333 [2022-02-20 19:54:45,147 INFO L226 Difference]: Without dead ends: 879 [2022-02-20 19:54:45,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:45,149 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 340 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:45,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 519 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-02-20 19:54:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 824. [2022-02-20 19:54:45,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:45,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 879 states. Second operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2022-02-20 19:54:45,190 INFO L74 IsIncluded]: Start isIncluded. First operand 879 states. Second operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2022-02-20 19:54:45,191 INFO L87 Difference]: Start difference. First operand 879 states. Second operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2022-02-20 19:54:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,220 INFO L93 Difference]: Finished difference Result 879 states and 1155 transitions. [2022-02-20 19:54:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1155 transitions. [2022-02-20 19:54:45,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:45,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:45,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) Second operand 879 states. [2022-02-20 19:54:45,225 INFO L87 Difference]: Start difference. First operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) Second operand 879 states. [2022-02-20 19:54:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,256 INFO L93 Difference]: Finished difference Result 879 states and 1155 transitions. [2022-02-20 19:54:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1155 transitions. [2022-02-20 19:54:45,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:45,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:45,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:45,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 720 states have (on average 1.3027777777777778) internal successors, (938), 731 states have internal predecessors, (938), 62 states have call successors, (62), 35 states have call predecessors, (62), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2022-02-20 19:54:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1088 transitions. [2022-02-20 19:54:45,295 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1088 transitions. Word has length 67 [2022-02-20 19:54:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:45,295 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 1088 transitions. [2022-02-20 19:54:45,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1088 transitions. [2022-02-20 19:54:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:45,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:45,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:45,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:45,297 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 85991846, now seen corresponding path program 1 times [2022-02-20 19:54:45,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:45,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833013530] [2022-02-20 19:54:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,327 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15137#true} {15139#(= ~M_E~0 2)} #714#return; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:54:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume true; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,347 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15184#(= |old(~M_E~0)| 0)} {15139#(= ~M_E~0 2)} #716#return; {15138#false} is VALID [2022-02-20 19:54:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:54:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {15185#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {15137#true} is VALID [2022-02-20 19:54:45,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {15137#true} assume !(1 == ~m_pc~0); {15137#true} is VALID [2022-02-20 19:54:45,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {15137#true} is_master_triggered_~__retres1~4#1 := 0; {15137#true} is VALID [2022-02-20 19:54:45,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {15137#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {15137#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {15137#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {15137#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; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {15137#true} assume 1 == ~t1_pc~0; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {15137#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {15137#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {15137#true} is VALID [2022-02-20 19:54:45,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {15137#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {15137#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {15137#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {15137#true} assume 1 == ~t2_pc~0; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {15137#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {15137#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {15137#true} is VALID [2022-02-20 19:54:45,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {15137#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {15137#true} is VALID [2022-02-20 19:54:45,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {15137#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,363 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15137#true} {15138#false} #718#return; {15138#false} is VALID [2022-02-20 19:54:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:54:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {15137#true} assume !(1 == ~T1_E~0); {15137#true} is VALID [2022-02-20 19:54:45,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {15137#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {15137#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {15137#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {15137#true} assume 1 == ~E_2~0;~E_2~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,368 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15137#true} {15138#false} #720#return; {15138#false} is VALID [2022-02-20 19:54:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:54:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {15137#true} havoc ~__retres1~7; {15137#true} is VALID [2022-02-20 19:54:45,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {15137#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {15137#true} is VALID [2022-02-20 19:54:45,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {15137#true} #res := ~__retres1~7; {15137#true} is VALID [2022-02-20 19:54:45,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,371 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15137#true} {15138#false} #722#return; {15138#false} is VALID [2022-02-20 19:54:45,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {15137#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {15139#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {15139#(= ~M_E~0 2)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {15139#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {15139#(= ~M_E~0 2)} call update_channels2(); {15137#true} is VALID [2022-02-20 19:54:45,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,373 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15137#true} {15139#(= ~M_E~0 2)} #714#return; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {15139#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {15139#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {15139#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {15139#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {15139#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {15139#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:45,375 INFO L272 TraceCheckUtils]: 12: Hoare triple {15139#(= ~M_E~0 2)} call fire_delta_events2(); {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:45,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {15184#(= |old(~M_E~0)| 0)} assume true; {15184#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:45,378 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15184#(= |old(~M_E~0)| 0)} {15139#(= ~M_E~0 2)} #716#return; {15138#false} is VALID [2022-02-20 19:54:45,378 INFO L272 TraceCheckUtils]: 21: Hoare triple {15138#false} call activate_threads2(); {15185#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:54:45,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {15185#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {15137#true} is VALID [2022-02-20 19:54:45,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {15137#true} assume !(1 == ~m_pc~0); {15137#true} is VALID [2022-02-20 19:54:45,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {15137#true} is_master_triggered_~__retres1~4#1 := 0; {15137#true} is VALID [2022-02-20 19:54:45,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {15137#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {15137#true} is VALID [2022-02-20 19:54:45,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {15137#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {15137#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {15137#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; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {15137#true} assume 1 == ~t1_pc~0; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {15137#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {15137#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {15137#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {15137#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {15137#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {15137#true} is VALID [2022-02-20 19:54:45,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {15137#true} assume 1 == ~t2_pc~0; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {15137#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {15137#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {15137#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {15137#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,380 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15137#true} {15138#false} #718#return; {15138#false} is VALID [2022-02-20 19:54:45,380 INFO L272 TraceCheckUtils]: 42: Hoare triple {15138#false} call reset_delta_events2(); {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:45,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {15183#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {15137#true} assume !(1 == ~T1_E~0); {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {15137#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {15137#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {15137#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {15137#true} assume 1 == ~E_2~0;~E_2~0 := 2; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,381 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15137#true} {15138#false} #720#return; {15138#false} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {15138#false} assume !false; {15138#false} is VALID [2022-02-20 19:54:45,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {15138#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {15138#false} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {15138#false} assume !false; {15138#false} is VALID [2022-02-20 19:54:45,382 INFO L272 TraceCheckUtils]: 54: Hoare triple {15138#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {15137#true} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {15137#true} havoc ~__retres1~7; {15137#true} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {15137#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {15137#true} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {15137#true} #res := ~__retres1~7; {15137#true} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {15137#true} assume true; {15137#true} is VALID [2022-02-20 19:54:45,382 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15137#true} {15138#false} #722#return; {15138#false} is VALID [2022-02-20 19:54:45,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {15138#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {15138#false} assume 0 != eval2_~tmp~4#1; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {15138#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {15138#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {15138#false} assume !(0 == ~m_pc~0); {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {15138#false} assume 1 == ~m_pc~0; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {15138#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {15138#false} is VALID [2022-02-20 19:54:45,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {15138#false} assume !false; {15138#false} is VALID [2022-02-20 19:54:45,384 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:54:45,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:45,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833013530] [2022-02-20 19:54:45,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833013530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:45,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:45,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:54:45,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001683186] [2022-02-20 19:54:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:45,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:45,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:45,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:45,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:54:45,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:54:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:54:45,429 INFO L87 Difference]: Start difference. First operand 824 states and 1088 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,854 INFO L93 Difference]: Finished difference Result 1120 states and 1535 transitions. [2022-02-20 19:54:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:54:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 725 transitions. [2022-02-20 19:54:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 725 transitions. [2022-02-20 19:54:46,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 725 transitions. [2022-02-20 19:54:47,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 725 edges. 725 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,357 INFO L225 Difference]: With dead ends: 1120 [2022-02-20 19:54:47,357 INFO L226 Difference]: Without dead ends: 1003 [2022-02-20 19:54:47,357 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:54:47,358 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 553 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:47,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 774 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:54:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-02-20 19:54:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 940. [2022-02-20 19:54:47,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:47,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2022-02-20 19:54:47,384 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2022-02-20 19:54:47,385 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2022-02-20 19:54:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,422 INFO L93 Difference]: Finished difference Result 1003 states and 1359 transitions. [2022-02-20 19:54:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1359 transitions. [2022-02-20 19:54:47,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) Second operand 1003 states. [2022-02-20 19:54:47,427 INFO L87 Difference]: Start difference. First operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) Second operand 1003 states. [2022-02-20 19:54:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,464 INFO L93 Difference]: Finished difference Result 1003 states and 1359 transitions. [2022-02-20 19:54:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1359 transitions. [2022-02-20 19:54:47,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:47,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 818 states have (on average 1.3251833740831296) internal successors, (1084), 830 states have internal predecessors, (1084), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2022-02-20 19:54:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1259 transitions. [2022-02-20 19:54:47,508 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1259 transitions. Word has length 68 [2022-02-20 19:54:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:47,509 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1259 transitions. [2022-02-20 19:54:47,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1259 transitions. [2022-02-20 19:54:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:47,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:47,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:47,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:54:47,511 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1613325866, now seen corresponding path program 1 times [2022-02-20 19:54:47,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:47,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667857686] [2022-02-20 19:54:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,564 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {20034#true} {20036#(= ~T1_E~0 ~M_E~0)} #714#return; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:54:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {20081#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:47,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {20081#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,597 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {20036#(= ~T1_E~0 ~M_E~0)} #716#return; {20035#false} is VALID [2022-02-20 19:54:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:54:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {20083#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {20034#true} is VALID [2022-02-20 19:54:47,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {20034#true} assume !(1 == ~m_pc~0); {20034#true} is VALID [2022-02-20 19:54:47,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {20034#true} is_master_triggered_~__retres1~4#1 := 0; {20034#true} is VALID [2022-02-20 19:54:47,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {20034#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {20034#true} is VALID [2022-02-20 19:54:47,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {20034#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {20034#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {20034#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; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {20034#true} assume 1 == ~t1_pc~0; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {20034#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {20034#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {20034#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {20034#true} is VALID [2022-02-20 19:54:47,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {20034#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {20034#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {20034#true} is VALID [2022-02-20 19:54:47,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {20034#true} assume 1 == ~t2_pc~0; {20034#true} is VALID [2022-02-20 19:54:47,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {20034#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {20034#true} is VALID [2022-02-20 19:54:47,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {20034#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {20034#true} is VALID [2022-02-20 19:54:47,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {20034#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {20034#true} is VALID [2022-02-20 19:54:47,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {20034#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,620 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {20034#true} {20035#false} #718#return; {20035#false} is VALID [2022-02-20 19:54:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:54:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {20034#true} is VALID [2022-02-20 19:54:47,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {20034#true} assume !(1 == ~T1_E~0); {20034#true} is VALID [2022-02-20 19:54:47,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {20034#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {20034#true} assume 1 == ~E_M~0;~E_M~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {20034#true} assume 1 == ~E_1~0;~E_1~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {20034#true} assume 1 == ~E_2~0;~E_2~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,630 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20034#true} {20035#false} #720#return; {20035#false} is VALID [2022-02-20 19:54:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:54:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {20034#true} havoc ~__retres1~7; {20034#true} is VALID [2022-02-20 19:54:47,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {20034#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {20034#true} is VALID [2022-02-20 19:54:47,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {20034#true} #res := ~__retres1~7; {20034#true} is VALID [2022-02-20 19:54:47,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,634 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20034#true} {20035#false} #722#return; {20035#false} is VALID [2022-02-20 19:54:47,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {20034#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {20034#true} is VALID [2022-02-20 19:54:47,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,636 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20034#true} {20036#(= ~T1_E~0 ~M_E~0)} #714#return; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {20036#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:47,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {20036#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:47,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {20081#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:47,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {20081#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:47,641 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20082#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {20036#(= ~T1_E~0 ~M_E~0)} #716#return; {20035#false} is VALID [2022-02-20 19:54:47,641 INFO L272 TraceCheckUtils]: 21: Hoare triple {20035#false} call activate_threads2(); {20083#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {20083#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {20034#true} assume !(1 == ~m_pc~0); {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {20034#true} is_master_triggered_~__retres1~4#1 := 0; {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {20034#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {20034#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {20034#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {20034#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; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {20034#true} assume 1 == ~t1_pc~0; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {20034#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {20034#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {20034#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {20034#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {20034#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {20034#true} assume 1 == ~t2_pc~0; {20034#true} is VALID [2022-02-20 19:54:47,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {20034#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {20034#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {20034#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {20034#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20034#true} {20035#false} #718#return; {20035#false} is VALID [2022-02-20 19:54:47,643 INFO L272 TraceCheckUtils]: 42: Hoare triple {20035#false} call reset_delta_events2(); {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {20080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {20034#true} assume !(1 == ~T1_E~0); {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {20034#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {20034#true} assume 1 == ~E_M~0;~E_M~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {20034#true} assume 1 == ~E_1~0;~E_1~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {20034#true} assume 1 == ~E_2~0;~E_2~0 := 2; {20034#true} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,644 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20034#true} {20035#false} #720#return; {20035#false} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {20035#false} assume !false; {20035#false} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {20035#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {20035#false} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 53: Hoare triple {20035#false} assume !false; {20035#false} is VALID [2022-02-20 19:54:47,644 INFO L272 TraceCheckUtils]: 54: Hoare triple {20035#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {20034#true} is VALID [2022-02-20 19:54:47,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {20034#true} havoc ~__retres1~7; {20034#true} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {20034#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {20034#true} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {20034#true} #res := ~__retres1~7; {20034#true} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {20034#true} assume true; {20034#true} is VALID [2022-02-20 19:54:47,645 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20034#true} {20035#false} #722#return; {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {20035#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {20035#false} assume 0 != eval2_~tmp~4#1; {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {20035#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 63: Hoare triple {20035#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {20035#false} assume !(0 == ~m_pc~0); {20035#false} is VALID [2022-02-20 19:54:47,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {20035#false} assume 1 == ~m_pc~0; {20035#false} is VALID [2022-02-20 19:54:47,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {20035#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {20035#false} is VALID [2022-02-20 19:54:47,646 INFO L290 TraceCheckUtils]: 67: Hoare triple {20035#false} assume !false; {20035#false} is VALID [2022-02-20 19:54:47,646 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:54:47,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:47,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667857686] [2022-02-20 19:54:47,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667857686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:47,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:47,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:47,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085581667] [2022-02-20 19:54:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:47,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:47,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:47,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:47,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:47,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:47,681 INFO L87 Difference]: Start difference. First operand 940 states and 1259 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,522 INFO L93 Difference]: Finished difference Result 1383 states and 1919 transitions. [2022-02-20 19:54:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:54:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 725 transitions. [2022-02-20 19:54:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 725 transitions. [2022-02-20 19:54:49,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 725 transitions. [2022-02-20 19:54:49,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 725 edges. 725 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,048 INFO L225 Difference]: With dead ends: 1383 [2022-02-20 19:54:50,049 INFO L226 Difference]: Without dead ends: 1150 [2022-02-20 19:54:50,049 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:54:50,050 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 570 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:50,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 962 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:54:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-02-20 19:54:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1049. [2022-02-20 19:54:50,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:50,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1150 states. Second operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2022-02-20 19:54:50,081 INFO L74 IsIncluded]: Start isIncluded. First operand 1150 states. Second operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2022-02-20 19:54:50,082 INFO L87 Difference]: Start difference. First operand 1150 states. Second operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2022-02-20 19:54:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,124 INFO L93 Difference]: Finished difference Result 1150 states and 1575 transitions. [2022-02-20 19:54:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1575 transitions. [2022-02-20 19:54:50,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) Second operand 1150 states. [2022-02-20 19:54:50,130 INFO L87 Difference]: Start difference. First operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) Second operand 1150 states. [2022-02-20 19:54:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,173 INFO L93 Difference]: Finished difference Result 1150 states and 1575 transitions. [2022-02-20 19:54:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1575 transitions. [2022-02-20 19:54:50,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:50,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 909 states have (on average 1.3377337733773378) internal successors, (1216), 922 states have internal predecessors, (1216), 84 states have call successors, (84), 47 states have call predecessors, (84), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2022-02-20 19:54:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1415 transitions. [2022-02-20 19:54:50,225 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1415 transitions. Word has length 68 [2022-02-20 19:54:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:50,225 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 1415 transitions. [2022-02-20 19:54:50,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1415 transitions. [2022-02-20 19:54:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:50,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:50,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:50,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:54:50,228 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:50,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1805622424, now seen corresponding path program 1 times [2022-02-20 19:54:50,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:50,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437724432] [2022-02-20 19:54:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,249 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {25723#true} {25725#(= ~E_M~0 ~M_E~0)} #714#return; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:54:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,273 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {25725#(= ~E_M~0 ~M_E~0)} #716#return; {25724#false} is VALID [2022-02-20 19:54:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:54:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {25772#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {25723#true} assume !(1 == ~m_pc~0); {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {25723#true} is_master_triggered_~__retres1~4#1 := 0; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {25723#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {25723#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {25723#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {25723#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; {25723#true} is VALID [2022-02-20 19:54:50,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {25723#true} assume 1 == ~t1_pc~0; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {25723#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {25723#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {25723#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {25723#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {25723#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {25723#true} assume 1 == ~t2_pc~0; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {25723#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {25723#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {25723#true} is VALID [2022-02-20 19:54:50,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {25723#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {25723#true} is VALID [2022-02-20 19:54:50,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {25723#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,297 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25723#true} {25724#false} #718#return; {25724#false} is VALID [2022-02-20 19:54:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:54:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25723#true} is VALID [2022-02-20 19:54:50,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {25723#true} assume !(1 == ~T1_E~0); {25723#true} is VALID [2022-02-20 19:54:50,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {25723#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {25723#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {25723#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {25723#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,302 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25723#true} {25724#false} #720#return; {25724#false} is VALID [2022-02-20 19:54:50,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:54:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {25723#true} havoc ~__retres1~7; {25723#true} is VALID [2022-02-20 19:54:50,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {25723#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {25723#true} is VALID [2022-02-20 19:54:50,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {25723#true} #res := ~__retres1~7; {25723#true} is VALID [2022-02-20 19:54:50,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,307 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25723#true} {25724#false} #722#return; {25724#false} is VALID [2022-02-20 19:54:50,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {25723#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} call update_channels2(); {25723#true} is VALID [2022-02-20 19:54:50,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25723#true} {25725#(= ~E_M~0 ~M_E~0)} #714#return; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {25725#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:50,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {25725#(= ~E_M~0 ~M_E~0)} call fire_delta_events2(); {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:50,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:50,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {25770#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:50,314 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25771#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {25725#(= ~E_M~0 ~M_E~0)} #716#return; {25724#false} is VALID [2022-02-20 19:54:50,314 INFO L272 TraceCheckUtils]: 21: Hoare triple {25724#false} call activate_threads2(); {25772#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {25772#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {25723#true} assume !(1 == ~m_pc~0); {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {25723#true} is_master_triggered_~__retres1~4#1 := 0; {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {25723#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {25723#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {25723#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {25723#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; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {25723#true} assume 1 == ~t1_pc~0; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {25723#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {25723#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {25723#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {25723#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {25723#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {25723#true} assume 1 == ~t2_pc~0; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {25723#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {25723#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {25723#true} is VALID [2022-02-20 19:54:50,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {25723#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {25723#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25723#true} {25724#false} #718#return; {25724#false} is VALID [2022-02-20 19:54:50,316 INFO L272 TraceCheckUtils]: 42: Hoare triple {25724#false} call reset_delta_events2(); {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {25769#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {25723#true} assume !(1 == ~T1_E~0); {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {25723#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {25723#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {25723#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {25723#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25723#true} {25724#false} #720#return; {25724#false} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {25724#false} assume !false; {25724#false} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {25724#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {25724#false} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {25724#false} assume !false; {25724#false} is VALID [2022-02-20 19:54:50,317 INFO L272 TraceCheckUtils]: 54: Hoare triple {25724#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {25723#true} havoc ~__retres1~7; {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {25723#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {25723#true} is VALID [2022-02-20 19:54:50,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {25723#true} #res := ~__retres1~7; {25723#true} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {25723#true} assume true; {25723#true} is VALID [2022-02-20 19:54:50,318 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25723#true} {25724#false} #722#return; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {25724#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {25724#false} assume 0 != eval2_~tmp~4#1; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {25724#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {25724#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {25724#false} assume !(0 == ~m_pc~0); {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {25724#false} assume 1 == ~m_pc~0; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {25724#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {25724#false} is VALID [2022-02-20 19:54:50,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {25724#false} assume !false; {25724#false} is VALID [2022-02-20 19:54:50,319 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:54:50,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:50,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437724432] [2022-02-20 19:54:50,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437724432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:50,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:50,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:50,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439294876] [2022-02-20 19:54:50,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:50,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:50,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:50,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:50,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:50,352 INFO L87 Difference]: Start difference. First operand 1049 states and 1415 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:52,759 INFO L93 Difference]: Finished difference Result 1842 states and 2589 transitions. [2022-02-20 19:54:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:54:52,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 783 transitions. [2022-02-20 19:54:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 783 transitions. [2022-02-20 19:54:52,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 783 transitions. [2022-02-20 19:54:53,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:53,408 INFO L225 Difference]: With dead ends: 1842 [2022-02-20 19:54:53,408 INFO L226 Difference]: Without dead ends: 1500 [2022-02-20 19:54:53,409 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:54:53,409 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 569 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:53,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 1204 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:54:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-02-20 19:54:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1265. [2022-02-20 19:54:53,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:53,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1500 states. Second operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2022-02-20 19:54:53,451 INFO L74 IsIncluded]: Start isIncluded. First operand 1500 states. Second operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2022-02-20 19:54:53,453 INFO L87 Difference]: Start difference. First operand 1500 states. Second operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2022-02-20 19:54:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,516 INFO L93 Difference]: Finished difference Result 1500 states and 2084 transitions. [2022-02-20 19:54:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2084 transitions. [2022-02-20 19:54:53,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) Second operand 1500 states. [2022-02-20 19:54:53,523 INFO L87 Difference]: Start difference. First operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) Second operand 1500 states. [2022-02-20 19:54:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,585 INFO L93 Difference]: Finished difference Result 1500 states and 2084 transitions. [2022-02-20 19:54:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2084 transitions. [2022-02-20 19:54:53,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:53,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1091 states have (on average 1.3593033913840513) internal successors, (1483), 1106 states have internal predecessors, (1483), 104 states have call successors, (104), 59 states have call predecessors, (104), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2022-02-20 19:54:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1730 transitions. [2022-02-20 19:54:53,653 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1730 transitions. Word has length 68 [2022-02-20 19:54:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:53,653 INFO L470 AbstractCegarLoop]: Abstraction has 1265 states and 1730 transitions. [2022-02-20 19:54:53,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1730 transitions. [2022-02-20 19:54:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:53,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:53,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:53,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:54:53,655 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash -267282394, now seen corresponding path program 1 times [2022-02-20 19:54:53,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:53,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112446231] [2022-02-20 19:54:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,703 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {32998#true} {33000#(= ~E_1~0 ~M_E~0)} #714#return; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:54:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,725 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {33000#(= ~E_1~0 ~M_E~0)} #716#return; {32999#false} is VALID [2022-02-20 19:54:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:54:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {33047#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {32998#true} assume !(1 == ~m_pc~0); {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {32998#true} is_master_triggered_~__retres1~4#1 := 0; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {32998#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {32998#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {32998#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {32998#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; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {32998#true} assume 1 == ~t1_pc~0; {32998#true} is VALID [2022-02-20 19:54:53,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {32998#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {32998#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {32998#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {32998#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {32998#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {32998#true} assume 1 == ~t2_pc~0; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {32998#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {32998#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {32998#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {32998#true} is VALID [2022-02-20 19:54:53,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {32998#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,738 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {32998#true} {32999#false} #718#return; {32999#false} is VALID [2022-02-20 19:54:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:54:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {32998#true} assume !(1 == ~T1_E~0); {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {32998#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {32998#true} assume 1 == ~E_M~0;~E_M~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {32998#true} assume 1 == ~E_1~0;~E_1~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {32998#true} assume 1 == ~E_2~0;~E_2~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,741 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32998#true} {32999#false} #720#return; {32999#false} is VALID [2022-02-20 19:54:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:54:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:53,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {32998#true} havoc ~__retres1~7; {32998#true} is VALID [2022-02-20 19:54:53,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {32998#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {32998#true} is VALID [2022-02-20 19:54:53,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {32998#true} #res := ~__retres1~7; {32998#true} is VALID [2022-02-20 19:54:53,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,744 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32998#true} {32999#false} #722#return; {32999#false} is VALID [2022-02-20 19:54:53,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {32998#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} call update_channels2(); {32998#true} is VALID [2022-02-20 19:54:53,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,746 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32998#true} {33000#(= ~E_1~0 ~M_E~0)} #714#return; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {33000#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:53,748 INFO L272 TraceCheckUtils]: 12: Hoare triple {33000#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:53,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:53,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {33045#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:53,750 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {33046#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {33000#(= ~E_1~0 ~M_E~0)} #716#return; {32999#false} is VALID [2022-02-20 19:54:53,750 INFO L272 TraceCheckUtils]: 21: Hoare triple {32999#false} call activate_threads2(); {33047#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:54:53,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {33047#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {32998#true} is VALID [2022-02-20 19:54:53,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {32998#true} assume !(1 == ~m_pc~0); {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {32998#true} is_master_triggered_~__retres1~4#1 := 0; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {32998#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {32998#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {32998#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {32998#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; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {32998#true} assume 1 == ~t1_pc~0; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {32998#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {32998#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {32998#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {32998#true} is VALID [2022-02-20 19:54:53,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {32998#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {32998#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {32998#true} assume 1 == ~t2_pc~0; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {32998#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {32998#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {32998#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {32998#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,752 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32998#true} {32999#false} #718#return; {32999#false} is VALID [2022-02-20 19:54:53,752 INFO L272 TraceCheckUtils]: 42: Hoare triple {32999#false} call reset_delta_events2(); {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {33044#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {32998#true} assume !(1 == ~T1_E~0); {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {32998#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {32998#true} assume 1 == ~E_M~0;~E_M~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {32998#true} assume 1 == ~E_1~0;~E_1~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {32998#true} assume 1 == ~E_2~0;~E_2~0 := 2; {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,753 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {32998#true} {32999#false} #720#return; {32999#false} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {32999#false} assume !false; {32999#false} is VALID [2022-02-20 19:54:53,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {32999#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {32999#false} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {32999#false} assume !false; {32999#false} is VALID [2022-02-20 19:54:53,763 INFO L272 TraceCheckUtils]: 54: Hoare triple {32999#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {32998#true} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {32998#true} havoc ~__retres1~7; {32998#true} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {32998#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {32998#true} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {32998#true} #res := ~__retres1~7; {32998#true} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {32998#true} assume true; {32998#true} is VALID [2022-02-20 19:54:53,763 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32998#true} {32999#false} #722#return; {32999#false} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {32999#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {32999#false} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {32999#false} assume 0 != eval2_~tmp~4#1; {32999#false} is VALID [2022-02-20 19:54:53,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {32999#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {32999#false} is VALID [2022-02-20 19:54:53,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {32999#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {32999#false} is VALID [2022-02-20 19:54:53,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {32999#false} assume !(0 == ~m_pc~0); {32999#false} is VALID [2022-02-20 19:54:53,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {32999#false} assume 1 == ~m_pc~0; {32999#false} is VALID [2022-02-20 19:54:53,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {32999#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {32999#false} is VALID [2022-02-20 19:54:53,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {32999#false} assume !false; {32999#false} is VALID [2022-02-20 19:54:53,764 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:54:53,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:53,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112446231] [2022-02-20 19:54:53,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112446231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:53,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:53,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:53,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880059062] [2022-02-20 19:54:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:53,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:53,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:53,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:53,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:53,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:53,817 INFO L87 Difference]: Start difference. First operand 1265 states and 1730 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:56,217 INFO L93 Difference]: Finished difference Result 2602 states and 3696 transitions. [2022-02-20 19:54:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:54:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 764 transitions. [2022-02-20 19:54:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 764 transitions. [2022-02-20 19:54:56,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 764 transitions. [2022-02-20 19:54:56,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:56,842 INFO L225 Difference]: With dead ends: 2602 [2022-02-20 19:54:56,842 INFO L226 Difference]: Without dead ends: 2044 [2022-02-20 19:54:56,843 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:54:56,845 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 598 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:56,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 1155 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:54:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2022-02-20 19:54:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1672. [2022-02-20 19:54:56,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:56,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2044 states. Second operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2022-02-20 19:54:56,895 INFO L74 IsIncluded]: Start isIncluded. First operand 2044 states. Second operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2022-02-20 19:54:56,896 INFO L87 Difference]: Start difference. First operand 2044 states. Second operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2022-02-20 19:54:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:57,018 INFO L93 Difference]: Finished difference Result 2044 states and 2870 transitions. [2022-02-20 19:54:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2870 transitions. [2022-02-20 19:54:57,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:57,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:57,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) Second operand 2044 states. [2022-02-20 19:54:57,026 INFO L87 Difference]: Start difference. First operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) Second operand 2044 states. [2022-02-20 19:54:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:57,146 INFO L93 Difference]: Finished difference Result 2044 states and 2870 transitions. [2022-02-20 19:54:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2870 transitions. [2022-02-20 19:54:57,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:57,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:57,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:57,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1432 states have (on average 1.3833798882681565) internal successors, (1981), 1451 states have internal predecessors, (1981), 142 states have call successors, (142), 83 states have call predecessors, (142), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2022-02-20 19:54:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2326 transitions. [2022-02-20 19:54:57,272 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2326 transitions. Word has length 68 [2022-02-20 19:54:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:57,272 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 2326 transitions. [2022-02-20 19:54:57,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2326 transitions. [2022-02-20 19:54:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:57,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:57,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:57,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:54:57,278 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1999098792, now seen corresponding path program 1 times [2022-02-20 19:54:57,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:57,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032689340] [2022-02-20 19:54:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,310 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {42888#true} {42890#(= ~E_2~0 ~M_E~0)} #714#return; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:54:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,333 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {42890#(= ~E_2~0 ~M_E~0)} #716#return; {42889#false} is VALID [2022-02-20 19:54:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:54:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {42937#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} assume !(1 == ~m_pc~0); {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} is_master_triggered_~__retres1~4#1 := 0; {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {42888#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {42888#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {42888#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; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {42888#true} assume 1 == ~t1_pc~0; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {42888#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {42888#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {42888#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {42888#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {42888#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {42888#true} assume 1 == ~t2_pc~0; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {42888#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {42888#true} is VALID [2022-02-20 19:54:57,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {42888#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {42888#true} is VALID [2022-02-20 19:54:57,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {42888#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {42888#true} is VALID [2022-02-20 19:54:57,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {42888#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,349 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {42888#true} {42889#false} #718#return; {42889#false} is VALID [2022-02-20 19:54:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:54:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} assume !(1 == ~T1_E~0); {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {42888#true} assume 1 == ~E_M~0;~E_M~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {42888#true} assume 1 == ~E_1~0;~E_1~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} assume 1 == ~E_2~0;~E_2~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,353 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42888#true} {42889#false} #720#return; {42889#false} is VALID [2022-02-20 19:54:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:54:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {42888#true} havoc ~__retres1~7; {42888#true} is VALID [2022-02-20 19:54:57,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {42888#true} is VALID [2022-02-20 19:54:57,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} #res := ~__retres1~7; {42888#true} is VALID [2022-02-20 19:54:57,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,355 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42888#true} {42889#false} #722#return; {42889#false} is VALID [2022-02-20 19:54:57,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {42888#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} call update_channels2(); {42888#true} is VALID [2022-02-20 19:54:57,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,357 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42888#true} {42890#(= ~E_2~0 ~M_E~0)} #714#return; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {42890#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {42890#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:57,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:57,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {42935#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,362 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {42936#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {42890#(= ~E_2~0 ~M_E~0)} #716#return; {42889#false} is VALID [2022-02-20 19:54:57,362 INFO L272 TraceCheckUtils]: 21: Hoare triple {42889#false} call activate_threads2(); {42937#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {42937#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {42888#true} assume !(1 == ~m_pc~0); {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {42888#true} is_master_triggered_~__retres1~4#1 := 0; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {42888#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {42888#true} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {42888#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {42888#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; {42888#true} is VALID [2022-02-20 19:54:57,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {42888#true} assume 1 == ~t1_pc~0; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {42888#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {42888#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {42888#true} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {42888#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {42888#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {42888#true} assume 1 == ~t2_pc~0; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {42888#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {42888#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {42888#true} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {42888#true} is VALID [2022-02-20 19:54:57,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {42888#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {42888#true} {42889#false} #718#return; {42889#false} is VALID [2022-02-20 19:54:57,364 INFO L272 TraceCheckUtils]: 42: Hoare triple {42889#false} call reset_delta_events2(); {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {42934#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {42888#true} assume !(1 == ~T1_E~0); {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {42888#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {42888#true} assume 1 == ~E_M~0;~E_M~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {42888#true} assume 1 == ~E_1~0;~E_1~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {42888#true} assume 1 == ~E_2~0;~E_2~0 := 2; {42888#true} is VALID [2022-02-20 19:54:57,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,365 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {42888#true} {42889#false} #720#return; {42889#false} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {42889#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {42889#false} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-02-20 19:54:57,365 INFO L272 TraceCheckUtils]: 54: Hoare triple {42889#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {42888#true} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {42888#true} havoc ~__retres1~7; {42888#true} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {42888#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {42888#true} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {42888#true} #res := ~__retres1~7; {42888#true} is VALID [2022-02-20 19:54:57,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-02-20 19:54:57,366 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {42888#true} {42889#false} #722#return; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {42889#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {42889#false} assume 0 != eval2_~tmp~4#1; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {42889#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {42889#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {42889#false} assume !(0 == ~m_pc~0); {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {42889#false} assume 1 == ~m_pc~0; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {42889#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {42889#false} is VALID [2022-02-20 19:54:57,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-02-20 19:54:57,367 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:54:57,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:57,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032689340] [2022-02-20 19:54:57,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032689340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:57,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:57,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:57,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427273984] [2022-02-20 19:54:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:57,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:57,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:57,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:57,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:57,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:57,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:57,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:57,399 INFO L87 Difference]: Start difference. First operand 1672 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:59,588 INFO L93 Difference]: Finished difference Result 3969 states and 5696 transitions. [2022-02-20 19:54:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:54:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:54:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 743 transitions. [2022-02-20 19:54:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 743 transitions. [2022-02-20 19:54:59,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 743 transitions. [2022-02-20 19:54:59,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 743 edges. 743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:00,275 INFO L225 Difference]: With dead ends: 3969 [2022-02-20 19:55:00,275 INFO L226 Difference]: Without dead ends: 3004 [2022-02-20 19:55:00,277 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:55:00,278 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 559 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:00,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 1133 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:55:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-02-20 19:55:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2495. [2022-02-20 19:55:00,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:00,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3004 states. Second operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:00,352 INFO L74 IsIncluded]: Start isIncluded. First operand 3004 states. Second operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:00,354 INFO L87 Difference]: Start difference. First operand 3004 states. Second operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,591 INFO L93 Difference]: Finished difference Result 3004 states and 4262 transitions. [2022-02-20 19:55:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4262 transitions. [2022-02-20 19:55:00,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) Second operand 3004 states. [2022-02-20 19:55:00,602 INFO L87 Difference]: Start difference. First operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) Second operand 3004 states. [2022-02-20 19:55:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,844 INFO L93 Difference]: Finished difference Result 3004 states and 4262 transitions. [2022-02-20 19:55:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4262 transitions. [2022-02-20 19:55:00,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:00,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2131 states have (on average 1.4120131393711872) internal successors, (3009), 2158 states have internal predecessors, (3009), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3556 transitions. [2022-02-20 19:55:01,111 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3556 transitions. Word has length 68 [2022-02-20 19:55:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:01,111 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 3556 transitions. [2022-02-20 19:55:01,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3556 transitions. [2022-02-20 19:55:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:55:01,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:01,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:01,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:55:01,113 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1518018534, now seen corresponding path program 1 times [2022-02-20 19:55:01,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:01,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639757046] [2022-02-20 19:55:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,138 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {57556#true} {57556#true} #714#return; {57556#true} is VALID [2022-02-20 19:55:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:55:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {57556#true} is VALID [2022-02-20 19:55:01,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {57556#true} assume !(0 == ~T1_E~0); {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {57556#true} assume !(0 == ~T2_E~0); {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {57556#true} assume !(0 == ~E_M~0); {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {57556#true} assume !(0 == ~E_1~0); {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {57556#true} assume !(0 == ~E_2~0); {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,147 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57556#true} {57556#true} #716#return; {57556#true} is VALID [2022-02-20 19:55:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:55:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {57602#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {57556#true} is VALID [2022-02-20 19:55:01,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {57556#true} assume !(1 == ~m_pc~0); {57556#true} is VALID [2022-02-20 19:55:01,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {57556#true} is_master_triggered_~__retres1~4#1 := 0; {57603#(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:55:01,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {57603#(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; {57604#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:55:01,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {57604#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {57605#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {57605#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} assume 0 != ~tmp~5#1;~m_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {57557#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; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {57557#false} assume 1 == ~t1_pc~0; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {57557#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {57557#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {57557#false} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {57557#false} is VALID [2022-02-20 19:55:01,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {57557#false} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {57557#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {57557#false} assume 1 == ~t2_pc~0; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {57557#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {57557#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {57557#false} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {57557#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {57557#false} assume true; {57557#false} is VALID [2022-02-20 19:55:01,202 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {57557#false} {57556#true} #718#return; {57557#false} is VALID [2022-02-20 19:55:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:55:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {57556#true} is VALID [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {57556#true} assume !(1 == ~T1_E~0); {57556#true} is VALID [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {57556#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {57556#true} assume 1 == ~E_M~0;~E_M~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {57556#true} assume 1 == ~E_1~0;~E_1~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {57556#true} assume 1 == ~E_2~0;~E_2~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,208 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57556#true} {57557#false} #720#return; {57557#false} is VALID [2022-02-20 19:55:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:55:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {57556#true} havoc ~__retres1~7; {57556#true} is VALID [2022-02-20 19:55:01,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {57556#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {57556#true} #res := ~__retres1~7; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57556#true} {57557#false} #722#return; {57557#false} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {57556#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {57556#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {57556#true} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {57556#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {57556#true} call update_channels2(); {57556#true} is VALID [2022-02-20 19:55:01,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57556#true} {57556#true} #714#return; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {57556#true} assume { :begin_inline_init_threads2 } true; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {57556#true} assume 1 == ~m_i~0;~m_st~0 := 0; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {57556#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {57556#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {57556#true} is VALID [2022-02-20 19:55:01,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {57556#true} assume { :end_inline_init_threads2 } true; {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L272 TraceCheckUtils]: 12: Hoare triple {57556#true} call fire_delta_events2(); {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {57556#true} assume !(0 == ~T1_E~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {57556#true} assume !(0 == ~T2_E~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {57556#true} assume !(0 == ~E_M~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {57556#true} assume !(0 == ~E_1~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {57556#true} assume !(0 == ~E_2~0); {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,216 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {57556#true} {57556#true} #716#return; {57556#true} is VALID [2022-02-20 19:55:01,217 INFO L272 TraceCheckUtils]: 21: Hoare triple {57556#true} call activate_threads2(); {57602#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:55:01,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {57602#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {57556#true} is VALID [2022-02-20 19:55:01,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {57556#true} assume !(1 == ~m_pc~0); {57556#true} is VALID [2022-02-20 19:55:01,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {57556#true} is_master_triggered_~__retres1~4#1 := 0; {57603#(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:55:01,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {57603#(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; {57604#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:55:01,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {57604#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {57605#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {57605#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} assume 0 != ~tmp~5#1;~m_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {57557#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; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {57557#false} assume 1 == ~t1_pc~0; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {57557#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {57557#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {57557#false} #t~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {57557#false} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {57557#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {57557#false} is VALID [2022-02-20 19:55:01,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {57557#false} assume 1 == ~t2_pc~0; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {57557#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {57557#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {57557#false} #t~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {57557#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {57557#false} assume true; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {57557#false} {57556#true} #718#return; {57557#false} is VALID [2022-02-20 19:55:01,220 INFO L272 TraceCheckUtils]: 42: Hoare triple {57557#false} call reset_delta_events2(); {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {57601#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {57556#true} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {57556#true} assume !(1 == ~T1_E~0); {57556#true} is VALID [2022-02-20 19:55:01,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {57556#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {57556#true} assume 1 == ~E_M~0;~E_M~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {57556#true} assume 1 == ~E_1~0;~E_1~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {57556#true} assume 1 == ~E_2~0;~E_2~0 := 2; {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {57556#true} {57557#false} #720#return; {57557#false} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {57557#false} assume !false; {57557#false} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {57557#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {57557#false} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {57557#false} assume !false; {57557#false} is VALID [2022-02-20 19:55:01,221 INFO L272 TraceCheckUtils]: 54: Hoare triple {57557#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {57556#true} is VALID [2022-02-20 19:55:01,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {57556#true} havoc ~__retres1~7; {57556#true} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {57556#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {57556#true} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {57556#true} #res := ~__retres1~7; {57556#true} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {57556#true} assume true; {57556#true} is VALID [2022-02-20 19:55:01,222 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {57556#true} {57557#false} #722#return; {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {57557#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {57557#false} assume 0 != eval2_~tmp~4#1; {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {57557#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {57557#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {57557#false} assume !(0 == ~m_pc~0); {57557#false} is VALID [2022-02-20 19:55:01,222 INFO L290 TraceCheckUtils]: 65: Hoare triple {57557#false} assume 1 == ~m_pc~0; {57557#false} is VALID [2022-02-20 19:55:01,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {57557#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {57557#false} is VALID [2022-02-20 19:55:01,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {57557#false} assume !false; {57557#false} is VALID [2022-02-20 19:55:01,223 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:55:01,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:01,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639757046] [2022-02-20 19:55:01,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639757046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:01,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:01,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:01,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212448429] [2022-02-20 19:55:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:01,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:55:01,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:01,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:01,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:01,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:01,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:01,278 INFO L87 Difference]: Start difference. First operand 2495 states and 3556 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:04,270 INFO L93 Difference]: Finished difference Result 5278 states and 7681 transitions. [2022-02-20 19:55:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:55:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:55:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 567 transitions. [2022-02-20 19:55:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 567 transitions. [2022-02-20 19:55:04,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 567 transitions. [2022-02-20 19:55:04,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:05,171 INFO L225 Difference]: With dead ends: 5278 [2022-02-20 19:55:05,171 INFO L226 Difference]: Without dead ends: 3491 [2022-02-20 19:55:05,174 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:55:05,175 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 321 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:05,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 984 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2022-02-20 19:55:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 2546. [2022-02-20 19:55:05,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:05,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3491 states. Second operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:05,456 INFO L74 IsIncluded]: Start isIncluded. First operand 3491 states. Second operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:05,458 INFO L87 Difference]: Start difference. First operand 3491 states. Second operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:05,801 INFO L93 Difference]: Finished difference Result 3491 states and 4967 transitions. [2022-02-20 19:55:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4967 transitions. [2022-02-20 19:55:05,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:05,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:05,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) Second operand 3491 states. [2022-02-20 19:55:05,843 INFO L87 Difference]: Start difference. First operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) Second operand 3491 states. [2022-02-20 19:55:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:06,208 INFO L93 Difference]: Finished difference Result 3491 states and 4967 transitions. [2022-02-20 19:55:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4967 transitions. [2022-02-20 19:55:06,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:06,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:06,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:06,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2182 states have (on average 1.4023831347387719) internal successors, (3060), 2209 states have internal predecessors, (3060), 212 states have call successors, (212), 129 states have call predecessors, (212), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2022-02-20 19:55:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3607 transitions. [2022-02-20 19:55:06,477 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3607 transitions. Word has length 68 [2022-02-20 19:55:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:06,477 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 3607 transitions. [2022-02-20 19:55:06,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3607 transitions. [2022-02-20 19:55:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:55:06,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:06,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:06,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:55:06,481 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1941665256, now seen corresponding path program 1 times [2022-02-20 19:55:06,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:06,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254402702] [2022-02-20 19:55:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,526 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {74963#true} {74965#(= ~m_pc~0 ~t1_pc~0)} #714#return; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:55:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {74963#true} assume !(0 == ~T1_E~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {74963#true} assume !(0 == ~T2_E~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {74963#true} assume !(0 == ~E_M~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {74963#true} assume !(0 == ~E_1~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {74963#true} assume !(0 == ~E_2~0); {74963#true} is VALID [2022-02-20 19:55:06,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,538 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74963#true} {74965#(= ~m_pc~0 ~t1_pc~0)} #716#return; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:55:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {75010#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {74963#true} is VALID [2022-02-20 19:55:06,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {74963#true} assume !(1 == ~m_pc~0); {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~5#1); {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {75011#(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; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {75012#(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:55:06,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {75012#(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; {75012#(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:55:06,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {75012#(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; {75012#(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:55:06,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {75012#(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~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {75012#(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:55:06,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {75012#(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~2#1;~t1_st~0 := 0; {75012#(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:55:06,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {75012#(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 { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {75012#(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:55:06,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {75012#(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 == ~t2_pc~0; {75012#(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:55:06,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {75012#(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_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {75012#(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:55:06,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {75012#(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_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {75012#(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:55:06,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {75012#(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~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {75012#(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:55:06,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {75012#(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___1~1#1;~t2_st~0 := 0; {75012#(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:55:06,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {75012#(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; {75012#(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:55:06,610 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {75012#(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)))} {74965#(= ~m_pc~0 ~t1_pc~0)} #718#return; {74964#false} is VALID [2022-02-20 19:55:06,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:55:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {74963#true} is VALID [2022-02-20 19:55:06,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {74963#true} assume !(1 == ~T1_E~0); {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {74963#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {74963#true} assume 1 == ~E_M~0;~E_M~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {74963#true} assume 1 == ~E_1~0;~E_1~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {74963#true} assume 1 == ~E_2~0;~E_2~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,617 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74963#true} {74964#false} #720#return; {74964#false} is VALID [2022-02-20 19:55:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:55:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {74963#true} havoc ~__retres1~7; {74963#true} is VALID [2022-02-20 19:55:06,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {74963#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {74963#true} is VALID [2022-02-20 19:55:06,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {74963#true} #res := ~__retres1~7; {74963#true} is VALID [2022-02-20 19:55:06,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,620 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74963#true} {74964#false} #722#return; {74964#false} is VALID [2022-02-20 19:55:06,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {74963#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret26#1, start_simulation2_#t~ret27#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {74963#true} is VALID [2022-02-20 19:55:06,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,622 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {74963#true} {74965#(= ~m_pc~0 ~t1_pc~0)} #714#return; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:55:06,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {74963#true} assume !(0 == ~T1_E~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {74963#true} assume !(0 == ~T2_E~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {74963#true} assume !(0 == ~E_M~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {74963#true} assume !(0 == ~E_1~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {74963#true} assume !(0 == ~E_2~0); {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,625 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {74963#true} {74965#(= ~m_pc~0 ~t1_pc~0)} #716#return; {74965#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:55:06,626 INFO L272 TraceCheckUtils]: 21: Hoare triple {74965#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {75010#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:55:06,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {75010#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;havoc ~tmp___1~1#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; {74963#true} is VALID [2022-02-20 19:55:06,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {74963#true} assume !(1 == ~m_pc~0); {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret22#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp~5#1 := #t~ret22#1;havoc #t~ret22#1; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~5#1); {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {75011#(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; {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:55:06,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {75011#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {75012#(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:55:06,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {75012#(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; {75012#(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:55:06,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {75012#(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; {75012#(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:55:06,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {75012#(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~ret23#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp___0~2#1 := #t~ret23#1;havoc #t~ret23#1; {75012#(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:55:06,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {75012#(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~2#1;~t1_st~0 := 0; {75012#(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:55:06,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {75012#(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 { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {75012#(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:55:06,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {75012#(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 == ~t2_pc~0; {75012#(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:55:06,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {75012#(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_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {75012#(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:55:06,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {75012#(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_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {75012#(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:55:06,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {75012#(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~ret24#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___1~1#1 := #t~ret24#1;havoc #t~ret24#1; {75012#(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:55:06,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {75012#(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___1~1#1;~t2_st~0 := 0; {75012#(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:55:06,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {75012#(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; {75012#(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:55:06,633 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75012#(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)))} {74965#(= ~m_pc~0 ~t1_pc~0)} #718#return; {74964#false} is VALID [2022-02-20 19:55:06,633 INFO L272 TraceCheckUtils]: 42: Hoare triple {74964#false} call reset_delta_events2(); {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:55:06,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {75009#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {74963#true} assume !(1 == ~T1_E~0); {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {74963#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {74963#true} assume 1 == ~E_M~0;~E_M~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {74963#true} assume 1 == ~E_1~0;~E_1~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {74963#true} assume 1 == ~E_2~0;~E_2~0 := 2; {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,634 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {74963#true} {74964#false} #720#return; {74964#false} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {74964#false} assume !false; {74964#false} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {74964#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {74964#false} is VALID [2022-02-20 19:55:06,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {74964#false} assume !false; {74964#false} is VALID [2022-02-20 19:55:06,635 INFO L272 TraceCheckUtils]: 54: Hoare triple {74964#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {74963#true} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {74963#true} havoc ~__retres1~7; {74963#true} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {74963#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {74963#true} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {74963#true} #res := ~__retres1~7; {74963#true} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {74963#true} assume true; {74963#true} is VALID [2022-02-20 19:55:06,635 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {74963#true} {74964#false} #722#return; {74964#false} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {74964#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {74964#false} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {74964#false} assume 0 != eval2_~tmp~4#1; {74964#false} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {74964#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {74964#false} is VALID [2022-02-20 19:55:06,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {74964#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {74964#false} is VALID [2022-02-20 19:55:06,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {74964#false} assume !(0 == ~m_pc~0); {74964#false} is VALID [2022-02-20 19:55:06,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {74964#false} assume 1 == ~m_pc~0; {74964#false} is VALID [2022-02-20 19:55:06,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {74964#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error2 } true; {74964#false} is VALID [2022-02-20 19:55:06,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {74964#false} assume !false; {74964#false} is VALID [2022-02-20 19:55:06,636 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:55:06,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:06,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254402702] [2022-02-20 19:55:06,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254402702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:06,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:06,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:06,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445539702] [2022-02-20 19:55:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:55:06,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:06,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:06,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:06,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:06,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:06,680 INFO L87 Difference]: Start difference. First operand 2546 states and 3607 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:14,067 INFO L93 Difference]: Finished difference Result 8767 states and 12991 transitions. [2022-02-20 19:55:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:55:14,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:55:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1140 transitions. [2022-02-20 19:55:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1140 transitions. [2022-02-20 19:55:14,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1140 transitions. [2022-02-20 19:55:14,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1140 edges. 1140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:16,632 INFO L225 Difference]: With dead ends: 8767 [2022-02-20 19:55:16,632 INFO L226 Difference]: Without dead ends: 6929 [2022-02-20 19:55:16,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:55:16,638 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 1310 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:16,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1333 Valid, 1019 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:55:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2022-02-20 19:55:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 5984. [2022-02-20 19:55:18,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:18,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6929 states. Second operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:18,642 INFO L74 IsIncluded]: Start isIncluded. First operand 6929 states. Second operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:18,649 INFO L87 Difference]: Start difference. First operand 6929 states. Second operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:20,087 INFO L93 Difference]: Finished difference Result 6929 states and 10057 transitions. [2022-02-20 19:55:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10057 transitions. [2022-02-20 19:55:20,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:20,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:20,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) Second operand 6929 states. [2022-02-20 19:55:20,151 INFO L87 Difference]: Start difference. First operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) Second operand 6929 states. [2022-02-20 19:55:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:21,584 INFO L93 Difference]: Finished difference Result 6929 states and 10057 transitions. [2022-02-20 19:55:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10057 transitions. [2022-02-20 19:55:21,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:21,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:21,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:21,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5984 states, 5052 states have (on average 1.4178543151227236) internal successors, (7163), 5138 states have internal predecessors, (7163), 542 states have call successors, (542), 335 states have call predecessors, (542), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 8617 transitions. [2022-02-20 19:55:23,036 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 8617 transitions. Word has length 68 [2022-02-20 19:55:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:23,037 INFO L470 AbstractCegarLoop]: Abstraction has 5984 states and 8617 transitions. [2022-02-20 19:55:23,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 8617 transitions. [2022-02-20 19:55:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:55:23,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:23,038 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:23,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:55:23,039 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash -600910202, now seen corresponding path program 1 times [2022-02-20 19:55:23,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:23,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237428068] [2022-02-20 19:55:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {108279#true} havoc ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {108279#true} is VALID [2022-02-20 19:55:23,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} #res := ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,057 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {108279#true} {108279#true} #702#return; {108279#true} is VALID [2022-02-20 19:55:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {108314#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume !(1 == ~p_dw_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {108315#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:23,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {108315#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108316#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:23,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {108316#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108317#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:23,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {108317#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {108280#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {108280#false} assume !(1 == ~c_dr_pc~0); {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {108280#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {108280#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {108280#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {108280#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {108280#false} assume true; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {108280#false} {108279#true} #704#return; {108280#false} is VALID [2022-02-20 19:55:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:55:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {108314#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume 1 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {108279#true} is VALID [2022-02-20 19:55:23,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {108279#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {108279#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {108279#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {108279#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {108279#true} assume !(1 == ~c_dr_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {108279#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {108279#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {108279#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {108279#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,108 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {108279#true} {108280#false} #706#return; {108280#false} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {108279#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {108279#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {108279#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {108279#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {108279#true} assume { :end_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {108279#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L272 TraceCheckUtils]: 10: Hoare triple {108279#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {108279#true} havoc ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {108279#true} #res := ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {108279#true} {108279#true} #702#return; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {108279#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {108279#true} assume 0 != eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {108279#true} is VALID [2022-02-20 19:55:23,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {108279#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {108279#true} is VALID [2022-02-20 19:55:23,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {108279#true} assume 0 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {108279#true} assume !(0 == ~q_free~0); {108279#true} is VALID [2022-02-20 19:55:23,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {108279#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {108279#true} is VALID [2022-02-20 19:55:23,114 INFO L272 TraceCheckUtils]: 24: Hoare triple {108279#true} call immediate_notify_threads(); {108314#(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:55:23,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {108314#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {108279#true} assume !(1 == ~p_dw_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {108279#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {108315#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:23,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {108315#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108316#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:23,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {108316#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108317#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {108317#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {108280#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {108280#false} assume !(1 == ~c_dr_pc~0); {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {108280#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {108280#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {108280#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {108280#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {108280#false} assume true; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {108280#false} {108279#true} #704#return; {108280#false} is VALID [2022-02-20 19:55:23,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {108280#false} ~q_write_ev~0 := 2; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {108280#false} assume !false; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {108280#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {108280#false} assume { :end_inline_do_write_p } true; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {108280#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {108280#false} assume 0 != eval1_~tmp___0~1#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; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {108280#false} assume 0 == ~c_dr_pc~0; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {108280#false} assume !false; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {108280#false} assume !(1 == ~q_free~0); {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {108280#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_read_ev~0 := 1; {108280#false} is VALID [2022-02-20 19:55:23,117 INFO L272 TraceCheckUtils]: 49: Hoare triple {108280#false} call immediate_notify_threads(); {108314#(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:55:23,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {108314#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 51: Hoare triple {108279#true} assume 1 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 52: Hoare triple {108279#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {108279#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {108279#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {108279#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {108279#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {108279#true} assume !(1 == ~c_dr_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {108279#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {108279#true} is VALID [2022-02-20 19:55:23,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {108279#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {108279#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108279#true} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {108279#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 62: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,119 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {108279#true} {108280#false} #706#return; {108280#false} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {108280#false} ~q_read_ev~0 := 2; {108280#false} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {108280#false} assume !(~p_last_write~0 == ~c_last_read~0); {108280#false} is VALID [2022-02-20 19:55:23,119 INFO L272 TraceCheckUtils]: 66: Hoare triple {108280#false} call error1(); {108280#false} is VALID [2022-02-20 19:55:23,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {108280#false} assume !false; {108280#false} is VALID [2022-02-20 19:55:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:55:23,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:23,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237428068] [2022-02-20 19:55:23,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237428068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:23,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021594582] [2022-02-20 19:55:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:55:23,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:55:23,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:55:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:55:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:55:23,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {108279#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {108279#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {108279#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {108279#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {108279#true} assume { :end_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {108279#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L272 TraceCheckUtils]: 10: Hoare triple {108279#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {108279#true} havoc ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {108279#true} #res := ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {108279#true} {108279#true} #702#return; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {108279#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {108279#true} assume 0 != eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {108279#true} is VALID [2022-02-20 19:55:23,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {108279#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {108279#true} is VALID [2022-02-20 19:55:23,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {108279#true} assume 0 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {108279#true} assume !(0 == ~q_free~0); {108279#true} is VALID [2022-02-20 19:55:23,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {108279#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,421 INFO L272 TraceCheckUtils]: 24: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~p_dw_pc~0); {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_~__retres1~0#1 := 0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~c_dr_pc~0); {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume true; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,425 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {108390#(= ~p_last_write~0 ~q_buf_0~0)} {108390#(= ~p_last_write~0 ~q_buf_0~0)} #704#return; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} 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_read_ev~0 := 1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,429 INFO L272 TraceCheckUtils]: 49: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~p_dw_pc~0; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume !(1 == ~c_dr_pc~0); {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume true; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,432 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {108466#(= ~c_last_read~0 ~p_last_write~0)} {108466#(= ~c_last_read~0 ~p_last_write~0)} #706#return; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {108280#false} is VALID [2022-02-20 19:55:23,433 INFO L272 TraceCheckUtils]: 66: Hoare triple {108280#false} call error1(); {108280#false} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {108280#false} assume !false; {108280#false} is VALID [2022-02-20 19:55:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:23,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:55:23,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {108280#false} assume !false; {108280#false} is VALID [2022-02-20 19:55:23,567 INFO L272 TraceCheckUtils]: 66: Hoare triple {108280#false} call error1(); {108280#false} is VALID [2022-02-20 19:55:23,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {108280#false} is VALID [2022-02-20 19:55:23,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,568 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {108279#true} {108466#(= ~c_last_read~0 ~p_last_write~0)} #706#return; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {108279#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {108279#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {108279#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {108279#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {108279#true} assume !(1 == ~c_dr_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {108279#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {108279#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {108279#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {108279#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {108279#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {108279#true} assume 1 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {108279#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L272 TraceCheckUtils]: 49: Hoare triple {108466#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {108279#true} is VALID [2022-02-20 19:55:23,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} 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_read_ev~0 := 1; {108466#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:23,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,574 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {108279#true} {108390#(= ~p_last_write~0 ~q_buf_0~0)} #704#return; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {108279#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {108279#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {108279#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {108279#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {108279#true} assume !(1 == ~c_dr_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {108279#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {108279#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {108279#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {108279#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {108279#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {108279#true} assume !(1 == ~p_dw_pc~0); {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {108279#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,575 INFO L272 TraceCheckUtils]: 24: Hoare triple {108390#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {108279#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {108390#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {108279#true} assume !(0 == ~q_free~0); {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {108279#true} assume 0 == ~p_dw_pc~0; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {108279#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {108279#true} assume 0 != eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {108279#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {108279#true} {108279#true} #702#return; {108279#true} is VALID [2022-02-20 19:55:23,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {108279#true} assume true; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {108279#true} #res := ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {108279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {108279#true} havoc ~__retres1~2; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L272 TraceCheckUtils]: 10: Hoare triple {108279#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {108279#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {108279#true} assume !false; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {108279#true} assume { :end_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {108279#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {108279#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {108279#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {108279#true} is VALID [2022-02-20 19:55:23,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {108279#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {108279#true} is VALID [2022-02-20 19:55:23,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {108279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {108279#true} is VALID [2022-02-20 19:55:23,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {108279#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {108279#true} is VALID [2022-02-20 19:55:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:55:23,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021594582] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:23,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:55:23,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-02-20 19:55:23,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078561978] [2022-02-20 19:55:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:55:23,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:23,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:23,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:23,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:55:23,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:55:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:55:23,623 INFO L87 Difference]: Start difference. First operand 5984 states and 8617 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:27,962 INFO L93 Difference]: Finished difference Result 6040 states and 8685 transitions. [2022-02-20 19:55:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:55:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:55:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 19:55:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 19:55:27,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 343 transitions. [2022-02-20 19:55:28,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:29,581 INFO L225 Difference]: With dead ends: 6040 [2022-02-20 19:55:29,582 INFO L226 Difference]: Without dead ends: 6037 [2022-02-20 19:55:29,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:55:29,583 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 479 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:29,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 370 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:55:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2022-02-20 19:55:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 5983. [2022-02-20 19:55:32,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:32,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6037 states. Second operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:32,161 INFO L74 IsIncluded]: Start isIncluded. First operand 6037 states. Second operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:32,166 INFO L87 Difference]: Start difference. First operand 6037 states. Second operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:33,105 INFO L93 Difference]: Finished difference Result 6037 states and 8681 transitions. [2022-02-20 19:55:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 8681 transitions. [2022-02-20 19:55:33,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:33,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:33,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) Second operand 6037 states. [2022-02-20 19:55:33,123 INFO L87 Difference]: Start difference. First operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) Second operand 6037 states. [2022-02-20 19:55:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:34,091 INFO L93 Difference]: Finished difference Result 6037 states and 8681 transitions. [2022-02-20 19:55:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 8681 transitions. [2022-02-20 19:55:34,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:34,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:34,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:34,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5052 states have (on average 1.417458432304038) internal successors, (7161), 5137 states have internal predecessors, (7161), 541 states have call successors, (541), 335 states have call predecessors, (541), 388 states have return successors, (912), 526 states have call predecessors, (912), 540 states have call successors, (912) [2022-02-20 19:55:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 8614 transitions. [2022-02-20 19:55:35,499 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 8614 transitions. Word has length 68 [2022-02-20 19:55:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:35,499 INFO L470 AbstractCegarLoop]: Abstraction has 5983 states and 8614 transitions. [2022-02-20 19:55:35,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 8614 transitions. [2022-02-20 19:55:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:55:35,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:35,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:35,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:55:35,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 19:55:35,715 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1449006490, now seen corresponding path program 1 times [2022-02-20 19:55:35,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:35,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301714694] [2022-02-20 19:55:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {136726#true} havoc ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:35,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {136726#true} is VALID [2022-02-20 19:55:35,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} #res := ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:35,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:35,748 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {136726#true} {136726#true} #702#return; {136726#true} is VALID [2022-02-20 19:55:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {136761#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume !(1 == ~p_dw_pc~0); {136726#true} is VALID [2022-02-20 19:55:35,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {136762#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:35,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {136762#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136763#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:35,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {136763#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136764#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {136764#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {136727#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {136727#false} assume !(1 == ~c_dr_pc~0); {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {136727#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {136727#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {136727#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {136727#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {136727#false} assume true; {136727#false} is VALID [2022-02-20 19:55:35,781 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {136727#false} {136726#true} #704#return; {136727#false} is VALID [2022-02-20 19:55:35,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:55:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {136761#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume 1 == ~p_dw_pc~0; {136726#true} is VALID [2022-02-20 19:55:35,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {136726#true} is VALID [2022-02-20 19:55:35,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {136726#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {136726#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136726#true} is VALID [2022-02-20 19:55:35,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {136726#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {136726#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:35,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {136726#true} assume !(1 == ~c_dr_pc~0); {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {136726#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {136726#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {136726#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {136726#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {136726#true} {136727#false} #706#return; {136727#false} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {136726#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {136726#true} is VALID [2022-02-20 19:55:35,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {136726#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {136726#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {136726#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {136726#true} assume { :end_inline_init_threads1 } true; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {136726#true} assume !false; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {136726#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {136726#true} assume !false; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L272 TraceCheckUtils]: 10: Hoare triple {136726#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {136726#true} havoc ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:35,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {136726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {136726#true} #res := ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {136726#true} {136726#true} #702#return; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {136726#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {136726#true} assume 0 != eval1_~tmp___1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {136726#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {136726#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {136726#true} assume 0 == ~p_dw_pc~0; {136726#true} is VALID [2022-02-20 19:55:35,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {136726#true} assume !false; {136726#true} is VALID [2022-02-20 19:55:35,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {136726#true} assume !(0 == ~q_free~0); {136726#true} is VALID [2022-02-20 19:55:35,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {136726#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {136726#true} is VALID [2022-02-20 19:55:35,791 INFO L272 TraceCheckUtils]: 24: Hoare triple {136726#true} call immediate_notify_threads(); {136761#(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:55:35,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {136761#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {136726#true} assume !(1 == ~p_dw_pc~0); {136726#true} is VALID [2022-02-20 19:55:35,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {136726#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {136762#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:35,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {136762#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136763#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:35,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {136763#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136764#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {136764#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {136727#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {136727#false} assume !(1 == ~c_dr_pc~0); {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {136727#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {136727#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {136727#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {136727#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {136727#false} assume true; {136727#false} is VALID [2022-02-20 19:55:35,793 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {136727#false} {136726#true} #704#return; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {136727#false} ~q_write_ev~0 := 2; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {136727#false} assume !false; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {136727#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {136727#false} assume { :end_inline_do_write_p } true; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {136727#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {136727#false} assume 0 != eval1_~tmp___0~1#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; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {136727#false} assume 0 == ~c_dr_pc~0; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {136727#false} assume !false; {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {136727#false} assume !(1 == ~q_free~0); {136727#false} is VALID [2022-02-20 19:55:35,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {136727#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_read_ev~0 := 1; {136727#false} is VALID [2022-02-20 19:55:35,795 INFO L272 TraceCheckUtils]: 49: Hoare triple {136727#false} call immediate_notify_threads(); {136761#(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:55:35,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {136761#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {136726#true} assume 1 == ~p_dw_pc~0; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {136726#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {136726#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {136726#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {136726#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {136726#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {136726#true} assume !(1 == ~c_dr_pc~0); {136726#true} is VALID [2022-02-20 19:55:35,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {136726#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {136726#true} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {136726#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {136726#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136726#true} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {136726#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:35,796 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {136726#true} {136727#false} #706#return; {136727#false} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {136727#false} ~q_read_ev~0 := 2; {136727#false} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {136727#false} assume ~p_last_write~0 == ~c_last_read~0; {136727#false} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {136727#false} assume !(~p_num_write~0 == ~c_num_read~0); {136727#false} is VALID [2022-02-20 19:55:35,796 INFO L272 TraceCheckUtils]: 67: Hoare triple {136727#false} call error1(); {136727#false} is VALID [2022-02-20 19:55:35,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {136727#false} assume !false; {136727#false} is VALID [2022-02-20 19:55:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:55:35,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:35,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301714694] [2022-02-20 19:55:35,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301714694] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:35,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369071483] [2022-02-20 19:55:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:55:35,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:55:35,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:55:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:55:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:35,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:55:36,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {136726#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {136726#true} is VALID [2022-02-20 19:55:36,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,185 INFO L272 TraceCheckUtils]: 10: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret8#1 := exists_runnable_thread1(); {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #702#return; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:36,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {136774#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,189 INFO L272 TraceCheckUtils]: 24: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~p_dw_pc~0); {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_~__retres1~0#1 := 0; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume true; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,193 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #704#return; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} ~q_write_ev~0 := 2; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :end_inline_do_write_p } true; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != eval1_~tmp___0~1#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; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_pc~0; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~q_free~0); {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {136838#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} 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_read_ev~0 := 1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,197 INFO L272 TraceCheckUtils]: 49: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~p_dw_pc~0; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume true; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,201 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #706#return; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} ~q_read_ev~0 := 2; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume ~p_last_write~0 == ~c_last_read~0; {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:36,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {136914#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(~p_num_write~0 == ~c_num_read~0); {136727#false} is VALID [2022-02-20 19:55:36,202 INFO L272 TraceCheckUtils]: 67: Hoare triple {136727#false} call error1(); {136727#false} is VALID [2022-02-20 19:55:36,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {136727#false} assume !false; {136727#false} is VALID [2022-02-20 19:55:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:36,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:55:36,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {136727#false} assume !false; {136727#false} is VALID [2022-02-20 19:55:36,328 INFO L272 TraceCheckUtils]: 67: Hoare triple {136727#false} call error1(); {136727#false} is VALID [2022-02-20 19:55:36,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume !(~p_num_write~0 == ~c_num_read~0); {136727#false} is VALID [2022-02-20 19:55:36,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume ~p_last_write~0 == ~c_last_read~0; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} ~q_read_ev~0 := 2; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,330 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {136726#true} {136981#(= ~c_num_read~0 ~p_num_write~0)} #706#return; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {136726#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {136726#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {136726#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {136726#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {136726#true} assume !(1 == ~c_dr_pc~0); {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {136726#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:36,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {136726#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {136726#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {136726#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {136726#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {136726#true} assume 1 == ~p_dw_pc~0; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {136726#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:36,331 INFO L272 TraceCheckUtils]: 49: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} call immediate_notify_threads(); {136726#true} is VALID [2022-02-20 19:55:36,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} 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_read_ev~0 := 1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !(1 == ~q_free~0); {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_pc~0; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 != eval1_~tmp___0~1#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; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume { :end_inline_do_write_p } true; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} ~q_write_ev~0 := 2; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,335 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {136726#true} {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} #704#return; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {136726#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {136726#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {136726#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {136726#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {136726#true} assume !(1 == ~c_dr_pc~0); {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {136726#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {136726#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {136726#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {136726#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {136726#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {136726#true} assume !(1 == ~p_dw_pc~0); {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {136726#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L272 TraceCheckUtils]: 24: Hoare triple {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} call immediate_notify_threads(); {136726#true} is VALID [2022-02-20 19:55:36,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {137036#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:36,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume !(0 == ~q_free~0); {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_pc~0; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp___1~0#1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,339 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {136726#true} {136981#(= ~c_num_read~0 ~p_num_write~0)} #702#return; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {136726#true} assume true; {136726#true} is VALID [2022-02-20 19:55:36,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {136726#true} #res := ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:36,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {136726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {136726#true} is VALID [2022-02-20 19:55:36,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {136726#true} havoc ~__retres1~2; {136726#true} is VALID [2022-02-20 19:55:36,339 INFO L272 TraceCheckUtils]: 10: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {136726#true} is VALID [2022-02-20 19:55:36,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_threads1 } true; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {136981#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {136726#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#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; {136981#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:36,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {136726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {136726#true} is VALID [2022-02-20 19:55:36,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {136726#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;~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;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {136726#true} is VALID [2022-02-20 19:55:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:55:36,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369071483] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:55:36,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:55:36,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-02-20 19:55:36,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430107941] [2022-02-20 19:55:36,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:55:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:55:36,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:36,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:36,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:36,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 19:55:36,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 19:55:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:55:36,445 INFO L87 Difference]: Start difference. First operand 5983 states and 8614 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:43,474 INFO L93 Difference]: Finished difference Result 7683 states and 10834 transitions. [2022-02-20 19:55:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-20 19:55:43,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:55:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 816 transitions. [2022-02-20 19:55:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 816 transitions. [2022-02-20 19:55:43,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 816 transitions. [2022-02-20 19:55:44,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 816 edges. 816 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.