./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.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_2.cil-1+token_ring.01.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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:33,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:33,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:33,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:33,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:33,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:33,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:33,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:33,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:33,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:33,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:33,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:33,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:33,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:33,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:33,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:33,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:33,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:33,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:33,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:33,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:33,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:33,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:33,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:33,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:33,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:33,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:33,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:33,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:33,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:33,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:33,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:33,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:33,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:33,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:33,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:33,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:33,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:33,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:33,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:33,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:33,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:56:33,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:33,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:33,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:33,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:33,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:33,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:33,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:33,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:33,459 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:33,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:33,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:33,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:33,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:33,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:33,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:33,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:33,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:33,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:33,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:33,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:33,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:33,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:33,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:33,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:33,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:33,464 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:33,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:33,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:33,465 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-02-20 19:56:33,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:33,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:33,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:33,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:33,713 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:33,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-02-20 19:56:33,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dae2a4b0/57bf50814da14914918b420c2d76ddbd/FLAG66c838757 [2022-02-20 19:56:34,144 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:34,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-02-20 19:56:34,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dae2a4b0/57bf50814da14914918b420c2d76ddbd/FLAG66c838757 [2022-02-20 19:56:34,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dae2a4b0/57bf50814da14914918b420c2d76ddbd [2022-02-20 19:56:34,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:34,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:34,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:34,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:34,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:34,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:34,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf2b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34, skipping insertion in model container [2022-02-20 19:56:34,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:34,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:34,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:34,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-02-20 19:56:34,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-02-20 19:56:34,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:34,857 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:34,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-02-20 19:56:34,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-02-20 19:56:34,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:34,967 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:34,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34 WrapperNode [2022-02-20 19:56:34,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:34,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:34,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:34,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:34,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:34,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,027 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-02-20 19:56:35,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:35,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:35,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:35,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:35,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:35,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:35,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:35,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:35,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (1/1) ... [2022-02-20 19:56:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:35,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:35,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:56:35,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:56:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:35,156 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:35,222 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:35,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:35,728 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:35,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:35,740 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:56:35,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:35 BoogieIcfgContainer [2022-02-20 19:56:35,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:35,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:35,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:35,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:35,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:34" (1/3) ... [2022-02-20 19:56:35,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcad84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:35, skipping insertion in model container [2022-02-20 19:56:35,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:34" (2/3) ... [2022-02-20 19:56:35,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcad84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:35, skipping insertion in model container [2022-02-20 19:56:35,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:35" (3/3) ... [2022-02-20 19:56:35,758 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-02-20 19:56:35,762 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:35,763 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:35,820 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:35,828 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:56:35,828 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 19:56:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:56:35,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:35,886 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] [2022-02-20 19:56:35,887 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-02-20 19:56:35,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:35,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530596908] [2022-02-20 19:56:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,133 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {211#true} {213#(= ~M_E~0 2)} #676#return; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#(= |old(~M_E~0)| 0)} assume true; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,170 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {248#(= |old(~M_E~0)| 0)} {213#(= ~M_E~0 2)} #678#return; {212#false} is VALID [2022-02-20 19:56:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {211#true} is VALID [2022-02-20 19:56:36,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume !(1 == ~m_pc~0); {211#true} is VALID [2022-02-20 19:56:36,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} is_master_triggered_~__retres1~4#1 := 0; {211#true} is VALID [2022-02-20 19:56:36,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {211#true} is VALID [2022-02-20 19:56:36,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {211#true} is VALID [2022-02-20 19:56:36,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {211#true} is VALID [2022-02-20 19:56:36,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#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; {211#true} is VALID [2022-02-20 19:56:36,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#true} assume 1 == ~t1_pc~0; {211#true} is VALID [2022-02-20 19:56:36,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {211#true} is VALID [2022-02-20 19:56:36,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {211#true} is VALID [2022-02-20 19:56:36,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {211#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {211#true} is VALID [2022-02-20 19:56:36,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {211#true} is VALID [2022-02-20 19:56:36,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,195 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {211#true} {212#false} #680#return; {212#false} is VALID [2022-02-20 19:56:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {211#true} is VALID [2022-02-20 19:56:36,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} assume 1 == ~E_M~0;~E_M~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#true} assume 1 == ~E_1~0;~E_1~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,204 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {211#true} {212#false} #682#return; {212#false} is VALID [2022-02-20 19:56:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:36,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} havoc ~__retres1~6; {211#true} is VALID [2022-02-20 19:56:36,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {211#true} is VALID [2022-02-20 19:56:36,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} #res := ~__retres1~6; {211#true} is VALID [2022-02-20 19:56:36,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,227 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {211#true} {212#false} #684#return; {212#false} is VALID [2022-02-20 19:56:36,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(= ~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; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(= ~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~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {213#(= ~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~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#(= ~M_E~0 2)} call update_channels2(); {211#true} is VALID [2022-02-20 19:56:36,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,231 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {211#true} {213#(= ~M_E~0 2)} #676#return; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {213#(= ~M_E~0 2)} is VALID [2022-02-20 19:56:36,235 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#(= ~M_E~0 2)} call fire_delta_events2(); {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:36,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {248#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {248#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#(= |old(~M_E~0)| 0)} assume true; {248#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:56:36,238 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {248#(= |old(~M_E~0)| 0)} {213#(= ~M_E~0 2)} #678#return; {212#false} is VALID [2022-02-20 19:56:36,238 INFO L272 TraceCheckUtils]: 18: Hoare triple {212#false} call activate_threads2(); {249#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:36,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {249#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {211#true} is VALID [2022-02-20 19:56:36,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#true} assume !(1 == ~m_pc~0); {211#true} is VALID [2022-02-20 19:56:36,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {211#true} is_master_triggered_~__retres1~4#1 := 0; {211#true} is VALID [2022-02-20 19:56:36,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {211#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {211#true} is VALID [2022-02-20 19:56:36,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {211#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {211#true} is VALID [2022-02-20 19:56:36,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {211#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {211#true} is VALID [2022-02-20 19:56:36,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {211#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; {211#true} is VALID [2022-02-20 19:56:36,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {211#true} assume 1 == ~t1_pc~0; {211#true} is VALID [2022-02-20 19:56:36,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {211#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {211#true} is VALID [2022-02-20 19:56:36,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {211#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {211#true} is VALID [2022-02-20 19:56:36,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {211#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {211#true} is VALID [2022-02-20 19:56:36,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {211#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {211#true} is VALID [2022-02-20 19:56:36,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,241 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {211#true} {212#false} #680#return; {212#false} is VALID [2022-02-20 19:56:36,242 INFO L272 TraceCheckUtils]: 33: Hoare triple {212#false} call reset_delta_events2(); {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:36,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {247#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {211#true} is VALID [2022-02-20 19:56:36,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {211#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {211#true} assume 1 == ~E_M~0;~E_M~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {211#true} assume 1 == ~E_1~0;~E_1~0 := 2; {211#true} is VALID [2022-02-20 19:56:36,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,243 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {211#true} {212#false} #682#return; {212#false} is VALID [2022-02-20 19:56:36,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 19:56:36,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {212#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {212#false} is VALID [2022-02-20 19:56:36,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 19:56:36,244 INFO L272 TraceCheckUtils]: 43: Hoare triple {212#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {211#true} is VALID [2022-02-20 19:56:36,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {211#true} havoc ~__retres1~6; {211#true} is VALID [2022-02-20 19:56:36,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {211#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {211#true} is VALID [2022-02-20 19:56:36,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {211#true} #res := ~__retres1~6; {211#true} is VALID [2022-02-20 19:56:36,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {211#true} assume true; {211#true} is VALID [2022-02-20 19:56:36,245 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {211#true} {212#false} #684#return; {212#false} is VALID [2022-02-20 19:56:36,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {212#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {212#false} is VALID [2022-02-20 19:56:36,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {212#false} assume 0 != eval2_~tmp~5#1; {212#false} is VALID [2022-02-20 19:56:36,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {212#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {212#false} is VALID [2022-02-20 19:56:36,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {212#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {212#false} is VALID [2022-02-20 19:56:36,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {212#false} assume !(0 == ~m_pc~0); {212#false} is VALID [2022-02-20 19:56:36,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {212#false} assume 1 == ~m_pc~0; {212#false} is VALID [2022-02-20 19:56:36,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {212#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {212#false} is VALID [2022-02-20 19:56:36,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 19:56:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:36,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:36,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530596908] [2022-02-20 19:56:36,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530596908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:36,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:36,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:56:36,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529138392] [2022-02-20 19:56:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:36,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:36,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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:56:36,310 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:56:36,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:56:36,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:56:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:56:36,332 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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:56:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:38,279 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-02-20 19:56:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:56:38,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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:56:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 790 transitions. [2022-02-20 19:56:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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:56:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 790 transitions. [2022-02-20 19:56:38,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 790 transitions. [2022-02-20 19:56:38,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:38,976 INFO L225 Difference]: With dead ends: 530 [2022-02-20 19:56:38,976 INFO L226 Difference]: Without dead ends: 329 [2022-02-20 19:56:38,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:56:38,983 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 516 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:38,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 746 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-02-20 19:56:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-02-20 19:56:39,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:39,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:39,035 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:39,036 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:39,055 INFO L93 Difference]: Finished difference Result 329 states and 466 transitions. [2022-02-20 19:56:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 466 transitions. [2022-02-20 19:56:39,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:39,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:39,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) Second operand 329 states. [2022-02-20 19:56:39,061 INFO L87 Difference]: Start difference. First operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) Second operand 329 states. [2022-02-20 19:56:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:39,078 INFO L93 Difference]: Finished difference Result 329 states and 466 transitions. [2022-02-20 19:56:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 466 transitions. [2022-02-20 19:56:39,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:39,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:39,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:39,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-02-20 19:56:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-02-20 19:56:39,097 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-02-20 19:56:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:39,097 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-02-20 19:56:39,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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:56:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-02-20 19:56:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:56:39,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:39,099 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] [2022-02-20 19:56:39,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:39,100 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-02-20 19:56:39,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:39,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977988415] [2022-02-20 19:56:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,145 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2048#true} {2050#(= ~T1_E~0 ~M_E~0)} #676#return; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2085#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:39,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {2085#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,180 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2050#(= ~T1_E~0 ~M_E~0)} #678#return; {2049#false} is VALID [2022-02-20 19:56:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2087#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {2048#true} is VALID [2022-02-20 19:56:39,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume !(1 == ~m_pc~0); {2048#true} is VALID [2022-02-20 19:56:39,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} is_master_triggered_~__retres1~4#1 := 0; {2048#true} is VALID [2022-02-20 19:56:39,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {2048#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2048#true} is VALID [2022-02-20 19:56:39,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {2048#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {2048#true} is VALID [2022-02-20 19:56:39,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2048#true} is VALID [2022-02-20 19:56:39,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {2048#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; {2048#true} is VALID [2022-02-20 19:56:39,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} assume 1 == ~t1_pc~0; {2048#true} is VALID [2022-02-20 19:56:39,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2048#true} is VALID [2022-02-20 19:56:39,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2048#true} is VALID [2022-02-20 19:56:39,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {2048#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {2048#true} is VALID [2022-02-20 19:56:39,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {2048#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {2048#true} is VALID [2022-02-20 19:56:39,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,201 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2048#true} {2049#false} #680#return; {2049#false} is VALID [2022-02-20 19:56:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2048#true} is VALID [2022-02-20 19:56:39,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {2048#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,208 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2048#true} {2049#false} #682#return; {2049#false} is VALID [2022-02-20 19:56:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:39,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#true} havoc ~__retres1~6; {2048#true} is VALID [2022-02-20 19:56:39,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2048#true} is VALID [2022-02-20 19:56:39,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} #res := ~__retres1~6; {2048#true} is VALID [2022-02-20 19:56:39,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,213 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2048#true} {2049#false} #684#return; {2049#false} is VALID [2022-02-20 19:56:39,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {2050#(= ~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; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {2050#(= ~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~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {2050#(= ~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~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {2048#true} is VALID [2022-02-20 19:56:39,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,216 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2048#true} {2050#(= ~T1_E~0 ~M_E~0)} #676#return; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {2050#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:56:39,219 INFO L272 TraceCheckUtils]: 11: Hoare triple {2050#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:39,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2085#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:56:39,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2085#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:56:39,222 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2086#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2050#(= ~T1_E~0 ~M_E~0)} #678#return; {2049#false} is VALID [2022-02-20 19:56:39,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {2049#false} call activate_threads2(); {2087#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:39,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {2087#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {2048#true} is VALID [2022-02-20 19:56:39,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(1 == ~m_pc~0); {2048#true} is VALID [2022-02-20 19:56:39,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} is_master_triggered_~__retres1~4#1 := 0; {2048#true} is VALID [2022-02-20 19:56:39,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {2048#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2048#true} is VALID [2022-02-20 19:56:39,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {2048#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {2048#true} is VALID [2022-02-20 19:56:39,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {2048#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2048#true} is VALID [2022-02-20 19:56:39,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {2048#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; {2048#true} is VALID [2022-02-20 19:56:39,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} assume 1 == ~t1_pc~0; {2048#true} is VALID [2022-02-20 19:56:39,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2048#true} is VALID [2022-02-20 19:56:39,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2048#true} is VALID [2022-02-20 19:56:39,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {2048#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {2048#true} is VALID [2022-02-20 19:56:39,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {2048#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {2048#true} is VALID [2022-02-20 19:56:39,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,242 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2048#true} {2049#false} #680#return; {2049#false} is VALID [2022-02-20 19:56:39,242 INFO L272 TraceCheckUtils]: 33: Hoare triple {2049#false} call reset_delta_events2(); {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:39,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {2084#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2048#true} is VALID [2022-02-20 19:56:39,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {2048#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {2048#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2048#true} is VALID [2022-02-20 19:56:39,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,244 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2048#true} {2049#false} #682#return; {2049#false} is VALID [2022-02-20 19:56:39,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 19:56:39,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {2049#false} is VALID [2022-02-20 19:56:39,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 19:56:39,247 INFO L272 TraceCheckUtils]: 43: Hoare triple {2049#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {2048#true} is VALID [2022-02-20 19:56:39,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {2048#true} havoc ~__retres1~6; {2048#true} is VALID [2022-02-20 19:56:39,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {2048#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2048#true} is VALID [2022-02-20 19:56:39,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {2048#true} #res := ~__retres1~6; {2048#true} is VALID [2022-02-20 19:56:39,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-02-20 19:56:39,248 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2048#true} {2049#false} #684#return; {2049#false} is VALID [2022-02-20 19:56:39,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {2049#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {2049#false} is VALID [2022-02-20 19:56:39,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {2049#false} assume 0 != eval2_~tmp~5#1; {2049#false} is VALID [2022-02-20 19:56:39,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {2049#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {2049#false} is VALID [2022-02-20 19:56:39,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {2049#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {2049#false} is VALID [2022-02-20 19:56:39,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {2049#false} assume !(0 == ~m_pc~0); {2049#false} is VALID [2022-02-20 19:56:39,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {2049#false} assume 1 == ~m_pc~0; {2049#false} is VALID [2022-02-20 19:56:39,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {2049#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {2049#false} is VALID [2022-02-20 19:56:39,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 19:56:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:39,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:39,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977988415] [2022-02-20 19:56:39,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977988415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:39,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:39,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:39,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075322817] [2022-02-20 19:56:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:39,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:39,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:39,310 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:56:39,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:39,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:39,312 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:41,610 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-02-20 19:56:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 599 transitions. [2022-02-20 19:56:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 599 transitions. [2022-02-20 19:56:41,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 599 transitions. [2022-02-20 19:56:42,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:42,098 INFO L225 Difference]: With dead ends: 620 [2022-02-20 19:56:42,098 INFO L226 Difference]: Without dead ends: 437 [2022-02-20 19:56:42,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:56:42,100 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 493 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:42,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 1025 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:56:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-02-20 19:56:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-02-20 19:56:42,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:42,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:42,126 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:42,129 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,148 INFO L93 Difference]: Finished difference Result 437 states and 616 transitions. [2022-02-20 19:56:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 616 transitions. [2022-02-20 19:56:42,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:42,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:42,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 437 states. [2022-02-20 19:56:42,155 INFO L87 Difference]: Start difference. First operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 437 states. [2022-02-20 19:56:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:42,187 INFO L93 Difference]: Finished difference Result 437 states and 616 transitions. [2022-02-20 19:56:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 616 transitions. [2022-02-20 19:56:42,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:42,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:42,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:42,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-02-20 19:56:42,216 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-02-20 19:56:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:42,217 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-02-20 19:56:42,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-02-20 19:56:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:56:42,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:42,219 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] [2022-02-20 19:56:42,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:42,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-02-20 19:56:42,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:42,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492616071] [2022-02-20 19:56:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,305 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4338#true} {4340#(not (= ~E_M~0 0))} #676#return; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4375#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:56:42,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {4375#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {4375#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:56:42,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {4375#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {4376#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {4376#(= |old(~E_M~0)| 0)} assume true; {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,329 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4376#(= |old(~E_M~0)| 0)} {4340#(not (= ~E_M~0 0))} #678#return; {4339#false} is VALID [2022-02-20 19:56:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {4377#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {4338#true} is VALID [2022-02-20 19:56:42,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {4338#true} assume !(1 == ~m_pc~0); {4338#true} is VALID [2022-02-20 19:56:42,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {4338#true} is_master_triggered_~__retres1~4#1 := 0; {4338#true} is VALID [2022-02-20 19:56:42,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {4338#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4338#true} is VALID [2022-02-20 19:56:42,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {4338#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {4338#true} is VALID [2022-02-20 19:56:42,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {4338#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4338#true} is VALID [2022-02-20 19:56:42,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {4338#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; {4338#true} is VALID [2022-02-20 19:56:42,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {4338#true} assume 1 == ~t1_pc~0; {4338#true} is VALID [2022-02-20 19:56:42,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {4338#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4338#true} is VALID [2022-02-20 19:56:42,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {4338#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4338#true} is VALID [2022-02-20 19:56:42,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {4338#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {4338#true} is VALID [2022-02-20 19:56:42,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {4338#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {4338#true} is VALID [2022-02-20 19:56:42,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,347 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4338#true} {4339#false} #680#return; {4339#false} is VALID [2022-02-20 19:56:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4338#true} is VALID [2022-02-20 19:56:42,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {4338#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {4338#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {4338#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,353 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4338#true} {4339#false} #682#return; {4339#false} is VALID [2022-02-20 19:56:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:42,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {4338#true} havoc ~__retres1~6; {4338#true} is VALID [2022-02-20 19:56:42,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4338#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4338#true} is VALID [2022-02-20 19:56:42,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {4338#true} #res := ~__retres1~6; {4338#true} is VALID [2022-02-20 19:56:42,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,358 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4338#true} {4339#false} #684#return; {4339#false} is VALID [2022-02-20 19:56:42,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {4338#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {4340#(not (= ~E_M~0 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; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {4340#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {4340#(not (= ~E_M~0 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~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {4340#(not (= ~E_M~0 0))} call update_channels2(); {4338#true} is VALID [2022-02-20 19:56:42,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,361 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4338#true} {4340#(not (= ~E_M~0 0))} #676#return; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4340#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {4340#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {4340#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {4340#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:56:42,367 INFO L272 TraceCheckUtils]: 11: Hoare triple {4340#(not (= ~E_M~0 0))} call fire_delta_events2(); {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:42,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4375#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:56:42,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {4375#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {4375#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:56:42,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {4375#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(= |old(~E_M~0)| 0)} assume true; {4376#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:56:42,370 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4376#(= |old(~E_M~0)| 0)} {4340#(not (= ~E_M~0 0))} #678#return; {4339#false} is VALID [2022-02-20 19:56:42,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {4339#false} call activate_threads2(); {4377#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:42,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {4338#true} is VALID [2022-02-20 19:56:42,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {4338#true} assume !(1 == ~m_pc~0); {4338#true} is VALID [2022-02-20 19:56:42,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {4338#true} is_master_triggered_~__retres1~4#1 := 0; {4338#true} is VALID [2022-02-20 19:56:42,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {4338#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4338#true} is VALID [2022-02-20 19:56:42,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {4338#true} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {4338#true} is VALID [2022-02-20 19:56:42,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {4338#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {4338#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; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {4338#true} assume 1 == ~t1_pc~0; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {4338#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {4338#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {4338#true} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {4338#true} is VALID [2022-02-20 19:56:42,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {4338#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {4338#true} is VALID [2022-02-20 19:56:42,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,373 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4338#true} {4339#false} #680#return; {4339#false} is VALID [2022-02-20 19:56:42,373 INFO L272 TraceCheckUtils]: 33: Hoare triple {4339#false} call reset_delta_events2(); {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:42,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {4374#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4338#true} is VALID [2022-02-20 19:56:42,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {4338#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {4338#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {4338#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4338#true} is VALID [2022-02-20 19:56:42,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,375 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4338#true} {4339#false} #682#return; {4339#false} is VALID [2022-02-20 19:56:42,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {4339#false} assume !false; {4339#false} is VALID [2022-02-20 19:56:42,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {4339#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {4339#false} is VALID [2022-02-20 19:56:42,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {4339#false} assume !false; {4339#false} is VALID [2022-02-20 19:56:42,380 INFO L272 TraceCheckUtils]: 43: Hoare triple {4339#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {4338#true} is VALID [2022-02-20 19:56:42,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {4338#true} havoc ~__retres1~6; {4338#true} is VALID [2022-02-20 19:56:42,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {4338#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4338#true} is VALID [2022-02-20 19:56:42,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {4338#true} #res := ~__retres1~6; {4338#true} is VALID [2022-02-20 19:56:42,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {4338#true} assume true; {4338#true} is VALID [2022-02-20 19:56:42,381 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4338#true} {4339#false} #684#return; {4339#false} is VALID [2022-02-20 19:56:42,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {4339#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {4339#false} is VALID [2022-02-20 19:56:42,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {4339#false} assume 0 != eval2_~tmp~5#1; {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {4339#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {4339#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {4339#false} assume !(0 == ~m_pc~0); {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {4339#false} assume 1 == ~m_pc~0; {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {4339#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {4339#false} is VALID [2022-02-20 19:56:42,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {4339#false} assume !false; {4339#false} is VALID [2022-02-20 19:56:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:42,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:42,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492616071] [2022-02-20 19:56:42,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492616071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:42,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:42,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:42,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325746064] [2022-02-20 19:56:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:42,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:42,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:42,429 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:56:42,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:42,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:42,431 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:43,718 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-02-20 19:56:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:56:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2022-02-20 19:56:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2022-02-20 19:56:43,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 450 transitions. [2022-02-20 19:56:44,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:44,140 INFO L225 Difference]: With dead ends: 703 [2022-02-20 19:56:44,141 INFO L226 Difference]: Without dead ends: 435 [2022-02-20 19:56:44,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:56:44,143 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 522 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:44,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 581 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:56:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-02-20 19:56:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-02-20 19:56:44,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:44,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:44,174 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:44,175 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:44,190 INFO L93 Difference]: Finished difference Result 435 states and 612 transitions. [2022-02-20 19:56:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 612 transitions. [2022-02-20 19:56:44,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:44,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:44,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 435 states. [2022-02-20 19:56:44,194 INFO L87 Difference]: Start difference. First operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 435 states. [2022-02-20 19:56:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:44,210 INFO L93 Difference]: Finished difference Result 435 states and 612 transitions. [2022-02-20 19:56:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 612 transitions. [2022-02-20 19:56:44,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:44,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:44,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:44,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-02-20 19:56:44,226 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-02-20 19:56:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:44,227 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-02-20 19:56:44,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-02-20 19:56:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:56:44,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:44,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] [2022-02-20 19:56:44,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:44,229 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-02-20 19:56:44,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:44,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97019203] [2022-02-20 19:56:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,285 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6727#true} {6727#true} #676#return; {6727#true} is VALID [2022-02-20 19:56:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {6727#true} is VALID [2022-02-20 19:56:44,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#true} assume !(0 == ~T1_E~0); {6727#true} is VALID [2022-02-20 19:56:44,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {6727#true} assume !(0 == ~E_M~0); {6727#true} is VALID [2022-02-20 19:56:44,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {6727#true} assume !(0 == ~E_1~0); {6727#true} is VALID [2022-02-20 19:56:44,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,301 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6727#true} {6727#true} #678#return; {6727#true} is VALID [2022-02-20 19:56:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {6763#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {6727#true} is VALID [2022-02-20 19:56:44,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#true} assume !(1 == ~m_pc~0); {6727#true} is VALID [2022-02-20 19:56:44,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {6727#true} is_master_triggered_~__retres1~4#1 := 0; {6764#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:56:44,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {6764#(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; {6765#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:56:44,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {6765#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {6766#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:56:44,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {6766#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {6728#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; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {6728#false} assume 1 == ~t1_pc~0; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {6728#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {6728#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {6728#false} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {6728#false} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {6728#false} assume true; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6728#false} {6727#true} #680#return; {6728#false} is VALID [2022-02-20 19:56:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {6727#true} is VALID [2022-02-20 19:56:44,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {6727#true} assume 1 == ~E_M~0;~E_M~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {6727#true} assume 1 == ~E_1~0;~E_1~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,384 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6727#true} {6728#false} #682#return; {6728#false} is VALID [2022-02-20 19:56:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:44,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {6727#true} havoc ~__retres1~6; {6727#true} is VALID [2022-02-20 19:56:44,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {6727#true} is VALID [2022-02-20 19:56:44,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {6727#true} #res := ~__retres1~6; {6727#true} is VALID [2022-02-20 19:56:44,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,389 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6727#true} {6728#false} #684#return; {6728#false} is VALID [2022-02-20 19:56:44,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {6727#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#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; {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {6727#true} assume !(0 != main_#t~nondet28#1);havoc main_#t~nondet28#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {6727#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~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {6727#true} call update_channels2(); {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,394 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6727#true} {6727#true} #676#return; {6727#true} is VALID [2022-02-20 19:56:44,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {6727#true} assume { :begin_inline_init_threads2 } true; {6727#true} is VALID [2022-02-20 19:56:44,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {6727#true} assume 1 == ~m_i~0;~m_st~0 := 0; {6727#true} is VALID [2022-02-20 19:56:44,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {6727#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {6727#true} is VALID [2022-02-20 19:56:44,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {6727#true} assume { :end_inline_init_threads2 } true; {6727#true} is VALID [2022-02-20 19:56:44,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {6727#true} call fire_delta_events2(); {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:44,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {6727#true} is VALID [2022-02-20 19:56:44,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {6727#true} assume !(0 == ~T1_E~0); {6727#true} is VALID [2022-02-20 19:56:44,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {6727#true} assume !(0 == ~E_M~0); {6727#true} is VALID [2022-02-20 19:56:44,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {6727#true} assume !(0 == ~E_1~0); {6727#true} is VALID [2022-02-20 19:56:44,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,397 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6727#true} {6727#true} #678#return; {6727#true} is VALID [2022-02-20 19:56:44,397 INFO L272 TraceCheckUtils]: 18: Hoare triple {6727#true} call activate_threads2(); {6763#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:44,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {6763#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {6727#true} is VALID [2022-02-20 19:56:44,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {6727#true} assume !(1 == ~m_pc~0); {6727#true} is VALID [2022-02-20 19:56:44,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {6727#true} is_master_triggered_~__retres1~4#1 := 0; {6764#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:56:44,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {6764#(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; {6765#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:56:44,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {6766#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:56:44,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {6766#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {6728#false} is VALID [2022-02-20 19:56:44,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {6728#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; {6728#false} is VALID [2022-02-20 19:56:44,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {6728#false} assume 1 == ~t1_pc~0; {6728#false} is VALID [2022-02-20 19:56:44,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {6728#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {6728#false} is VALID [2022-02-20 19:56:44,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {6728#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {6728#false} is VALID [2022-02-20 19:56:44,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {6728#false} #t~ret24#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {6728#false} is VALID [2022-02-20 19:56:44,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {6728#false} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {6728#false} is VALID [2022-02-20 19:56:44,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {6728#false} assume true; {6728#false} is VALID [2022-02-20 19:56:44,404 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6728#false} {6727#true} #680#return; {6728#false} is VALID [2022-02-20 19:56:44,404 INFO L272 TraceCheckUtils]: 33: Hoare triple {6728#false} call reset_delta_events2(); {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {6762#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {6727#true} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {6727#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {6727#true} assume 1 == ~E_M~0;~E_M~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {6727#true} assume 1 == ~E_1~0;~E_1~0 := 2; {6727#true} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,405 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6727#true} {6728#false} #682#return; {6728#false} is VALID [2022-02-20 19:56:44,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {6728#false} assume !false; {6728#false} is VALID [2022-02-20 19:56:44,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {6728#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {6728#false} is VALID [2022-02-20 19:56:44,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {6728#false} assume !false; {6728#false} is VALID [2022-02-20 19:56:44,406 INFO L272 TraceCheckUtils]: 43: Hoare triple {6728#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {6727#true} is VALID [2022-02-20 19:56:44,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {6727#true} havoc ~__retres1~6; {6727#true} is VALID [2022-02-20 19:56:44,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {6727#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {6727#true} is VALID [2022-02-20 19:56:44,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {6727#true} #res := ~__retres1~6; {6727#true} is VALID [2022-02-20 19:56:44,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {6727#true} assume true; {6727#true} is VALID [2022-02-20 19:56:44,407 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6727#true} {6728#false} #684#return; {6728#false} is VALID [2022-02-20 19:56:44,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {6728#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {6728#false} is VALID [2022-02-20 19:56:44,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {6728#false} assume 0 != eval2_~tmp~5#1; {6728#false} is VALID [2022-02-20 19:56:44,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {6728#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {6728#false} is VALID [2022-02-20 19:56:44,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {6728#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {6728#false} is VALID [2022-02-20 19:56:44,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {6728#false} assume !(0 == ~m_pc~0); {6728#false} is VALID [2022-02-20 19:56:44,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {6728#false} assume 1 == ~m_pc~0; {6728#false} is VALID [2022-02-20 19:56:44,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {6728#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {6728#false} is VALID [2022-02-20 19:56:44,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {6728#false} assume !false; {6728#false} is VALID [2022-02-20 19:56:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:44,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:44,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97019203] [2022-02-20 19:56:44,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97019203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:44,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:44,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:44,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59367534] [2022-02-20 19:56:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:44,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:44,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:44,450 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:56:44,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:44,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:44,452 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,246 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-02-20 19:56:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 473 transitions. [2022-02-20 19:56:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 473 transitions. [2022-02-20 19:56:46,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 473 transitions. [2022-02-20 19:56:46,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:46,654 INFO L225 Difference]: With dead ends: 739 [2022-02-20 19:56:46,654 INFO L226 Difference]: Without dead ends: 472 [2022-02-20 19:56:46,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:56:46,663 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 267 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:46,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 916 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-20 19:56:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-02-20 19:56:46,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:46,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:46,713 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:46,714 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,731 INFO L93 Difference]: Finished difference Result 472 states and 666 transitions. [2022-02-20 19:56:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 666 transitions. [2022-02-20 19:56:46,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 472 states. [2022-02-20 19:56:46,735 INFO L87 Difference]: Start difference. First operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 472 states. [2022-02-20 19:56:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:46,752 INFO L93 Difference]: Finished difference Result 472 states and 666 transitions. [2022-02-20 19:56:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 666 transitions. [2022-02-20 19:56:46,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:46,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:46,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:46,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:56:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-02-20 19:56:46,768 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-02-20 19:56:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:46,769 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-02-20 19:56:46,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-02-20 19:56:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:56:46,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:46,772 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] [2022-02-20 19:56:46,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:56:46,772 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-02-20 19:56:46,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:46,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122559070] [2022-02-20 19:56:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,835 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {9255#true} {9257#(= ~m_pc~0 ~t1_pc~0)} #676#return; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:56:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {9255#true} is VALID [2022-02-20 19:56:46,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {9255#true} assume !(0 == ~T1_E~0); {9255#true} is VALID [2022-02-20 19:56:46,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {9255#true} assume !(0 == ~E_M~0); {9255#true} is VALID [2022-02-20 19:56:46,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {9255#true} assume !(0 == ~E_1~0); {9255#true} is VALID [2022-02-20 19:56:46,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,856 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9255#true} {9257#(= ~m_pc~0 ~t1_pc~0)} #678#return; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:56:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {9292#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {9255#true} is VALID [2022-02-20 19:56:46,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {9255#true} assume !(1 == ~m_pc~0); {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {9293#(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; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {9294#(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_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,952 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9294#(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)))} {9257#(= ~m_pc~0 ~t1_pc~0)} #680#return; {9256#false} is VALID [2022-02-20 19:56:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:56:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {9255#true} is VALID [2022-02-20 19:56:46,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {9255#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {9255#true} assume 1 == ~E_M~0;~E_M~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {9255#true} assume 1 == ~E_1~0;~E_1~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,961 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9255#true} {9256#false} #682#return; {9256#false} is VALID [2022-02-20 19:56:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:56:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:46,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {9255#true} havoc ~__retres1~6; {9255#true} is VALID [2022-02-20 19:56:46,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {9255#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {9255#true} is VALID [2022-02-20 19:56:46,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {9255#true} #res := ~__retres1~6; {9255#true} is VALID [2022-02-20 19:56:46,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,965 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9255#true} {9256#false} #684#return; {9256#false} is VALID [2022-02-20 19:56:46,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {9255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {9257#(= ~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; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {9257#(= ~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~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {9257#(= ~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~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {9255#true} is VALID [2022-02-20 19:56:46,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,968 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9255#true} {9257#(= ~m_pc~0 ~t1_pc~0)} #676#return; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:46,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {9255#true} is VALID [2022-02-20 19:56:46,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {9255#true} assume !(0 == ~T1_E~0); {9255#true} is VALID [2022-02-20 19:56:46,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {9255#true} assume !(0 == ~E_M~0); {9255#true} is VALID [2022-02-20 19:56:46,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {9255#true} assume !(0 == ~E_1~0); {9255#true} is VALID [2022-02-20 19:56:46,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,971 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9255#true} {9257#(= ~m_pc~0 ~t1_pc~0)} #678#return; {9257#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:56:46,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {9257#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {9292#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:56:46,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {9292#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {9255#true} is VALID [2022-02-20 19:56:46,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {9255#true} assume !(1 == ~m_pc~0); {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret23#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret23#1 && #t~ret23#1 <= 2147483647;~tmp~6#1 := #t~ret23#1;havoc #t~ret23#1; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {9293#(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; {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:56:46,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {9293#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {9294#(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_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp___0~3#1 := #t~ret24#1;havoc #t~ret24#1; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {9294#(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; {9294#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:56:46,978 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9294#(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)))} {9257#(= ~m_pc~0 ~t1_pc~0)} #680#return; {9256#false} is VALID [2022-02-20 19:56:46,978 INFO L272 TraceCheckUtils]: 33: Hoare triple {9256#false} call reset_delta_events2(); {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:56:46,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {9291#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {9255#true} is VALID [2022-02-20 19:56:46,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {9255#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {9255#true} assume 1 == ~E_M~0;~E_M~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {9255#true} assume 1 == ~E_1~0;~E_1~0 := 2; {9255#true} is VALID [2022-02-20 19:56:46,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,981 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9255#true} {9256#false} #682#return; {9256#false} is VALID [2022-02-20 19:56:46,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {9256#false} assume !false; {9256#false} is VALID [2022-02-20 19:56:46,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {9256#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {9256#false} is VALID [2022-02-20 19:56:46,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {9256#false} assume !false; {9256#false} is VALID [2022-02-20 19:56:46,981 INFO L272 TraceCheckUtils]: 43: Hoare triple {9256#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {9255#true} is VALID [2022-02-20 19:56:46,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {9255#true} havoc ~__retres1~6; {9255#true} is VALID [2022-02-20 19:56:46,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {9255#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {9255#true} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {9255#true} #res := ~__retres1~6; {9255#true} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {9255#true} assume true; {9255#true} is VALID [2022-02-20 19:56:46,982 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9255#true} {9256#false} #684#return; {9256#false} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {9256#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {9256#false} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {9256#false} assume 0 != eval2_~tmp~5#1; {9256#false} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {9256#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {9256#false} is VALID [2022-02-20 19:56:46,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {9256#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {9256#false} is VALID [2022-02-20 19:56:46,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {9256#false} assume !(0 == ~m_pc~0); {9256#false} is VALID [2022-02-20 19:56:46,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {9256#false} assume 1 == ~m_pc~0; {9256#false} is VALID [2022-02-20 19:56:46,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {9256#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {9256#false} is VALID [2022-02-20 19:56:46,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {9256#false} assume !false; {9256#false} is VALID [2022-02-20 19:56:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:46,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:46,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122559070] [2022-02-20 19:56:46,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122559070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:46,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:46,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:46,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545900330] [2022-02-20 19:56:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:46,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:46,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:47,023 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:56:47,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:47,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:47,024 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:50,707 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-02-20 19:56:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:56:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 57 [2022-02-20 19:56:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 888 transitions. [2022-02-20 19:56:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 888 transitions. [2022-02-20 19:56:50,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 888 transitions. [2022-02-20 19:56:51,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 888 edges. 888 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:51,551 INFO L225 Difference]: With dead ends: 1537 [2022-02-20 19:56:51,552 INFO L226 Difference]: Without dead ends: 1261 [2022-02-20 19:56:51,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:56:51,554 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 938 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:51,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 913 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:56:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-02-20 19:56:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-02-20 19:56:52,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:52,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-02-20 19:56:52,126 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-02-20 19:56:52,128 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-02-20 19:56:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,205 INFO L93 Difference]: Finished difference Result 1261 states and 1782 transitions. [2022-02-20 19:56:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1782 transitions. [2022-02-20 19:56:52,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:52,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:52,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) Second operand 1261 states. [2022-02-20 19:56:52,214 INFO L87 Difference]: Start difference. First operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) Second operand 1261 states. [2022-02-20 19:56:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,296 INFO L93 Difference]: Finished difference Result 1261 states and 1782 transitions. [2022-02-20 19:56:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1782 transitions. [2022-02-20 19:56:52,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:52,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:52,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:52,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-02-20 19:56:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-02-20 19:56:52,383 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-02-20 19:56:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:52,383 INFO L470 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-02-20 19:56:52,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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:56:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-02-20 19:56:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:52,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:52,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:52,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:56:52,385 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-02-20 19:56:52,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:52,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601689236] [2022-02-20 19:56:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {15425#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:52,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:52,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {15387#(= ~q_read_ev~0 2)} #652#return; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {15428#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {15428#(= |old(~q_read_ev~0)| 0)} assume true; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15428#(= |old(~q_read_ev~0)| 0)} {15387#(= ~q_read_ev~0 2)} #654#return; {15386#false} is VALID [2022-02-20 19:56:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {15385#true} havoc ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {15385#true} assume 1 == ~p_dw_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {15385#true} is VALID [2022-02-20 19:56:52,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {15385#true} #res := ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,478 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15385#true} {15385#true} #648#return; {15385#true} is VALID [2022-02-20 19:56:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {15385#true} havoc ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {15385#true} assume 1 == ~c_dr_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {15385#true} is VALID [2022-02-20 19:56:52,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {15385#true} #res := ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15385#true} {15385#true} #650#return; {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L272 TraceCheckUtils]: 1: Hoare triple {15385#true} call #t~ret8 := is_do_write_p_triggered(); {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#true} havoc ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {15385#true} assume 1 == ~p_dw_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {15385#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {15385#true} #res := ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15385#true} {15385#true} #648#return; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {15385#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {15385#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {15385#true} call #t~ret9 := is_do_read_c_triggered(); {15385#true} is VALID [2022-02-20 19:56:52,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {15385#true} havoc ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {15385#true} assume 1 == ~c_dr_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {15385#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {15385#true} #res := ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15385#true} {15385#true} #650#return; {15385#true} is VALID [2022-02-20 19:56:52,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {15385#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {15385#true} is VALID [2022-02-20 19:56:52,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {15385#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15385#true} is VALID [2022-02-20 19:56:52,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,488 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15385#true} {15386#false} #656#return; {15386#false} is VALID [2022-02-20 19:56:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {15385#true} is VALID [2022-02-20 19:56:52,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {15385#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15385#true} is VALID [2022-02-20 19:56:52,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15385#true} {15386#false} #658#return; {15386#false} is VALID [2022-02-20 19:56:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:52,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {15385#true} havoc ~__retres1~2; {15385#true} is VALID [2022-02-20 19:56:52,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {15385#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15385#true} is VALID [2022-02-20 19:56:52,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#true} #res := ~__retres1~2; {15385#true} is VALID [2022-02-20 19:56:52,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,509 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15385#true} {15386#false} #660#return; {15386#false} is VALID [2022-02-20 19:56:52,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {15385#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {15385#true} is VALID [2022-02-20 19:56:52,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {15385#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; {15385#true} is VALID [2022-02-20 19:56:52,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {15385#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; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {15387#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {15387#(= ~q_read_ev~0 2)} call update_channels1(); {15425#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:52,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {15425#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:52,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:52,513 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15426#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {15387#(= ~q_read_ev~0 2)} #652#return; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {15387#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {15387#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {15387#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {15387#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {15387#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:52,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {15387#(= ~q_read_ev~0 2)} call fire_delta_events1(); {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:52,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {15428#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {15428#(= |old(~q_read_ev~0)| 0)} assume true; {15428#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:52,518 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15428#(= |old(~q_read_ev~0)| 0)} {15387#(= ~q_read_ev~0 2)} #654#return; {15386#false} is VALID [2022-02-20 19:56:52,518 INFO L272 TraceCheckUtils]: 17: Hoare triple {15386#false} call activate_threads1(); {15429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:52,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {15429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {15385#true} is VALID [2022-02-20 19:56:52,518 INFO L272 TraceCheckUtils]: 19: Hoare triple {15385#true} call #t~ret8 := is_do_write_p_triggered(); {15385#true} is VALID [2022-02-20 19:56:52,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {15385#true} havoc ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {15385#true} assume 1 == ~p_dw_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {15385#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {15385#true} #res := ~__retres1~0; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15385#true} {15385#true} #648#return; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {15385#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {15385#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L272 TraceCheckUtils]: 28: Hoare triple {15385#true} call #t~ret9 := is_do_read_c_triggered(); {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#true} havoc ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {15385#true} assume 1 == ~c_dr_pc~0; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {15385#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {15385#true} #res := ~__retres1~1; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15385#true} {15385#true} #650#return; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {15385#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {15385#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15385#true} is VALID [2022-02-20 19:56:52,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,521 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15385#true} {15386#false} #656#return; {15386#false} is VALID [2022-02-20 19:56:52,521 INFO L272 TraceCheckUtils]: 39: Hoare triple {15386#false} call reset_delta_events1(); {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:52,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {15427#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {15385#true} is VALID [2022-02-20 19:56:52,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {15385#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15385#true} is VALID [2022-02-20 19:56:52,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,521 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {15385#true} {15386#false} #658#return; {15386#false} is VALID [2022-02-20 19:56:52,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {15386#false} assume !false; {15386#false} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {15386#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {15386#false} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {15386#false} assume !false; {15386#false} is VALID [2022-02-20 19:56:52,522 INFO L272 TraceCheckUtils]: 47: Hoare triple {15386#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {15385#true} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {15385#true} havoc ~__retres1~2; {15385#true} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {15385#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15385#true} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {15385#true} #res := ~__retres1~2; {15385#true} is VALID [2022-02-20 19:56:52,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {15385#true} assume true; {15385#true} is VALID [2022-02-20 19:56:52,522 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15385#true} {15386#false} #660#return; {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {15386#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {15386#false} assume 0 != eval1_~tmp___1~0#1; {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {15386#false} assume !(0 == ~p_dw_st~0); {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {15386#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {15386#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {15386#false} is VALID [2022-02-20 19:56:52,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {15386#false} assume 0 == ~c_dr_pc~0; {15386#false} is VALID [2022-02-20 19:56:52,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {15386#false} assume !false; {15386#false} is VALID [2022-02-20 19:56:52,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {15386#false} assume !(1 == ~q_free~0); {15386#false} is VALID [2022-02-20 19:56:52,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {15386#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {15386#false} is VALID [2022-02-20 19:56:52,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {15386#false} assume !(~p_last_write~0 == ~c_last_read~0); {15386#false} is VALID [2022-02-20 19:56:52,525 INFO L272 TraceCheckUtils]: 63: Hoare triple {15386#false} call error1(); {15386#false} is VALID [2022-02-20 19:56:52,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {15386#false} assume !false; {15386#false} is VALID [2022-02-20 19:56:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:52,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:52,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601689236] [2022-02-20 19:56:52,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601689236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:52,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:52,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:52,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542414984] [2022-02-20 19:56:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:52,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:52,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:52,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:52,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:52,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:52,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:52,572 INFO L87 Difference]: Start difference. First operand 1090 states and 1511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:54,883 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-02-20 19:56:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 590 transitions. [2022-02-20 19:56:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 590 transitions. [2022-02-20 19:56:54,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 590 transitions. [2022-02-20 19:56:55,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,459 INFO L225 Difference]: With dead ends: 1313 [2022-02-20 19:56:55,459 INFO L226 Difference]: Without dead ends: 1225 [2022-02-20 19:56:55,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:56:55,460 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 528 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:55,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 777 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:56:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-02-20 19:56:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-02-20 19:56:55,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:55,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1225 states. Second operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-02-20 19:56:55,999 INFO L74 IsIncluded]: Start isIncluded. First operand 1225 states. Second operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-02-20 19:56:56,002 INFO L87 Difference]: Start difference. First operand 1225 states. Second operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-02-20 19:56:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:56,071 INFO L93 Difference]: Finished difference Result 1225 states and 1697 transitions. [2022-02-20 19:56:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1697 transitions. [2022-02-20 19:56:56,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:56,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) Second operand 1225 states. [2022-02-20 19:56:56,080 INFO L87 Difference]: Start difference. First operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) Second operand 1225 states. [2022-02-20 19:56:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:56,152 INFO L93 Difference]: Finished difference Result 1225 states and 1697 transitions. [2022-02-20 19:56:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1697 transitions. [2022-02-20 19:56:56,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:56,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:56,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:56,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-02-20 19:56:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-02-20 19:56:56,253 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-02-20 19:56:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:56,254 INFO L470 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-02-20 19:56:56,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-02-20 19:56:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:56,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:56,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:56,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:56:56,257 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-02-20 19:56:56,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:56,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131429702] [2022-02-20 19:56:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {21363#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21325#(= ~q_write_ev~0 ~q_read_ev~0)} #652#return; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {21365#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {21365#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {21325#(= ~q_write_ev~0 ~q_read_ev~0)} #654#return; {21324#false} is VALID [2022-02-20 19:56:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {21323#true} havoc ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {21323#true} assume !(1 == ~p_dw_pc~0); {21323#true} is VALID [2022-02-20 19:56:56,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#true} ~__retres1~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {21323#true} #res := ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,362 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21323#true} {21323#true} #648#return; {21323#true} is VALID [2022-02-20 19:56:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {21323#true} havoc ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {21323#true} assume 1 == ~c_dr_pc~0; {21323#true} is VALID [2022-02-20 19:56:56,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21323#true} is VALID [2022-02-20 19:56:56,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {21323#true} #res := ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,372 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21323#true} {21323#true} #650#return; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {21367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L272 TraceCheckUtils]: 1: Hoare triple {21323#true} call #t~ret8 := is_do_write_p_triggered(); {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#true} havoc ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {21323#true} assume !(1 == ~p_dw_pc~0); {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {21323#true} ~__retres1~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {21323#true} #res := ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,373 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21323#true} {21323#true} #648#return; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {21323#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {21323#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {21323#true} call #t~ret9 := is_do_read_c_triggered(); {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {21323#true} havoc ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {21323#true} assume 1 == ~c_dr_pc~0; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {21323#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21323#true} is VALID [2022-02-20 19:56:56,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {21323#true} #res := ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21323#true} {21323#true} #650#return; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {21323#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {21323#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,375 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21323#true} {21324#false} #656#return; {21324#false} is VALID [2022-02-20 19:56:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {21323#true} is VALID [2022-02-20 19:56:56,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {21323#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21323#true} is VALID [2022-02-20 19:56:56,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21323#true} {21324#false} #658#return; {21324#false} is VALID [2022-02-20 19:56:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:56,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {21323#true} havoc ~__retres1~2; {21323#true} is VALID [2022-02-20 19:56:56,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {21323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21323#true} is VALID [2022-02-20 19:56:56,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#true} #res := ~__retres1~2; {21323#true} is VALID [2022-02-20 19:56:56,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,386 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21323#true} {21324#false} #660#return; {21324#false} is VALID [2022-02-20 19:56:56,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {21323#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {21323#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; {21323#true} is VALID [2022-02-20 19:56:56,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {21323#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; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {21363#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:56,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {21363#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,390 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21325#(= ~q_write_ev~0 ~q_read_ev~0)} #652#return; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {21325#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:56,392 INFO L272 TraceCheckUtils]: 12: Hoare triple {21325#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {21365#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {21365#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:56,394 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21366#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {21325#(= ~q_write_ev~0 ~q_read_ev~0)} #654#return; {21324#false} is VALID [2022-02-20 19:56:56,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {21324#false} call activate_threads1(); {21367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:56,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {21367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {21323#true} is VALID [2022-02-20 19:56:56,394 INFO L272 TraceCheckUtils]: 19: Hoare triple {21323#true} call #t~ret8 := is_do_write_p_triggered(); {21323#true} is VALID [2022-02-20 19:56:56,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {21323#true} havoc ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {21323#true} assume !(1 == ~p_dw_pc~0); {21323#true} is VALID [2022-02-20 19:56:56,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {21323#true} ~__retres1~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {21323#true} #res := ~__retres1~0; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21323#true} {21323#true} #648#return; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {21323#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {21323#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {21323#true} call #t~ret9 := is_do_read_c_triggered(); {21323#true} is VALID [2022-02-20 19:56:56,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {21323#true} havoc ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {21323#true} assume 1 == ~c_dr_pc~0; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {21323#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {21323#true} #res := ~__retres1~1; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21323#true} {21323#true} #650#return; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {21323#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {21323#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {21323#true} is VALID [2022-02-20 19:56:56,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,397 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21323#true} {21324#false} #656#return; {21324#false} is VALID [2022-02-20 19:56:56,397 INFO L272 TraceCheckUtils]: 39: Hoare triple {21324#false} call reset_delta_events1(); {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:56,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {21364#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {21323#true} is VALID [2022-02-20 19:56:56,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {21323#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {21323#true} is VALID [2022-02-20 19:56:56,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,397 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21323#true} {21324#false} #658#return; {21324#false} is VALID [2022-02-20 19:56:56,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {21324#false} assume !false; {21324#false} is VALID [2022-02-20 19:56:56,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {21324#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {21324#false} is VALID [2022-02-20 19:56:56,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {21324#false} assume !false; {21324#false} is VALID [2022-02-20 19:56:56,400 INFO L272 TraceCheckUtils]: 47: Hoare triple {21324#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21323#true} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {21323#true} havoc ~__retres1~2; {21323#true} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {21323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21323#true} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {21323#true} #res := ~__retres1~2; {21323#true} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {21323#true} assume true; {21323#true} is VALID [2022-02-20 19:56:56,401 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21323#true} {21324#false} #660#return; {21324#false} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {21324#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {21324#false} is VALID [2022-02-20 19:56:56,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {21324#false} assume 0 != eval1_~tmp___1~0#1; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {21324#false} assume !(0 == ~p_dw_st~0); {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {21324#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {21324#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {21324#false} assume 0 == ~c_dr_pc~0; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {21324#false} assume !false; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {21324#false} assume !(1 == ~q_free~0); {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {21324#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {21324#false} is VALID [2022-02-20 19:56:56,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {21324#false} assume !(~p_last_write~0 == ~c_last_read~0); {21324#false} is VALID [2022-02-20 19:56:56,403 INFO L272 TraceCheckUtils]: 63: Hoare triple {21324#false} call error1(); {21324#false} is VALID [2022-02-20 19:56:56,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {21324#false} assume !false; {21324#false} is VALID [2022-02-20 19:56:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:56,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:56,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131429702] [2022-02-20 19:56:56,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131429702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:56,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:56,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:56,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876574971] [2022-02-20 19:56:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:56,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:56,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:56,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:56,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:56,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:56,448 INFO L87 Difference]: Start difference. First operand 1186 states and 1643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:59,018 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-02-20 19:56:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:56:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 613 transitions. [2022-02-20 19:56:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 613 transitions. [2022-02-20 19:56:59,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 613 transitions. [2022-02-20 19:56:59,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:59,614 INFO L225 Difference]: With dead ends: 1533 [2022-02-20 19:56:59,614 INFO L226 Difference]: Without dead ends: 1356 [2022-02-20 19:56:59,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:56:59,615 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 715 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:59,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 1040 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-02-20 19:57:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-02-20 19:57:00,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:00,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1356 states. Second operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-02-20 19:57:00,184 INFO L74 IsIncluded]: Start isIncluded. First operand 1356 states. Second operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-02-20 19:57:00,186 INFO L87 Difference]: Start difference. First operand 1356 states. Second operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-02-20 19:57:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,270 INFO L93 Difference]: Finished difference Result 1356 states and 1880 transitions. [2022-02-20 19:57:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1880 transitions. [2022-02-20 19:57:00,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) Second operand 1356 states. [2022-02-20 19:57:00,279 INFO L87 Difference]: Start difference. First operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) Second operand 1356 states. [2022-02-20 19:57:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,366 INFO L93 Difference]: Finished difference Result 1356 states and 1880 transitions. [2022-02-20 19:57:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1880 transitions. [2022-02-20 19:57:00,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:00,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-02-20 19:57:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-02-20 19:57:00,489 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-02-20 19:57:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:00,489 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-02-20 19:57:00,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-02-20 19:57:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:00,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:00,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:00,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:00,492 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-02-20 19:57:00,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:00,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159136724] [2022-02-20 19:57:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {27991#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27952#true} is VALID [2022-02-20 19:57:00,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27952#true} {27952#true} #652#return; {27952#true} is VALID [2022-02-20 19:57:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume !(0 == ~q_write_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27952#true} {27952#true} #654#return; {27952#true} is VALID [2022-02-20 19:57:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {27952#true} havoc ~__retres1~0; {27952#true} is VALID [2022-02-20 19:57:00,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume !(1 == ~p_dw_pc~0); {27952#true} is VALID [2022-02-20 19:57:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} ~__retres1~0 := 0; {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:00,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,623 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27952#true} #648#return; {28000#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {27952#true} havoc ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume 1 == ~c_dr_pc~0; {27952#true} is VALID [2022-02-20 19:57:00,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {27952#true} is VALID [2022-02-20 19:57:00,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {27952#true} #res := ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,629 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27952#true} {27953#false} #650#return; {27953#false} is VALID [2022-02-20 19:57:00,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {27993#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27952#true} is VALID [2022-02-20 19:57:00,629 INFO L272 TraceCheckUtils]: 1: Hoare triple {27952#true} call #t~ret8 := is_do_write_p_triggered(); {27952#true} is VALID [2022-02-20 19:57:00,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} havoc ~__retres1~0; {27952#true} is VALID [2022-02-20 19:57:00,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {27952#true} assume !(1 == ~p_dw_pc~0); {27952#true} is VALID [2022-02-20 19:57:00,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {27952#true} ~__retres1~0 := 0; {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:00,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,632 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27952#true} #648#return; {28000#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:00,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {28000#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28001#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:00,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {28001#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {27953#false} is VALID [2022-02-20 19:57:00,646 INFO L272 TraceCheckUtils]: 10: Hoare triple {27953#false} call #t~ret9 := is_do_read_c_triggered(); {27952#true} is VALID [2022-02-20 19:57:00,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {27952#true} havoc ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {27952#true} assume 1 == ~c_dr_pc~0; {27952#true} is VALID [2022-02-20 19:57:00,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {27952#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {27952#true} is VALID [2022-02-20 19:57:00,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {27952#true} #res := ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27952#true} {27953#false} #650#return; {27953#false} is VALID [2022-02-20 19:57:00,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {27953#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27953#false} is VALID [2022-02-20 19:57:00,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {27953#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27953#false} is VALID [2022-02-20 19:57:00,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {27953#false} assume true; {27953#false} is VALID [2022-02-20 19:57:00,659 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {27953#false} {27952#true} #656#return; {27953#false} is VALID [2022-02-20 19:57:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27952#true} is VALID [2022-02-20 19:57:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27952#true} {27953#false} #658#return; {27953#false} is VALID [2022-02-20 19:57:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {27952#true} havoc ~__retres1~2; {27952#true} is VALID [2022-02-20 19:57:00,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27952#true} is VALID [2022-02-20 19:57:00,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#true} #res := ~__retres1~2; {27952#true} is VALID [2022-02-20 19:57:00,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,666 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27952#true} {27953#false} #660#return; {27953#false} is VALID [2022-02-20 19:57:00,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {27952#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {27952#true} is VALID [2022-02-20 19:57:00,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {27952#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; {27952#true} is VALID [2022-02-20 19:57:00,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {27952#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; {27952#true} is VALID [2022-02-20 19:57:00,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {27952#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {27952#true} is VALID [2022-02-20 19:57:00,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {27952#true} call update_channels1(); {27991#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {27991#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27952#true} {27952#true} #652#return; {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {27952#true} assume { :begin_inline_init_threads1 } true; {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {27952#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {27952#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27952#true} is VALID [2022-02-20 19:57:00,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {27952#true} assume { :end_inline_init_threads1 } true; {27952#true} is VALID [2022-02-20 19:57:00,669 INFO L272 TraceCheckUtils]: 12: Hoare triple {27952#true} call fire_delta_events1(); {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:00,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {27952#true} assume !(0 == ~q_write_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,670 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27952#true} {27952#true} #654#return; {27952#true} is VALID [2022-02-20 19:57:00,670 INFO L272 TraceCheckUtils]: 17: Hoare triple {27952#true} call activate_threads1(); {27993#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:00,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {27993#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27952#true} is VALID [2022-02-20 19:57:00,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {27952#true} call #t~ret8 := is_do_write_p_triggered(); {27952#true} is VALID [2022-02-20 19:57:00,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {27952#true} havoc ~__retres1~0; {27952#true} is VALID [2022-02-20 19:57:00,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {27952#true} assume !(1 == ~p_dw_pc~0); {27952#true} is VALID [2022-02-20 19:57:00,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {27952#true} ~__retres1~0 := 0; {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:00,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {28008#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:00,673 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28009#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {27952#true} #648#return; {28000#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:00,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {28000#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28001#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {28001#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {27953#false} is VALID [2022-02-20 19:57:00,674 INFO L272 TraceCheckUtils]: 28: Hoare triple {27953#false} call #t~ret9 := is_do_read_c_triggered(); {27952#true} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {27952#true} havoc ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {27952#true} assume 1 == ~c_dr_pc~0; {27952#true} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {27952#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {27952#true} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {27952#true} #res := ~__retres1~1; {27952#true} is VALID [2022-02-20 19:57:00,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,675 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27952#true} {27953#false} #650#return; {27953#false} is VALID [2022-02-20 19:57:00,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {27953#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27953#false} is VALID [2022-02-20 19:57:00,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {27953#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27953#false} is VALID [2022-02-20 19:57:00,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {27953#false} assume true; {27953#false} is VALID [2022-02-20 19:57:00,675 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {27953#false} {27952#true} #656#return; {27953#false} is VALID [2022-02-20 19:57:00,675 INFO L272 TraceCheckUtils]: 39: Hoare triple {27953#false} call reset_delta_events1(); {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:00,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {27992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27952#true} is VALID [2022-02-20 19:57:00,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {27952#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27952#true} is VALID [2022-02-20 19:57:00,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,676 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {27952#true} {27953#false} #658#return; {27953#false} is VALID [2022-02-20 19:57:00,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {27953#false} assume !false; {27953#false} is VALID [2022-02-20 19:57:00,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {27953#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {27953#false} is VALID [2022-02-20 19:57:00,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {27953#false} assume !false; {27953#false} is VALID [2022-02-20 19:57:00,676 INFO L272 TraceCheckUtils]: 47: Hoare triple {27953#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27952#true} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {27952#true} havoc ~__retres1~2; {27952#true} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {27952#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27952#true} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {27952#true} #res := ~__retres1~2; {27952#true} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {27952#true} assume true; {27952#true} is VALID [2022-02-20 19:57:00,677 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27952#true} {27953#false} #660#return; {27953#false} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {27953#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {27953#false} is VALID [2022-02-20 19:57:00,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {27953#false} assume 0 != eval1_~tmp___1~0#1; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {27953#false} assume !(0 == ~p_dw_st~0); {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {27953#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {27953#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {27953#false} assume 0 == ~c_dr_pc~0; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {27953#false} assume !false; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {27953#false} assume !(1 == ~q_free~0); {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {27953#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {27953#false} is VALID [2022-02-20 19:57:00,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {27953#false} assume !(~p_last_write~0 == ~c_last_read~0); {27953#false} is VALID [2022-02-20 19:57:00,679 INFO L272 TraceCheckUtils]: 63: Hoare triple {27953#false} call error1(); {27953#false} is VALID [2022-02-20 19:57:00,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {27953#false} assume !false; {27953#false} is VALID [2022-02-20 19:57:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:00,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:00,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159136724] [2022-02-20 19:57:00,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159136724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:00,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:00,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:00,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081762356] [2022-02-20 19:57:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:00,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:00,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:00,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:00,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:00,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:00,721 INFO L87 Difference]: Start difference. First operand 1282 states and 1777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,013 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-02-20 19:57:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 431 transitions. [2022-02-20 19:57:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 431 transitions. [2022-02-20 19:57:03,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 431 transitions. [2022-02-20 19:57:03,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:03,405 INFO L225 Difference]: With dead ends: 1583 [2022-02-20 19:57:03,405 INFO L226 Difference]: Without dead ends: 1316 [2022-02-20 19:57:03,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:03,406 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:03,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 1078 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:57:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-02-20 19:57:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-02-20 19:57:04,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:04,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1316 states. Second operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-02-20 19:57:04,020 INFO L74 IsIncluded]: Start isIncluded. First operand 1316 states. Second operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-02-20 19:57:04,022 INFO L87 Difference]: Start difference. First operand 1316 states. Second operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-02-20 19:57:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,082 INFO L93 Difference]: Finished difference Result 1316 states and 1821 transitions. [2022-02-20 19:57:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1821 transitions. [2022-02-20 19:57:04,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) Second operand 1316 states. [2022-02-20 19:57:04,090 INFO L87 Difference]: Start difference. First operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) Second operand 1316 states. [2022-02-20 19:57:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,166 INFO L93 Difference]: Finished difference Result 1316 states and 1821 transitions. [2022-02-20 19:57:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1821 transitions. [2022-02-20 19:57:04,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:04,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:04,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-02-20 19:57:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-02-20 19:57:04,264 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-02-20 19:57:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:04,265 INFO L470 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-02-20 19:57:04,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-02-20 19:57:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:04,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:04,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:04,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:04,267 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-02-20 19:57:04,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:04,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357908706] [2022-02-20 19:57:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {34606#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {34566#true} is VALID [2022-02-20 19:57:04,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34566#true} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #652#return; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume !(0 == ~q_write_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34566#true} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #654#return; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {34566#true} havoc ~__retres1~0; {34566#true} is VALID [2022-02-20 19:57:04,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume !(1 == ~p_dw_pc~0); {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,374 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {34566#true} #648#return; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {34566#true} havoc ~__retres1~1; {34566#true} is VALID [2022-02-20 19:57:04,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume 1 == ~c_dr_pc~0; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,400 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #650#return; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {34608#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {34566#true} is VALID [2022-02-20 19:57:04,400 INFO L272 TraceCheckUtils]: 1: Hoare triple {34566#true} call #t~ret8 := is_do_write_p_triggered(); {34566#true} is VALID [2022-02-20 19:57:04,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#true} havoc ~__retres1~0; {34566#true} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {34566#true} assume !(1 == ~p_dw_pc~0); {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,402 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {34566#true} #648#return; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,403 INFO L272 TraceCheckUtils]: 10: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {34566#true} is VALID [2022-02-20 19:57:04,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {34566#true} havoc ~__retres1~1; {34566#true} is VALID [2022-02-20 19:57:04,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {34566#true} assume 1 == ~c_dr_pc~0; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,405 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #650#return; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,408 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #656#return; {34567#false} is VALID [2022-02-20 19:57:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {34566#true} is VALID [2022-02-20 19:57:04,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34566#true} {34567#false} #658#return; {34567#false} is VALID [2022-02-20 19:57:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {34566#true} havoc ~__retres1~2; {34566#true} is VALID [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {34566#true} is VALID [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#true} #res := ~__retres1~2; {34566#true} is VALID [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,414 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {34566#true} {34567#false} #660#return; {34567#false} is VALID [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {34566#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {34566#true} is VALID [2022-02-20 19:57:04,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#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; {34566#true} is VALID [2022-02-20 19:57:04,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#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; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {34606#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:04,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {34606#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {34566#true} is VALID [2022-02-20 19:57:04,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,417 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34566#true} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #652#return; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:04,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {34566#true} assume !(0 == ~q_write_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,420 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34566#true} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #654#return; {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:57:04,420 INFO L272 TraceCheckUtils]: 17: Hoare triple {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {34608#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:04,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {34608#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {34566#true} is VALID [2022-02-20 19:57:04,420 INFO L272 TraceCheckUtils]: 19: Hoare triple {34566#true} call #t~ret8 := is_do_write_p_triggered(); {34566#true} is VALID [2022-02-20 19:57:04,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {34566#true} havoc ~__retres1~0; {34566#true} is VALID [2022-02-20 19:57:04,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {34566#true} assume !(1 == ~p_dw_pc~0); {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,423 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {34566#true} #648#return; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:57:04,423 INFO L272 TraceCheckUtils]: 28: Hoare triple {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {34566#true} is VALID [2022-02-20 19:57:04,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {34566#true} havoc ~__retres1~1; {34566#true} is VALID [2022-02-20 19:57:04,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {34566#true} assume 1 == ~c_dr_pc~0; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:04,426 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {34623#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {34615#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #650#return; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:57:04,428 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {34622#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {34568#(= ~c_dr_pc~0 ~p_dw_pc~0)} #656#return; {34567#false} is VALID [2022-02-20 19:57:04,428 INFO L272 TraceCheckUtils]: 39: Hoare triple {34567#false} call reset_delta_events1(); {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:04,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {34607#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {34566#true} is VALID [2022-02-20 19:57:04,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {34566#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {34566#true} is VALID [2022-02-20 19:57:04,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,429 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {34566#true} {34567#false} #658#return; {34567#false} is VALID [2022-02-20 19:57:04,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {34567#false} assume !false; {34567#false} is VALID [2022-02-20 19:57:04,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {34567#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {34567#false} is VALID [2022-02-20 19:57:04,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {34567#false} assume !false; {34567#false} is VALID [2022-02-20 19:57:04,429 INFO L272 TraceCheckUtils]: 47: Hoare triple {34567#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {34566#true} is VALID [2022-02-20 19:57:04,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {34566#true} havoc ~__retres1~2; {34566#true} is VALID [2022-02-20 19:57:04,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {34566#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {34566#true} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {34566#true} #res := ~__retres1~2; {34566#true} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {34566#true} assume true; {34566#true} is VALID [2022-02-20 19:57:04,430 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34566#true} {34567#false} #660#return; {34567#false} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {34567#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {34567#false} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {34567#false} assume 0 != eval1_~tmp___1~0#1; {34567#false} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {34567#false} assume !(0 == ~p_dw_st~0); {34567#false} is VALID [2022-02-20 19:57:04,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {34567#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {34567#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {34567#false} assume 0 == ~c_dr_pc~0; {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {34567#false} assume !false; {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {34567#false} assume !(1 == ~q_free~0); {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {34567#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {34567#false} assume !(~p_last_write~0 == ~c_last_read~0); {34567#false} is VALID [2022-02-20 19:57:04,431 INFO L272 TraceCheckUtils]: 63: Hoare triple {34567#false} call error1(); {34567#false} is VALID [2022-02-20 19:57:04,432 INFO L290 TraceCheckUtils]: 64: Hoare triple {34567#false} assume !false; {34567#false} is VALID [2022-02-20 19:57:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:04,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:04,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357908706] [2022-02-20 19:57:04,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357908706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:04,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:04,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:04,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084576485] [2022-02-20 19:57:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:04,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:04,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:04,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:04,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:04,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:04,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:04,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:04,477 INFO L87 Difference]: Start difference. First operand 1287 states and 1780 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,581 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-02-20 19:57:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1080 transitions. [2022-02-20 19:57:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1080 transitions. [2022-02-20 19:57:10,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1080 transitions. [2022-02-20 19:57:11,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1080 edges. 1080 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:11,721 INFO L225 Difference]: With dead ends: 2949 [2022-02-20 19:57:11,721 INFO L226 Difference]: Without dead ends: 2677 [2022-02-20 19:57:11,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 19:57:11,723 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 1250 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:11,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 1533 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:57:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-02-20 19:57:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-02-20 19:57:13,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:13,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2677 states. Second operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-02-20 19:57:13,525 INFO L74 IsIncluded]: Start isIncluded. First operand 2677 states. Second operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-02-20 19:57:13,528 INFO L87 Difference]: Start difference. First operand 2677 states. Second operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-02-20 19:57:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,815 INFO L93 Difference]: Finished difference Result 2677 states and 3588 transitions. [2022-02-20 19:57:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3588 transitions. [2022-02-20 19:57:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) Second operand 2677 states. [2022-02-20 19:57:13,828 INFO L87 Difference]: Start difference. First operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) Second operand 2677 states. [2022-02-20 19:57:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:14,123 INFO L93 Difference]: Finished difference Result 2677 states and 3588 transitions. [2022-02-20 19:57:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3588 transitions. [2022-02-20 19:57:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:14,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:14,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:14,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-02-20 19:57:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-02-20 19:57:14,478 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-02-20 19:57:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:14,479 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-02-20 19:57:14,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-02-20 19:57:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:14,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:14,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:14,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:14,488 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-02-20 19:57:14,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:14,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125613261] [2022-02-20 19:57:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {47326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {47287#true} is VALID [2022-02-20 19:57:14,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47287#true} {47287#true} #652#return; {47287#true} is VALID [2022-02-20 19:57:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume !(0 == ~q_write_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47287#true} {47287#true} #654#return; {47287#true} is VALID [2022-02-20 19:57:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {47287#true} havoc ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume !(1 == ~p_dw_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} ~__retres1~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {47287#true} #res := ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,580 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {47287#true} {47287#true} #648#return; {47287#true} is VALID [2022-02-20 19:57:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {47287#true} havoc ~__retres1~1; {47287#true} is VALID [2022-02-20 19:57:14,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume !(1 == ~c_dr_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} ~__retres1~1 := 0; {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:14,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,609 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {47287#true} #650#return; {47341#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:14,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {47328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {47287#true} is VALID [2022-02-20 19:57:14,609 INFO L272 TraceCheckUtils]: 1: Hoare triple {47287#true} call #t~ret8 := is_do_write_p_triggered(); {47287#true} is VALID [2022-02-20 19:57:14,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} havoc ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {47287#true} assume !(1 == ~p_dw_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {47287#true} ~__retres1~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {47287#true} #res := ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47287#true} {47287#true} #648#return; {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {47287#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {47287#true} assume !(0 != ~tmp~1); {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L272 TraceCheckUtils]: 10: Hoare triple {47287#true} call #t~ret9 := is_do_read_c_triggered(); {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {47287#true} havoc ~__retres1~1; {47287#true} is VALID [2022-02-20 19:57:14,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {47287#true} assume !(1 == ~c_dr_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {47287#true} ~__retres1~1 := 0; {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:14,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,612 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {47287#true} #650#return; {47341#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:14,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {47341#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47342#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:14,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {47342#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {47288#false} is VALID [2022-02-20 19:57:14,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {47288#false} assume true; {47288#false} is VALID [2022-02-20 19:57:14,613 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {47288#false} {47287#true} #656#return; {47288#false} is VALID [2022-02-20 19:57:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {47287#true} is VALID [2022-02-20 19:57:14,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47287#true} {47288#false} #658#return; {47288#false} is VALID [2022-02-20 19:57:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:14,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {47287#true} havoc ~__retres1~2; {47287#true} is VALID [2022-02-20 19:57:14,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#true} #res := ~__retres1~2; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47287#true} {47288#false} #660#return; {47288#false} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {47287#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {47287#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; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {47287#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; {47287#true} is VALID [2022-02-20 19:57:14,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {47287#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {47287#true} is VALID [2022-02-20 19:57:14,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {47287#true} call update_channels1(); {47326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:14,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {47326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {47287#true} is VALID [2022-02-20 19:57:14,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,622 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47287#true} {47287#true} #652#return; {47287#true} is VALID [2022-02-20 19:57:14,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {47287#true} assume { :begin_inline_init_threads1 } true; {47287#true} is VALID [2022-02-20 19:57:14,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {47287#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {47287#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {47287#true} assume { :end_inline_init_threads1 } true; {47287#true} is VALID [2022-02-20 19:57:14,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {47287#true} call fire_delta_events1(); {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:14,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {47287#true} assume !(0 == ~q_write_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,624 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {47287#true} {47287#true} #654#return; {47287#true} is VALID [2022-02-20 19:57:14,624 INFO L272 TraceCheckUtils]: 17: Hoare triple {47287#true} call activate_threads1(); {47328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:14,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {47328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L272 TraceCheckUtils]: 19: Hoare triple {47287#true} call #t~ret8 := is_do_write_p_triggered(); {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {47287#true} havoc ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {47287#true} assume !(1 == ~p_dw_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {47287#true} ~__retres1~0 := 0; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {47287#true} #res := ~__retres1~0; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {47287#true} {47287#true} #648#return; {47287#true} is VALID [2022-02-20 19:57:14,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {47287#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47287#true} is VALID [2022-02-20 19:57:14,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {47287#true} assume !(0 != ~tmp~1); {47287#true} is VALID [2022-02-20 19:57:14,626 INFO L272 TraceCheckUtils]: 28: Hoare triple {47287#true} call #t~ret9 := is_do_read_c_triggered(); {47287#true} is VALID [2022-02-20 19:57:14,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {47287#true} havoc ~__retres1~1; {47287#true} is VALID [2022-02-20 19:57:14,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {47287#true} assume !(1 == ~c_dr_pc~0); {47287#true} is VALID [2022-02-20 19:57:14,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {47287#true} ~__retres1~1 := 0; {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:14,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {47343#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:14,628 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {47344#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {47287#true} #650#return; {47341#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:14,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {47341#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47342#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:14,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {47342#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {47288#false} is VALID [2022-02-20 19:57:14,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {47288#false} assume true; {47288#false} is VALID [2022-02-20 19:57:14,629 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {47288#false} {47287#true} #656#return; {47288#false} is VALID [2022-02-20 19:57:14,629 INFO L272 TraceCheckUtils]: 39: Hoare triple {47288#false} call reset_delta_events1(); {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:14,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {47327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {47287#true} is VALID [2022-02-20 19:57:14,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {47287#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {47287#true} is VALID [2022-02-20 19:57:14,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,630 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {47287#true} {47288#false} #658#return; {47288#false} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {47288#false} assume !false; {47288#false} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {47288#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {47288#false} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {47288#false} assume !false; {47288#false} is VALID [2022-02-20 19:57:14,630 INFO L272 TraceCheckUtils]: 47: Hoare triple {47288#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {47287#true} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {47287#true} havoc ~__retres1~2; {47287#true} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {47287#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47287#true} is VALID [2022-02-20 19:57:14,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {47287#true} #res := ~__retres1~2; {47287#true} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {47287#true} assume true; {47287#true} is VALID [2022-02-20 19:57:14,631 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {47287#true} {47288#false} #660#return; {47288#false} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {47288#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {47288#false} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 54: Hoare triple {47288#false} assume 0 != eval1_~tmp___1~0#1; {47288#false} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 55: Hoare triple {47288#false} assume !(0 == ~p_dw_st~0); {47288#false} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {47288#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {47288#false} is VALID [2022-02-20 19:57:14,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {47288#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {47288#false} assume 0 == ~c_dr_pc~0; {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 59: Hoare triple {47288#false} assume !false; {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {47288#false} assume !(1 == ~q_free~0); {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {47288#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 62: Hoare triple {47288#false} assume !(~p_last_write~0 == ~c_last_read~0); {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L272 TraceCheckUtils]: 63: Hoare triple {47288#false} call error1(); {47288#false} is VALID [2022-02-20 19:57:14,632 INFO L290 TraceCheckUtils]: 64: Hoare triple {47288#false} assume !false; {47288#false} is VALID [2022-02-20 19:57:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:14,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:14,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125613261] [2022-02-20 19:57:14,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125613261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:14,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:14,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:14,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223922939] [2022-02-20 19:57:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:14,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:14,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:14,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:14,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:14,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:14,674 INFO L87 Difference]: Start difference. First operand 2427 states and 3264 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,640 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-02-20 19:57:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 433 transitions. [2022-02-20 19:57:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 433 transitions. [2022-02-20 19:57:18,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 433 transitions. [2022-02-20 19:57:18,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:19,239 INFO L225 Difference]: With dead ends: 4028 [2022-02-20 19:57:19,239 INFO L226 Difference]: Without dead ends: 2616 [2022-02-20 19:57:19,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:19,241 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 206 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:19,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 1193 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:57:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-02-20 19:57:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-02-20 19:57:20,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:20,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2616 states. Second operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-02-20 19:57:20,933 INFO L74 IsIncluded]: Start isIncluded. First operand 2616 states. Second operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-02-20 19:57:20,936 INFO L87 Difference]: Start difference. First operand 2616 states. Second operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-02-20 19:57:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,220 INFO L93 Difference]: Finished difference Result 2616 states and 3483 transitions. [2022-02-20 19:57:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3483 transitions. [2022-02-20 19:57:21,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) Second operand 2616 states. [2022-02-20 19:57:21,232 INFO L87 Difference]: Start difference. First operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) Second operand 2616 states. [2022-02-20 19:57:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,511 INFO L93 Difference]: Finished difference Result 2616 states and 3483 transitions. [2022-02-20 19:57:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3483 transitions. [2022-02-20 19:57:21,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:21,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-02-20 19:57:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-02-20 19:57:21,863 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-02-20 19:57:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:21,864 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-02-20 19:57:21,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-02-20 19:57:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:21,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:21,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:21,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:21,866 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-02-20 19:57:21,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:21,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532373349] [2022-02-20 19:57:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {61365#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #652#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #654#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {61325#true} havoc ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {61325#true} assume !(1 == ~p_dw_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {61325#true} ~__retres1~0 := 0; {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {61325#true} #res := ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61325#true} {61325#true} #648#return; {61325#true} is VALID [2022-02-20 19:57:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {61325#true} havoc ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {61325#true} assume !(1 == ~c_dr_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {61325#true} ~__retres1~1 := 0; {61325#true} is VALID [2022-02-20 19:57:21,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {61325#true} #res := ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61325#true} {61325#true} #650#return; {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {61367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L272 TraceCheckUtils]: 1: Hoare triple {61325#true} call #t~ret8 := is_do_write_p_triggered(); {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {61325#true} havoc ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {61325#true} assume !(1 == ~p_dw_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {61325#true} ~__retres1~0 := 0; {61325#true} is VALID [2022-02-20 19:57:21,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {61325#true} #res := ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61325#true} {61325#true} #648#return; {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {61325#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {61325#true} assume !(0 != ~tmp~1); {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L272 TraceCheckUtils]: 10: Hoare triple {61325#true} call #t~ret9 := is_do_read_c_triggered(); {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {61325#true} havoc ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {61325#true} assume !(1 == ~c_dr_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {61325#true} ~__retres1~1 := 0; {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {61325#true} #res := ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61325#true} {61325#true} #650#return; {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {61325#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {61325#true} assume !(0 != ~tmp___0~1); {61325#true} is VALID [2022-02-20 19:57:21,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,948 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {61325#true} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #656#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {61380#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:21,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {61380#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:21,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:21,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #658#return; {61326#false} is VALID [2022-02-20 19:57:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {61325#true} havoc ~__retres1~2; {61325#true} is VALID [2022-02-20 19:57:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {61325#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61325#true} is VALID [2022-02-20 19:57:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {61325#true} #res := ~__retres1~2; {61325#true} is VALID [2022-02-20 19:57:21,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,976 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {61325#true} {61326#false} #660#return; {61326#false} is VALID [2022-02-20 19:57:21,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {61325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {61325#true} is VALID [2022-02-20 19:57:21,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {61325#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; {61325#true} is VALID [2022-02-20 19:57:21,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {61325#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; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {61365#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:21,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {61365#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,979 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #652#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,983 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #654#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,984 INFO L272 TraceCheckUtils]: 17: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {61367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:21,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {61367#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {61325#true} is VALID [2022-02-20 19:57:21,984 INFO L272 TraceCheckUtils]: 19: Hoare triple {61325#true} call #t~ret8 := is_do_write_p_triggered(); {61325#true} is VALID [2022-02-20 19:57:21,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {61325#true} havoc ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {61325#true} assume !(1 == ~p_dw_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {61325#true} ~__retres1~0 := 0; {61325#true} is VALID [2022-02-20 19:57:21,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {61325#true} #res := ~__retres1~0; {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {61325#true} {61325#true} #648#return; {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {61325#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {61325#true} assume !(0 != ~tmp~1); {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L272 TraceCheckUtils]: 28: Hoare triple {61325#true} call #t~ret9 := is_do_read_c_triggered(); {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {61325#true} havoc ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {61325#true} assume !(1 == ~c_dr_pc~0); {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {61325#true} ~__retres1~1 := 0; {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {61325#true} #res := ~__retres1~1; {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {61325#true} {61325#true} #650#return; {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {61325#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {61325#true} assume !(0 != ~tmp___0~1); {61325#true} is VALID [2022-02-20 19:57:21,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,987 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {61325#true} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #656#return; {61327#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,987 INFO L272 TraceCheckUtils]: 39: Hoare triple {61327#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {61366#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {61380#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:21,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {61380#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:21,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:21,989 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {61381#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {61327#(= ~q_write_ev~0 ~q_read_ev~0)} #658#return; {61326#false} is VALID [2022-02-20 19:57:21,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {61326#false} assume !false; {61326#false} is VALID [2022-02-20 19:57:21,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {61326#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {61326#false} is VALID [2022-02-20 19:57:21,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {61326#false} assume !false; {61326#false} is VALID [2022-02-20 19:57:21,990 INFO L272 TraceCheckUtils]: 47: Hoare triple {61326#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {61325#true} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {61325#true} havoc ~__retres1~2; {61325#true} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {61325#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61325#true} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {61325#true} #res := ~__retres1~2; {61325#true} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {61325#true} assume true; {61325#true} is VALID [2022-02-20 19:57:21,990 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {61325#true} {61326#false} #660#return; {61326#false} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {61326#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {61326#false} is VALID [2022-02-20 19:57:21,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {61326#false} assume 0 != eval1_~tmp___1~0#1; {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {61326#false} assume !(0 == ~p_dw_st~0); {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {61326#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {61326#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {61326#false} assume 0 == ~c_dr_pc~0; {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {61326#false} assume !false; {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {61326#false} assume !(1 == ~q_free~0); {61326#false} is VALID [2022-02-20 19:57:21,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {61326#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {61326#false} is VALID [2022-02-20 19:57:21,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {61326#false} assume !(~p_last_write~0 == ~c_last_read~0); {61326#false} is VALID [2022-02-20 19:57:21,992 INFO L272 TraceCheckUtils]: 63: Hoare triple {61326#false} call error1(); {61326#false} is VALID [2022-02-20 19:57:21,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {61326#false} assume !false; {61326#false} is VALID [2022-02-20 19:57:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:21,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:21,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532373349] [2022-02-20 19:57:21,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532373349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:21,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:21,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:21,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029426238] [2022-02-20 19:57:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:21,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:21,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:22,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:22,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:22,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:22,044 INFO L87 Difference]: Start difference. First operand 2472 states and 3303 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:26,288 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-02-20 19:57:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 605 transitions. [2022-02-20 19:57:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 605 transitions. [2022-02-20 19:57:26,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 605 transitions. [2022-02-20 19:57:26,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.