./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.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-2+token_ring.08.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 b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:03,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:03,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:03,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:03,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:03,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:03,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:03,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:03,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:03,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:03,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:03,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:03,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:03,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:03,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:03,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:03,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:03,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:03,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:03,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:03,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:03,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:03,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:03,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:03,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:03,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:03,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:03,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:03,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:03,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:03,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:03,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:03,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:03,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:03,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:03,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:03,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:03,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:03,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:03,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:03,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:03,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:03,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:03,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:03,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:03,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:03,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:03,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:03,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:03,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:03,467 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:03,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:03,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:03,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:03,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:03,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:03,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:03,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:03,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:03,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:03,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:03,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:03,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:03,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:03,472 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 -> b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b [2022-02-20 19:59:03,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:03,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:03,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:03,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:03,681 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:03,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:03,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aa360bd/5cdc5c532d6f4cc2bd857f9706321ab1/FLAGdf1567dec [2022-02-20 19:59:04,115 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:04,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:04,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aa360bd/5cdc5c532d6f4cc2bd857f9706321ab1/FLAGdf1567dec [2022-02-20 19:59:04,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aa360bd/5cdc5c532d6f4cc2bd857f9706321ab1 [2022-02-20 19:59:04,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:04,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:04,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:04,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:04,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:04,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b508d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04, skipping insertion in model container [2022-02-20 19:59:04,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:04,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:04,680 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-2+token_ring.08.cil-1.c[914,927] [2022-02-20 19:59:04,734 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-2+token_ring.08.cil-1.c[7125,7138] [2022-02-20 19:59:04,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:04,817 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:04,824 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-2+token_ring.08.cil-1.c[914,927] [2022-02-20 19:59:04,839 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-2+token_ring.08.cil-1.c[7125,7138] [2022-02-20 19:59:04,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:04,898 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:04,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04 WrapperNode [2022-02-20 19:59:04,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:04,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:04,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:04,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:04,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,973 INFO L137 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 809 [2022-02-20 19:59:04,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:04,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:04,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:04,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:04,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:04,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:05,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:05,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:05,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:05,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:05,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:05,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:05,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:05,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (1/1) ... [2022-02-20 19:59:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:05,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:05,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:05,117 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:05,117 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:05,117 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:05,117 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:05,117 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:05,117 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:05,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:05,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:05,140 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:05,140 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:05,141 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:05,141 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:05,141 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:05,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:05,142 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:05,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:05,142 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:05,274 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:05,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:06,037 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:06,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:06,058 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-02-20 19:59:06,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:06 BoogieIcfgContainer [2022-02-20 19:59:06,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:06,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:06,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:06,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:06,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:04" (1/3) ... [2022-02-20 19:59:06,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e88b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:06, skipping insertion in model container [2022-02-20 19:59:06,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:04" (2/3) ... [2022-02-20 19:59:06,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e88b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:06, skipping insertion in model container [2022-02-20 19:59:06,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:06" (3/3) ... [2022-02-20 19:59:06,066 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:06,069 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:06,069 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:06,100 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:06,104 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:06,104 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 19:59:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:06,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,136 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] [2022-02-20 19:59:06,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1531446909, now seen corresponding path program 1 times [2022-02-20 19:59:06,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:06,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795086316] [2022-02-20 19:59:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#(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); {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {389#(= ~q_read_ev~0 2)} #1437#return; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(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; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#(= |old(~q_read_ev~0)| 0)} assume true; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#(= |old(~q_read_ev~0)| 0)} {389#(= ~q_read_ev~0 2)} #1439#return; {388#false} is VALID [2022-02-20 19:59:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#true} havoc ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume !(1 == ~p_dw_pc~0); {387#true} is VALID [2022-02-20 19:59:06,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} ~__retres1~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#true} #res := ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,432 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {387#true} {387#true} #1433#return; {387#true} is VALID [2022-02-20 19:59:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#true} havoc ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume 1 == ~c_dr_pc~0; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#true} #res := ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {387#true} {387#true} #1435#return; {387#true} is VALID [2022-02-20 19:59:06,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#(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; {387#true} is VALID [2022-02-20 19:59:06,441 INFO L272 TraceCheckUtils]: 1: Hoare triple {387#true} call #t~ret8 := is_do_write_p_triggered(); {387#true} is VALID [2022-02-20 19:59:06,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} havoc ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#true} assume !(1 == ~p_dw_pc~0); {387#true} is VALID [2022-02-20 19:59:06,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {387#true} ~__retres1~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {387#true} #res := ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,441 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {387#true} {387#true} #1433#return; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {387#true} call #t~ret9 := is_do_read_c_triggered(); {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#true} havoc ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#true} assume 1 == ~c_dr_pc~0; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {387#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {387#true} is VALID [2022-02-20 19:59:06,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {387#true} #res := ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {387#true} {387#true} #1435#return; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {387#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {387#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,443 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {387#true} {388#false} #1441#return; {388#false} is VALID [2022-02-20 19:59:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(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); {387#true} is VALID [2022-02-20 19:59:06,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {387#true} is VALID [2022-02-20 19:59:06,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {387#true} {388#false} #1443#return; {388#false} is VALID [2022-02-20 19:59:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#true} havoc ~__retres1~2; {387#true} is VALID [2022-02-20 19:59:06,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {387#true} is VALID [2022-02-20 19:59:06,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} #res := ~__retres1~2; {387#true} is VALID [2022-02-20 19:59:06,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,455 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {387#true} {388#false} #1445#return; {388#false} is VALID [2022-02-20 19:59:06,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {387#true} is VALID [2022-02-20 19:59:06,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(= ~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; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#(= ~q_read_ev~0 2)} call update_channels1(); {427#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:06,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#(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); {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,459 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {428#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {389#(= ~q_read_ev~0 2)} #1437#return; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {389#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {389#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:06,461 INFO L272 TraceCheckUtils]: 12: Hoare triple {389#(= ~q_read_ev~0 2)} call fire_delta_events1(); {429#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#(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; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(= |old(~q_read_ev~0)| 0)} assume true; {430#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:06,463 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {430#(= |old(~q_read_ev~0)| 0)} {389#(= ~q_read_ev~0 2)} #1439#return; {388#false} is VALID [2022-02-20 19:59:06,463 INFO L272 TraceCheckUtils]: 17: Hoare triple {388#false} call activate_threads1(); {431#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:06,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {431#(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; {387#true} is VALID [2022-02-20 19:59:06,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {387#true} call #t~ret8 := is_do_write_p_triggered(); {387#true} is VALID [2022-02-20 19:59:06,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {387#true} havoc ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {387#true} assume !(1 == ~p_dw_pc~0); {387#true} is VALID [2022-02-20 19:59:06,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {387#true} ~__retres1~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {387#true} #res := ~__retres1~0; {387#true} is VALID [2022-02-20 19:59:06,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,465 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {387#true} {387#true} #1433#return; {387#true} is VALID [2022-02-20 19:59:06,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {387#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {387#true} is VALID [2022-02-20 19:59:06,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {387#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,465 INFO L272 TraceCheckUtils]: 28: Hoare triple {387#true} call #t~ret9 := is_do_read_c_triggered(); {387#true} is VALID [2022-02-20 19:59:06,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {387#true} havoc ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {387#true} assume 1 == ~c_dr_pc~0; {387#true} is VALID [2022-02-20 19:59:06,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {387#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {387#true} is VALID [2022-02-20 19:59:06,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {387#true} #res := ~__retres1~1; {387#true} is VALID [2022-02-20 19:59:06,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,466 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {387#true} {387#true} #1435#return; {387#true} is VALID [2022-02-20 19:59:06,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {387#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {387#true} is VALID [2022-02-20 19:59:06,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {387#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {387#true} is VALID [2022-02-20 19:59:06,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,467 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {387#true} {388#false} #1441#return; {388#false} is VALID [2022-02-20 19:59:06,467 INFO L272 TraceCheckUtils]: 39: Hoare triple {388#false} call reset_delta_events1(); {429#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {429#(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); {387#true} is VALID [2022-02-20 19:59:06,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {387#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {387#true} is VALID [2022-02-20 19:59:06,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,468 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {387#true} {388#false} #1443#return; {388#false} is VALID [2022-02-20 19:59:06,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:06,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {388#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; {388#false} is VALID [2022-02-20 19:59:06,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:06,469 INFO L272 TraceCheckUtils]: 47: Hoare triple {388#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {387#true} is VALID [2022-02-20 19:59:06,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {387#true} havoc ~__retres1~2; {387#true} is VALID [2022-02-20 19:59:06,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {387#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {387#true} is VALID [2022-02-20 19:59:06,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {387#true} #res := ~__retres1~2; {387#true} is VALID [2022-02-20 19:59:06,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {387#true} assume true; {387#true} is VALID [2022-02-20 19:59:06,470 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {387#true} {388#false} #1445#return; {388#false} is VALID [2022-02-20 19:59:06,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {388#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; {388#false} is VALID [2022-02-20 19:59:06,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {388#false} assume 0 != eval1_~tmp___1~0#1; {388#false} is VALID [2022-02-20 19:59:06,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {388#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {388#false} is VALID [2022-02-20 19:59:06,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {388#false} assume !(0 != eval1_~tmp~2#1); {388#false} is VALID [2022-02-20 19:59:06,471 INFO L272 TraceCheckUtils]: 57: Hoare triple {388#false} call error1(); {388#false} is VALID [2022-02-20 19:59:06,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:06,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795086316] [2022-02-20 19:59:06,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795086316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:06,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:06,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:06,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139311228] [2022-02-20 19:59:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:06,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:06,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:06,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:06,562 INFO L87 Difference]: Start difference. First operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,442 INFO L93 Difference]: Finished difference Result 880 states and 1386 transitions. [2022-02-20 19:59:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1386 transitions. [2022-02-20 19:59:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1386 transitions. [2022-02-20 19:59:09,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1386 transitions. [2022-02-20 19:59:10,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1386 edges. 1386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,446 INFO L225 Difference]: With dead ends: 880 [2022-02-20 19:59:10,447 INFO L226 Difference]: Without dead ends: 510 [2022-02-20 19:59:10,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:10,453 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 691 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:10,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 1966 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-02-20 19:59:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 470. [2022-02-20 19:59:10,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:10,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:10,524 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:10,525 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,546 INFO L93 Difference]: Finished difference Result 510 states and 751 transitions. [2022-02-20 19:59:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 751 transitions. [2022-02-20 19:59:10,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 510 states. [2022-02-20 19:59:10,553 INFO L87 Difference]: Start difference. First operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 510 states. [2022-02-20 19:59:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,573 INFO L93 Difference]: Finished difference Result 510 states and 751 transitions. [2022-02-20 19:59:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 751 transitions. [2022-02-20 19:59:10,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 696 transitions. [2022-02-20 19:59:10,597 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 696 transitions. Word has length 59 [2022-02-20 19:59:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,598 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 696 transitions. [2022-02-20 19:59:10,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 696 transitions. [2022-02-20 19:59:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,600 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] [2022-02-20 19:59:10,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:10,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 396825793, now seen corresponding path program 1 times [2022-02-20 19:59:10,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:10,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762222429] [2022-02-20 19:59:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {3325#(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); {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3287#(= ~q_write_ev~0 ~q_read_ev~0)} #1437#return; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {3326#(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); {3327#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {3327#(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; {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3287#(= ~q_write_ev~0 ~q_read_ev~0)} #1439#return; {3286#false} is VALID [2022-02-20 19:59:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#true} havoc ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume !(1 == ~p_dw_pc~0); {3285#true} is VALID [2022-02-20 19:59:10,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} ~__retres1~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#true} #res := ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,739 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3285#true} {3285#true} #1433#return; {3285#true} is VALID [2022-02-20 19:59:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#true} havoc ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume 1 == ~c_dr_pc~0; {3285#true} is VALID [2022-02-20 19:59:10,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3285#true} is VALID [2022-02-20 19:59:10,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#true} #res := ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3285#true} {3285#true} #1435#return; {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {3329#(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; {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L272 TraceCheckUtils]: 1: Hoare triple {3285#true} call #t~ret8 := is_do_write_p_triggered(); {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} havoc ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#true} assume !(1 == ~p_dw_pc~0); {3285#true} is VALID [2022-02-20 19:59:10,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {3285#true} ~__retres1~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {3285#true} #res := ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3285#true} {3285#true} #1433#return; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {3285#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {3285#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L272 TraceCheckUtils]: 10: Hoare triple {3285#true} call #t~ret9 := is_do_read_c_triggered(); {3285#true} is VALID [2022-02-20 19:59:10,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {3285#true} havoc ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {3285#true} assume 1 == ~c_dr_pc~0; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {3285#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {3285#true} #res := ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3285#true} {3285#true} #1435#return; {3285#true} is VALID [2022-02-20 19:59:10,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {3285#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3285#true} is VALID [2022-02-20 19:59:10,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {3285#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,756 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3285#true} {3286#false} #1441#return; {3286#false} is VALID [2022-02-20 19:59:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {3326#(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); {3285#true} is VALID [2022-02-20 19:59:10,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3285#true} is VALID [2022-02-20 19:59:10,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3285#true} {3286#false} #1443#return; {3286#false} is VALID [2022-02-20 19:59:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#true} havoc ~__retres1~2; {3285#true} is VALID [2022-02-20 19:59:10,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3285#true} is VALID [2022-02-20 19:59:10,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} #res := ~__retres1~2; {3285#true} is VALID [2022-02-20 19:59:10,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,772 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3285#true} {3286#false} #1445#return; {3286#false} is VALID [2022-02-20 19:59:10,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {3285#true} is VALID [2022-02-20 19:59:10,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {3287#(= ~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; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3325#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:10,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {3325#(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); {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,775 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3287#(= ~q_write_ev~0 ~q_read_ev~0)} #1437#return; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3287#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {3287#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(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); {3327#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {3327#(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; {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,778 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3328#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3287#(= ~q_write_ev~0 ~q_read_ev~0)} #1439#return; {3286#false} is VALID [2022-02-20 19:59:10,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {3286#false} call activate_threads1(); {3329#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:10,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {3329#(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; {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {3285#true} call #t~ret8 := is_do_write_p_triggered(); {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {3285#true} havoc ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {3285#true} assume !(1 == ~p_dw_pc~0); {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {3285#true} ~__retres1~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {3285#true} #res := ~__retres1~0; {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,779 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3285#true} {3285#true} #1433#return; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {3285#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {3285#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L272 TraceCheckUtils]: 28: Hoare triple {3285#true} call #t~ret9 := is_do_read_c_triggered(); {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {3285#true} havoc ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {3285#true} assume 1 == ~c_dr_pc~0; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {3285#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {3285#true} #res := ~__retres1~1; {3285#true} is VALID [2022-02-20 19:59:10,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,781 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3285#true} {3285#true} #1435#return; {3285#true} is VALID [2022-02-20 19:59:10,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {3285#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3285#true} is VALID [2022-02-20 19:59:10,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {3285#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3285#true} is VALID [2022-02-20 19:59:10,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,781 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3285#true} {3286#false} #1441#return; {3286#false} is VALID [2022-02-20 19:59:10,781 INFO L272 TraceCheckUtils]: 39: Hoare triple {3286#false} call reset_delta_events1(); {3326#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {3326#(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); {3285#true} is VALID [2022-02-20 19:59:10,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {3285#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3285#true} is VALID [2022-02-20 19:59:10,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,782 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3285#true} {3286#false} #1443#return; {3286#false} is VALID [2022-02-20 19:59:10,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:10,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {3286#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; {3286#false} is VALID [2022-02-20 19:59:10,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:10,782 INFO L272 TraceCheckUtils]: 47: Hoare triple {3286#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3285#true} is VALID [2022-02-20 19:59:10,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {3285#true} havoc ~__retres1~2; {3285#true} is VALID [2022-02-20 19:59:10,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {3285#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3285#true} is VALID [2022-02-20 19:59:10,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {3285#true} #res := ~__retres1~2; {3285#true} is VALID [2022-02-20 19:59:10,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {3285#true} assume true; {3285#true} is VALID [2022-02-20 19:59:10,783 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3285#true} {3286#false} #1445#return; {3286#false} is VALID [2022-02-20 19:59:10,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {3286#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; {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {3286#false} assume 0 != eval1_~tmp___1~0#1; {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {3286#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {3286#false} assume !(0 != eval1_~tmp~2#1); {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L272 TraceCheckUtils]: 57: Hoare triple {3286#false} call error1(); {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:10,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:10,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762222429] [2022-02-20 19:59:10,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762222429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:10,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:10,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:10,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494669354] [2022-02-20 19:59:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:10,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:10,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:10,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:10,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:10,819 INFO L87 Difference]: Start difference. First operand 470 states and 696 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:13,930 INFO L93 Difference]: Finished difference Result 819 states and 1175 transitions. [2022-02-20 19:59:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 904 transitions. [2022-02-20 19:59:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 904 transitions. [2022-02-20 19:59:13,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 904 transitions. [2022-02-20 19:59:14,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 904 edges. 904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,591 INFO L225 Difference]: With dead ends: 819 [2022-02-20 19:59:14,592 INFO L226 Difference]: Without dead ends: 641 [2022-02-20 19:59:14,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:14,593 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 1116 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:14,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2149 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-02-20 19:59:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-02-20 19:59:14,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:14,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 641 states. Second operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:59:14,625 INFO L74 IsIncluded]: Start isIncluded. First operand 641 states. Second operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:59:14,627 INFO L87 Difference]: Start difference. First operand 641 states. Second operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:59:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,648 INFO L93 Difference]: Finished difference Result 641 states and 934 transitions. [2022-02-20 19:59:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 934 transitions. [2022-02-20 19:59:14,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) Second operand 641 states. [2022-02-20 19:59:14,655 INFO L87 Difference]: Start difference. First operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) Second operand 641 states. [2022-02-20 19:59:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,676 INFO L93 Difference]: Finished difference Result 641 states and 934 transitions. [2022-02-20 19:59:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 934 transitions. [2022-02-20 19:59:14,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:14,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 474 states have (on average 1.481012658227848) internal successors, (702), 483 states have internal predecessors, (702), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2022-02-20 19:59:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 830 transitions. [2022-02-20 19:59:14,700 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 830 transitions. Word has length 59 [2022-02-20 19:59:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:14,701 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 830 transitions. [2022-02-20 19:59:14,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 830 transitions. [2022-02-20 19:59:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:14,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:14,702 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] [2022-02-20 19:59:14,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:14,703 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1290312131, now seen corresponding path program 1 times [2022-02-20 19:59:14,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:14,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653093204] [2022-02-20 19:59:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {6545#(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); {6506#true} is VALID [2022-02-20 19:59:14,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6506#true} {6506#true} #1437#return; {6506#true} is VALID [2022-02-20 19:59:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {6546#(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); {6506#true} is VALID [2022-02-20 19:59:14,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume !(0 == ~q_write_ev~0); {6506#true} is VALID [2022-02-20 19:59:14,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6506#true} {6506#true} #1439#return; {6506#true} is VALID [2022-02-20 19:59:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {6506#true} havoc ~__retres1~0; {6506#true} is VALID [2022-02-20 19:59:14,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume !(1 == ~p_dw_pc~0); {6506#true} is VALID [2022-02-20 19:59:14,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} ~__retres1~0 := 0; {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:14,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,857 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6506#true} #1433#return; {6554#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {6506#true} havoc ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume 1 == ~c_dr_pc~0; {6506#true} is VALID [2022-02-20 19:59:14,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6506#true} is VALID [2022-02-20 19:59:14,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {6506#true} #res := ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,862 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6506#true} {6507#false} #1435#return; {6507#false} is VALID [2022-02-20 19:59:14,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {6547#(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; {6506#true} is VALID [2022-02-20 19:59:14,862 INFO L272 TraceCheckUtils]: 1: Hoare triple {6506#true} call #t~ret8 := is_do_write_p_triggered(); {6506#true} is VALID [2022-02-20 19:59:14,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} havoc ~__retres1~0; {6506#true} is VALID [2022-02-20 19:59:14,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {6506#true} assume !(1 == ~p_dw_pc~0); {6506#true} is VALID [2022-02-20 19:59:14,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {6506#true} ~__retres1~0 := 0; {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:14,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,878 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6506#true} #1433#return; {6554#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:14,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {6554#(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; {6555#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:14,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {6555#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6507#false} is VALID [2022-02-20 19:59:14,880 INFO L272 TraceCheckUtils]: 10: Hoare triple {6507#false} call #t~ret9 := is_do_read_c_triggered(); {6506#true} is VALID [2022-02-20 19:59:14,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {6506#true} havoc ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {6506#true} assume 1 == ~c_dr_pc~0; {6506#true} is VALID [2022-02-20 19:59:14,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {6506#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6506#true} is VALID [2022-02-20 19:59:14,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {6506#true} #res := ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,881 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6506#true} {6507#false} #1435#return; {6507#false} is VALID [2022-02-20 19:59:14,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {6507#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6507#false} is VALID [2022-02-20 19:59:14,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {6507#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6507#false} is VALID [2022-02-20 19:59:14,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {6507#false} assume true; {6507#false} is VALID [2022-02-20 19:59:14,881 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6507#false} {6506#true} #1441#return; {6507#false} is VALID [2022-02-20 19:59:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {6546#(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); {6506#true} is VALID [2022-02-20 19:59:14,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6506#true} is VALID [2022-02-20 19:59:14,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6506#true} {6507#false} #1443#return; {6507#false} is VALID [2022-02-20 19:59:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {6506#true} havoc ~__retres1~2; {6506#true} is VALID [2022-02-20 19:59:14,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6506#true} is VALID [2022-02-20 19:59:14,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} #res := ~__retres1~2; {6506#true} is VALID [2022-02-20 19:59:14,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,900 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6506#true} {6507#false} #1445#return; {6507#false} is VALID [2022-02-20 19:59:14,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {6506#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {6506#true} is VALID [2022-02-20 19:59:14,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {6506#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {6506#true} is VALID [2022-02-20 19:59:14,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {6506#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {6506#true} is VALID [2022-02-20 19:59:14,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {6506#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; {6506#true} is VALID [2022-02-20 19:59:14,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {6506#true} call update_channels1(); {6545#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:14,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {6545#(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); {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6506#true} {6506#true} #1437#return; {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {6506#true} assume { :begin_inline_init_threads1 } true; {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {6506#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {6506#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6506#true} is VALID [2022-02-20 19:59:14,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {6506#true} assume { :end_inline_init_threads1 } true; {6506#true} is VALID [2022-02-20 19:59:14,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {6506#true} call fire_delta_events1(); {6546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:14,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {6546#(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); {6506#true} is VALID [2022-02-20 19:59:14,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {6506#true} assume !(0 == ~q_write_ev~0); {6506#true} is VALID [2022-02-20 19:59:14,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,904 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6506#true} {6506#true} #1439#return; {6506#true} is VALID [2022-02-20 19:59:14,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {6506#true} call activate_threads1(); {6547#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:14,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#(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; {6506#true} is VALID [2022-02-20 19:59:14,904 INFO L272 TraceCheckUtils]: 19: Hoare triple {6506#true} call #t~ret8 := is_do_write_p_triggered(); {6506#true} is VALID [2022-02-20 19:59:14,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {6506#true} havoc ~__retres1~0; {6506#true} is VALID [2022-02-20 19:59:14,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {6506#true} assume !(1 == ~p_dw_pc~0); {6506#true} is VALID [2022-02-20 19:59:14,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {6506#true} ~__retres1~0 := 0; {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:14,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {6562#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:14,906 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6563#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6506#true} #1433#return; {6554#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:14,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {6554#(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; {6555#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:14,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {6555#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6507#false} is VALID [2022-02-20 19:59:14,908 INFO L272 TraceCheckUtils]: 28: Hoare triple {6507#false} call #t~ret9 := is_do_read_c_triggered(); {6506#true} is VALID [2022-02-20 19:59:14,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {6506#true} havoc ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {6506#true} assume 1 == ~c_dr_pc~0; {6506#true} is VALID [2022-02-20 19:59:14,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {6506#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6506#true} is VALID [2022-02-20 19:59:14,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {6506#true} #res := ~__retres1~1; {6506#true} is VALID [2022-02-20 19:59:14,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,909 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6506#true} {6507#false} #1435#return; {6507#false} is VALID [2022-02-20 19:59:14,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {6507#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6507#false} is VALID [2022-02-20 19:59:14,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {6507#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6507#false} is VALID [2022-02-20 19:59:14,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {6507#false} assume true; {6507#false} is VALID [2022-02-20 19:59:14,909 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6507#false} {6506#true} #1441#return; {6507#false} is VALID [2022-02-20 19:59:14,909 INFO L272 TraceCheckUtils]: 39: Hoare triple {6507#false} call reset_delta_events1(); {6546#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:14,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {6546#(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); {6506#true} is VALID [2022-02-20 19:59:14,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {6506#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6506#true} is VALID [2022-02-20 19:59:14,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,911 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6506#true} {6507#false} #1443#return; {6507#false} is VALID [2022-02-20 19:59:14,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {6507#false} assume !false; {6507#false} is VALID [2022-02-20 19:59:14,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {6507#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; {6507#false} is VALID [2022-02-20 19:59:14,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {6507#false} assume !false; {6507#false} is VALID [2022-02-20 19:59:14,912 INFO L272 TraceCheckUtils]: 47: Hoare triple {6507#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6506#true} is VALID [2022-02-20 19:59:14,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {6506#true} havoc ~__retres1~2; {6506#true} is VALID [2022-02-20 19:59:14,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {6506#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6506#true} is VALID [2022-02-20 19:59:14,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {6506#true} #res := ~__retres1~2; {6506#true} is VALID [2022-02-20 19:59:14,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {6506#true} assume true; {6506#true} is VALID [2022-02-20 19:59:14,912 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6506#true} {6507#false} #1445#return; {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {6507#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; {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {6507#false} assume 0 != eval1_~tmp___1~0#1; {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {6507#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {6507#false} assume !(0 != eval1_~tmp~2#1); {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L272 TraceCheckUtils]: 57: Hoare triple {6507#false} call error1(); {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {6507#false} assume !false; {6507#false} is VALID [2022-02-20 19:59:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:14,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:14,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653093204] [2022-02-20 19:59:14,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653093204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:14,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:14,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:14,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943620088] [2022-02-20 19:59:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:14,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:14,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:14,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:14,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:14,950 INFO L87 Difference]: Start difference. First operand 566 states and 830 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:17,864 INFO L93 Difference]: Finished difference Result 868 states and 1245 transitions. [2022-02-20 19:59:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:17,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 721 transitions. [2022-02-20 19:59:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 721 transitions. [2022-02-20 19:59:17,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 721 transitions. [2022-02-20 19:59:18,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 721 edges. 721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,371 INFO L225 Difference]: With dead ends: 868 [2022-02-20 19:59:18,371 INFO L226 Difference]: Without dead ends: 600 [2022-02-20 19:59:18,372 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:59:18,373 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 728 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:18,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2197 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-02-20 19:59:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 571. [2022-02-20 19:59:18,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:18,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 600 states. Second operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:59:18,394 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:59:18,395 INFO L87 Difference]: Start difference. First operand 600 states. Second operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:59:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,410 INFO L93 Difference]: Finished difference Result 600 states and 874 transitions. [2022-02-20 19:59:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 874 transitions. [2022-02-20 19:59:18,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) Second operand 600 states. [2022-02-20 19:59:18,414 INFO L87 Difference]: Start difference. First operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) Second operand 600 states. [2022-02-20 19:59:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,430 INFO L93 Difference]: Finished difference Result 600 states and 874 transitions. [2022-02-20 19:59:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 874 transitions. [2022-02-20 19:59:18,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:18,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 478 states have (on average 1.4728033472803348) internal successors, (704), 487 states have internal predecessors, (704), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2022-02-20 19:59:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 833 transitions. [2022-02-20 19:59:18,450 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 833 transitions. Word has length 59 [2022-02-20 19:59:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:18,450 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 833 transitions. [2022-02-20 19:59:18,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 833 transitions. [2022-02-20 19:59:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:18,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,452 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] [2022-02-20 19:59:18,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:18,452 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1565071745, now seen corresponding path program 1 times [2022-02-20 19:59:18,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:18,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522414469] [2022-02-20 19:59:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {9748#(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); {9708#true} is VALID [2022-02-20 19:59:18,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9708#true} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1437#return; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {9749#(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); {9708#true} is VALID [2022-02-20 19:59:18,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume !(0 == ~q_write_ev~0); {9708#true} is VALID [2022-02-20 19:59:18,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9708#true} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1439#return; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {9708#true} havoc ~__retres1~0; {9708#true} is VALID [2022-02-20 19:59:18,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume !(1 == ~p_dw_pc~0); {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,592 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9708#true} #1433#return; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {9708#true} havoc ~__retres1~1; {9708#true} is VALID [2022-02-20 19:59:18,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume 1 == ~c_dr_pc~0; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,620 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1435#return; {9764#(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:59:18,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {9750#(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; {9708#true} is VALID [2022-02-20 19:59:18,621 INFO L272 TraceCheckUtils]: 1: Hoare triple {9708#true} call #t~ret8 := is_do_write_p_triggered(); {9708#true} is VALID [2022-02-20 19:59:18,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {9708#true} havoc ~__retres1~0; {9708#true} is VALID [2022-02-20 19:59:18,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {9708#true} assume !(1 == ~p_dw_pc~0); {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,622 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9708#true} #1433#return; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {9757#(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; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,623 INFO L272 TraceCheckUtils]: 10: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {9708#true} is VALID [2022-02-20 19:59:18,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {9708#true} havoc ~__retres1~1; {9708#true} is VALID [2022-02-20 19:59:18,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {9708#true} assume 1 == ~c_dr_pc~0; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,625 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1435#return; {9764#(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:59:18,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {9764#(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; {9764#(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:59:18,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {9764#(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; {9764#(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:59:18,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(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; {9764#(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:59:18,627 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9764#(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)))))} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1441#return; {9709#false} is VALID [2022-02-20 19:59:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {9749#(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); {9708#true} is VALID [2022-02-20 19:59:18,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9708#true} is VALID [2022-02-20 19:59:18,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9708#true} {9709#false} #1443#return; {9709#false} is VALID [2022-02-20 19:59:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {9708#true} havoc ~__retres1~2; {9708#true} is VALID [2022-02-20 19:59:18,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9708#true} is VALID [2022-02-20 19:59:18,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {9708#true} #res := ~__retres1~2; {9708#true} is VALID [2022-02-20 19:59:18,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,639 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9708#true} {9709#false} #1445#return; {9709#false} is VALID [2022-02-20 19:59:18,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {9708#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {9708#true} is VALID [2022-02-20 19:59:18,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {9708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {9708#true} is VALID [2022-02-20 19:59:18,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {9708#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {9710#(= ~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; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {9748#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:18,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {9748#(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); {9708#true} is VALID [2022-02-20 19:59:18,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,650 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9708#true} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1437#return; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,653 INFO L272 TraceCheckUtils]: 12: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {9749#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {9749#(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); {9708#true} is VALID [2022-02-20 19:59:18,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {9708#true} assume !(0 == ~q_write_ev~0); {9708#true} is VALID [2022-02-20 19:59:18,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,655 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9708#true} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1439#return; {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:18,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {9750#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:18,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {9750#(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; {9708#true} is VALID [2022-02-20 19:59:18,655 INFO L272 TraceCheckUtils]: 19: Hoare triple {9708#true} call #t~ret8 := is_do_write_p_triggered(); {9708#true} is VALID [2022-02-20 19:59:18,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {9708#true} havoc ~__retres1~0; {9708#true} is VALID [2022-02-20 19:59:18,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {9708#true} assume !(1 == ~p_dw_pc~0); {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,657 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {9708#true} #1433#return; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {9757#(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; {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:59:18,658 INFO L272 TraceCheckUtils]: 28: Hoare triple {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {9708#true} is VALID [2022-02-20 19:59:18,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {9708#true} havoc ~__retres1~1; {9708#true} is VALID [2022-02-20 19:59:18,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {9708#true} assume 1 == ~c_dr_pc~0; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:18,660 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9765#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {9757#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #1435#return; {9764#(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:59:18,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {9764#(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; {9764#(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:59:18,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {9764#(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; {9764#(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:59:18,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {9764#(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; {9764#(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:59:18,662 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9764#(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)))))} {9710#(= ~c_dr_pc~0 ~p_dw_pc~0)} #1441#return; {9709#false} is VALID [2022-02-20 19:59:18,662 INFO L272 TraceCheckUtils]: 39: Hoare triple {9709#false} call reset_delta_events1(); {9749#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {9749#(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); {9708#true} is VALID [2022-02-20 19:59:18,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {9708#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9708#true} is VALID [2022-02-20 19:59:18,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,662 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9708#true} {9709#false} #1443#return; {9709#false} is VALID [2022-02-20 19:59:18,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {9709#false} assume !false; {9709#false} is VALID [2022-02-20 19:59:18,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {9709#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; {9709#false} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {9709#false} assume !false; {9709#false} is VALID [2022-02-20 19:59:18,663 INFO L272 TraceCheckUtils]: 47: Hoare triple {9709#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9708#true} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {9708#true} havoc ~__retres1~2; {9708#true} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {9708#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9708#true} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {9708#true} #res := ~__retres1~2; {9708#true} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {9708#true} assume true; {9708#true} is VALID [2022-02-20 19:59:18,663 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9708#true} {9709#false} #1445#return; {9709#false} is VALID [2022-02-20 19:59:18,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {9709#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; {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {9709#false} assume 0 != eval1_~tmp___1~0#1; {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {9709#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {9709#false} assume !(0 != eval1_~tmp~2#1); {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L272 TraceCheckUtils]: 57: Hoare triple {9709#false} call error1(); {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {9709#false} assume !false; {9709#false} is VALID [2022-02-20 19:59:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:18,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522414469] [2022-02-20 19:59:18,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522414469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:18,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375987622] [2022-02-20 19:59:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:18,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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:59:18,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:18,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:18,719 INFO L87 Difference]: Start difference. First operand 571 states and 833 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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:59:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,341 INFO L93 Difference]: Finished difference Result 2239 states and 3111 transitions. [2022-02-20 19:59:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:24,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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:59:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1375 transitions. [2022-02-20 19:59:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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:59:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1375 transitions. [2022-02-20 19:59:24,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1375 transitions. [2022-02-20 19:59:25,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1375 edges. 1375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:25,555 INFO L225 Difference]: With dead ends: 2239 [2022-02-20 19:59:25,556 INFO L226 Difference]: Without dead ends: 1966 [2022-02-20 19:59:25,557 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:59:25,566 INFO L933 BasicCegarLoop]: 781 mSDtfsCounter, 2494 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:25,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2511 Valid, 2099 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:59:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2022-02-20 19:59:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1708. [2022-02-20 19:59:26,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:26,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1966 states. Second operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:59:26,171 INFO L74 IsIncluded]: Start isIncluded. First operand 1966 states. Second operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:59:26,175 INFO L87 Difference]: Start difference. First operand 1966 states. Second operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:59:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,296 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2022-02-20 19:59:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2646 transitions. [2022-02-20 19:59:26,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) Second operand 1966 states. [2022-02-20 19:59:26,307 INFO L87 Difference]: Start difference. First operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) Second operand 1966 states. [2022-02-20 19:59:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,424 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2022-02-20 19:59:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2646 transitions. [2022-02-20 19:59:26,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1375 states have (on average 1.3665454545454545) internal successors, (1879), 1404 states have internal predecessors, (1879), 176 states have call successors, (176), 130 states have call predecessors, (176), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2022-02-20 19:59:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2311 transitions. [2022-02-20 19:59:26,567 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2311 transitions. Word has length 59 [2022-02-20 19:59:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,567 INFO L470 AbstractCegarLoop]: Abstraction has 1708 states and 2311 transitions. [2022-02-20 19:59:26,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 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:59:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2311 transitions. [2022-02-20 19:59:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:26,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,570 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] [2022-02-20 19:59:26,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:26,570 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash 593397058, now seen corresponding path program 1 times [2022-02-20 19:59:26,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:26,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599745716] [2022-02-20 19:59:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {19073#(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); {19034#true} is VALID [2022-02-20 19:59:26,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19034#true} {19034#true} #1437#return; {19034#true} is VALID [2022-02-20 19:59:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {19074#(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); {19034#true} is VALID [2022-02-20 19:59:26,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume !(0 == ~q_write_ev~0); {19034#true} is VALID [2022-02-20 19:59:26,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19034#true} {19034#true} #1439#return; {19034#true} is VALID [2022-02-20 19:59:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {19034#true} havoc ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume !(1 == ~p_dw_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} ~__retres1~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {19034#true} #res := ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19034#true} {19034#true} #1433#return; {19034#true} is VALID [2022-02-20 19:59:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {19034#true} havoc ~__retres1~1; {19034#true} is VALID [2022-02-20 19:59:26,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume !(1 == ~c_dr_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} ~__retres1~1 := 0; {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,697 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19034#true} #1435#return; {19088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {19075#(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; {19034#true} is VALID [2022-02-20 19:59:26,697 INFO L272 TraceCheckUtils]: 1: Hoare triple {19034#true} call #t~ret8 := is_do_write_p_triggered(); {19034#true} is VALID [2022-02-20 19:59:26,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} havoc ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {19034#true} assume !(1 == ~p_dw_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {19034#true} ~__retres1~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {19034#true} #res := ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,698 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19034#true} {19034#true} #1433#return; {19034#true} is VALID [2022-02-20 19:59:26,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {19034#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19034#true} is VALID [2022-02-20 19:59:26,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {19034#true} assume !(0 != ~tmp~1); {19034#true} is VALID [2022-02-20 19:59:26,699 INFO L272 TraceCheckUtils]: 10: Hoare triple {19034#true} call #t~ret9 := is_do_read_c_triggered(); {19034#true} is VALID [2022-02-20 19:59:26,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {19034#true} havoc ~__retres1~1; {19034#true} is VALID [2022-02-20 19:59:26,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {19034#true} assume !(1 == ~c_dr_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {19034#true} ~__retres1~1 := 0; {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,700 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19034#true} #1435#return; {19088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {19088#(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; {19089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:26,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {19089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19035#false} is VALID [2022-02-20 19:59:26,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {19035#false} assume true; {19035#false} is VALID [2022-02-20 19:59:26,702 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19035#false} {19034#true} #1441#return; {19035#false} is VALID [2022-02-20 19:59:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {19074#(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); {19034#true} is VALID [2022-02-20 19:59:26,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19034#true} is VALID [2022-02-20 19:59:26,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19034#true} {19035#false} #1443#return; {19035#false} is VALID [2022-02-20 19:59:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {19034#true} havoc ~__retres1~2; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} #res := ~__retres1~2; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19034#true} {19035#false} #1445#return; {19035#false} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {19034#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {19034#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {19034#true} is VALID [2022-02-20 19:59:26,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {19034#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {19034#true} is VALID [2022-02-20 19:59:26,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {19034#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; {19034#true} is VALID [2022-02-20 19:59:26,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {19034#true} call update_channels1(); {19073#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:26,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {19073#(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); {19034#true} is VALID [2022-02-20 19:59:26,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,711 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19034#true} {19034#true} #1437#return; {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {19034#true} assume { :begin_inline_init_threads1 } true; {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {19034#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {19034#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {19034#true} assume { :end_inline_init_threads1 } true; {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L272 TraceCheckUtils]: 12: Hoare triple {19034#true} call fire_delta_events1(); {19074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {19074#(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); {19034#true} is VALID [2022-02-20 19:59:26,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {19034#true} assume !(0 == ~q_write_ev~0); {19034#true} is VALID [2022-02-20 19:59:26,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,713 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19034#true} {19034#true} #1439#return; {19034#true} is VALID [2022-02-20 19:59:26,713 INFO L272 TraceCheckUtils]: 17: Hoare triple {19034#true} call activate_threads1(); {19075#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:26,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {19075#(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; {19034#true} is VALID [2022-02-20 19:59:26,713 INFO L272 TraceCheckUtils]: 19: Hoare triple {19034#true} call #t~ret8 := is_do_write_p_triggered(); {19034#true} is VALID [2022-02-20 19:59:26,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {19034#true} havoc ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {19034#true} assume !(1 == ~p_dw_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {19034#true} ~__retres1~0 := 0; {19034#true} is VALID [2022-02-20 19:59:26,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {19034#true} #res := ~__retres1~0; {19034#true} is VALID [2022-02-20 19:59:26,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,715 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19034#true} {19034#true} #1433#return; {19034#true} is VALID [2022-02-20 19:59:26,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {19034#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19034#true} is VALID [2022-02-20 19:59:26,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {19034#true} assume !(0 != ~tmp~1); {19034#true} is VALID [2022-02-20 19:59:26,716 INFO L272 TraceCheckUtils]: 28: Hoare triple {19034#true} call #t~ret9 := is_do_read_c_triggered(); {19034#true} is VALID [2022-02-20 19:59:26,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {19034#true} havoc ~__retres1~1; {19034#true} is VALID [2022-02-20 19:59:26,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {19034#true} assume !(1 == ~c_dr_pc~0); {19034#true} is VALID [2022-02-20 19:59:26,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {19034#true} ~__retres1~1 := 0; {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:26,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {19090#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:26,718 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19091#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19034#true} #1435#return; {19088#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:26,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {19088#(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; {19089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:26,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {19089#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19035#false} is VALID [2022-02-20 19:59:26,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {19035#false} assume true; {19035#false} is VALID [2022-02-20 19:59:26,719 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19035#false} {19034#true} #1441#return; {19035#false} is VALID [2022-02-20 19:59:26,719 INFO L272 TraceCheckUtils]: 39: Hoare triple {19035#false} call reset_delta_events1(); {19074#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {19074#(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); {19034#true} is VALID [2022-02-20 19:59:26,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {19034#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19034#true} is VALID [2022-02-20 19:59:26,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,720 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19034#true} {19035#false} #1443#return; {19035#false} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {19035#false} assume !false; {19035#false} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {19035#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; {19035#false} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {19035#false} assume !false; {19035#false} is VALID [2022-02-20 19:59:26,720 INFO L272 TraceCheckUtils]: 47: Hoare triple {19035#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19034#true} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {19034#true} havoc ~__retres1~2; {19034#true} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {19034#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19034#true} is VALID [2022-02-20 19:59:26,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {19034#true} #res := ~__retres1~2; {19034#true} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {19034#true} assume true; {19034#true} is VALID [2022-02-20 19:59:26,721 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19034#true} {19035#false} #1445#return; {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {19035#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; {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {19035#false} assume 0 != eval1_~tmp___1~0#1; {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {19035#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {19035#false} assume !(0 != eval1_~tmp~2#1); {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L272 TraceCheckUtils]: 57: Hoare triple {19035#false} call error1(); {19035#false} is VALID [2022-02-20 19:59:26,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {19035#false} assume !false; {19035#false} is VALID [2022-02-20 19:59:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:26,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:26,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599745716] [2022-02-20 19:59:26,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599745716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:26,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:26,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:26,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65191232] [2022-02-20 19:59:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:26,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:26,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:26,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:26,753 INFO L87 Difference]: Start difference. First operand 1708 states and 2311 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,608 INFO L93 Difference]: Finished difference Result 3307 states and 4430 transitions. [2022-02-20 19:59:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 723 transitions. [2022-02-20 19:59:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 723 transitions. [2022-02-20 19:59:30,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 723 transitions. [2022-02-20 19:59:31,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,232 INFO L225 Difference]: With dead ends: 3307 [2022-02-20 19:59:31,232 INFO L226 Difference]: Without dead ends: 1897 [2022-02-20 19:59:31,235 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:59:31,235 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 488 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:31,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 2445 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-02-20 19:59:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1753. [2022-02-20 19:59:31,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:31,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1897 states. Second operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:59:31,867 INFO L74 IsIncluded]: Start isIncluded. First operand 1897 states. Second operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:59:31,869 INFO L87 Difference]: Start difference. First operand 1897 states. Second operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:59:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,006 INFO L93 Difference]: Finished difference Result 1897 states and 2530 transitions. [2022-02-20 19:59:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2530 transitions. [2022-02-20 19:59:32,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) Second operand 1897 states. [2022-02-20 19:59:32,028 INFO L87 Difference]: Start difference. First operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) Second operand 1897 states. [2022-02-20 19:59:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,175 INFO L93 Difference]: Finished difference Result 1897 states and 2530 transitions. [2022-02-20 19:59:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2530 transitions. [2022-02-20 19:59:32,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:32,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1411 states have (on average 1.3508150248051027) internal successors, (1906), 1440 states have internal predecessors, (1906), 176 states have call successors, (176), 130 states have call predecessors, (176), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2022-02-20 19:59:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2350 transitions. [2022-02-20 19:59:32,316 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2350 transitions. Word has length 59 [2022-02-20 19:59:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:32,317 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 2350 transitions. [2022-02-20 19:59:32,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2350 transitions. [2022-02-20 19:59:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:32,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:32,318 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] [2022-02-20 19:59:32,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:32,318 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1212041276, now seen corresponding path program 1 times [2022-02-20 19:59:32,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:32,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700879727] [2022-02-20 19:59:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {29685#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1437#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {29686#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1439#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {29645#true} havoc ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {29645#true} assume !(1 == ~p_dw_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {29645#true} ~__retres1~0 := 0; {29645#true} is VALID [2022-02-20 19:59:32,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {29645#true} #res := ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,390 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29645#true} {29645#true} #1433#return; {29645#true} is VALID [2022-02-20 19:59:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {29645#true} havoc ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {29645#true} assume !(1 == ~c_dr_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {29645#true} ~__retres1~1 := 0; {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {29645#true} #res := ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29645#true} {29645#true} #1435#return; {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {29687#(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; {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L272 TraceCheckUtils]: 1: Hoare triple {29645#true} call #t~ret8 := is_do_write_p_triggered(); {29645#true} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {29645#true} havoc ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {29645#true} assume !(1 == ~p_dw_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {29645#true} ~__retres1~0 := 0; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {29645#true} #res := ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29645#true} {29645#true} #1433#return; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {29645#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {29645#true} assume !(0 != ~tmp~1); {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {29645#true} call #t~ret9 := is_do_read_c_triggered(); {29645#true} is VALID [2022-02-20 19:59:32,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {29645#true} havoc ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {29645#true} assume !(1 == ~c_dr_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {29645#true} ~__retres1~1 := 0; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {29645#true} #res := ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29645#true} {29645#true} #1435#return; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {29645#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29645#true} is VALID [2022-02-20 19:59:32,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {29645#true} assume !(0 != ~tmp___0~1); {29645#true} is VALID [2022-02-20 19:59:32,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,397 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29645#true} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1441#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {29686#(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); {29700#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:32,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {29700#(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; {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:32,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:32,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1443#return; {29646#false} is VALID [2022-02-20 19:59:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {29645#true} havoc ~__retres1~2; {29645#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {29645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29645#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {29645#true} #res := ~__retres1~2; {29645#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,425 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29645#true} {29646#false} #1445#return; {29646#false} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {29645#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;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~token~0 := 0;~local~0 := 0; {29645#true} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {29645#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1;assume -2147483648 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 2147483647; {29645#true} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {29645#true} assume 0 != main_#t~nondet42#1;havoc main_#t~nondet42#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; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {29647#(= ~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; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29685#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:32,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {29685#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,429 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1437#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,430 INFO L272 TraceCheckUtils]: 12: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {29686#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {29686#(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); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1439#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,432 INFO L272 TraceCheckUtils]: 17: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29687#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:32,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {29687#(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; {29645#true} is VALID [2022-02-20 19:59:32,432 INFO L272 TraceCheckUtils]: 19: Hoare triple {29645#true} call #t~ret8 := is_do_write_p_triggered(); {29645#true} is VALID [2022-02-20 19:59:32,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {29645#true} havoc ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {29645#true} assume !(1 == ~p_dw_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {29645#true} ~__retres1~0 := 0; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {29645#true} #res := ~__retres1~0; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29645#true} {29645#true} #1433#return; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {29645#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {29645#true} assume !(0 != ~tmp~1); {29645#true} is VALID [2022-02-20 19:59:32,433 INFO L272 TraceCheckUtils]: 28: Hoare triple {29645#true} call #t~ret9 := is_do_read_c_triggered(); {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {29645#true} havoc ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {29645#true} assume !(1 == ~c_dr_pc~0); {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {29645#true} ~__retres1~1 := 0; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {29645#true} #res := ~__retres1~1; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29645#true} {29645#true} #1435#return; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {29645#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {29645#true} assume !(0 != ~tmp___0~1); {29645#true} is VALID [2022-02-20 19:59:32,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,435 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29645#true} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1441#return; {29647#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,435 INFO L272 TraceCheckUtils]: 39: Hoare triple {29647#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29686#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {29686#(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); {29700#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:32,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {29700#(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; {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:32,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:32,437 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29647#(= ~q_write_ev~0 ~q_read_ev~0)} #1443#return; {29646#false} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {29646#false} assume !false; {29646#false} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {29646#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; {29646#false} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {29646#false} assume !false; {29646#false} is VALID [2022-02-20 19:59:32,437 INFO L272 TraceCheckUtils]: 47: Hoare triple {29646#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29645#true} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {29645#true} havoc ~__retres1~2; {29645#true} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {29645#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29645#true} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {29645#true} #res := ~__retres1~2; {29645#true} is VALID [2022-02-20 19:59:32,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {29645#true} assume true; {29645#true} is VALID [2022-02-20 19:59:32,438 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29645#true} {29646#false} #1445#return; {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {29646#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; {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {29646#false} assume 0 != eval1_~tmp___1~0#1; {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {29646#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {29646#false} assume !(0 != eval1_~tmp~2#1); {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L272 TraceCheckUtils]: 57: Hoare triple {29646#false} call error1(); {29646#false} is VALID [2022-02-20 19:59:32,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {29646#false} assume !false; {29646#false} is VALID [2022-02-20 19:59:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:32,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:32,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700879727] [2022-02-20 19:59:32,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700879727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:32,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:32,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:32,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520621387] [2022-02-20 19:59:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:32,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:32,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:32,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:32,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:32,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:32,484 INFO L87 Difference]: Start difference. First operand 1753 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,218 INFO L93 Difference]: Finished difference Result 3188 states and 4187 transitions. [2022-02-20 19:59:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 896 transitions. [2022-02-20 19:59:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 896 transitions. [2022-02-20 19:59:36,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 896 transitions. [2022-02-20 19:59:36,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 896 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:37,014 INFO L225 Difference]: With dead ends: 3188 [2022-02-20 19:59:37,015 INFO L226 Difference]: Without dead ends: 1952 [2022-02-20 19:59:37,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:37,017 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 1121 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:37,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1146 Valid, 1878 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-02-20 19:59:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1731. [2022-02-20 19:59:37,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:37,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1952 states. Second operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:59:37,610 INFO L74 IsIncluded]: Start isIncluded. First operand 1952 states. Second operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:59:37,613 INFO L87 Difference]: Start difference. First operand 1952 states. Second operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:59:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,737 INFO L93 Difference]: Finished difference Result 1952 states and 2578 transitions. [2022-02-20 19:59:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2578 transitions. [2022-02-20 19:59:37,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:37,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:37,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) Second operand 1952 states. [2022-02-20 19:59:37,759 INFO L87 Difference]: Start difference. First operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) Second operand 1952 states. [2022-02-20 19:59:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,869 INFO L93 Difference]: Finished difference Result 1952 states and 2578 transitions. [2022-02-20 19:59:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2578 transitions. [2022-02-20 19:59:37,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:37,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:37,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:37,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1397 states have (on average 1.3471725125268432) internal successors, (1882), 1420 states have internal predecessors, (1882), 176 states have call successors, (176), 130 states have call predecessors, (176), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2022-02-20 19:59:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2310 transitions. [2022-02-20 19:59:37,996 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2310 transitions. Word has length 59 [2022-02-20 19:59:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:37,997 INFO L470 AbstractCegarLoop]: Abstraction has 1731 states and 2310 transitions. [2022-02-20 19:59:37,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2310 transitions. [2022-02-20 19:59:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:37,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:37,998 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] [2022-02-20 19:59:37,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:37,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1088781314, now seen corresponding path program 1 times [2022-02-20 19:59:37,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:38,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349961016] [2022-02-20 19:59:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:38,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:38,065 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:38,065 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:38,066 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:38,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:38,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:38,070 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:38,072 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:38,139 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:38,140 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:38,147 INFO L158 Benchmark]: Toolchain (without parser) took 33651.38ms. Allocated memory was 96.5MB in the beginning and 226.5MB in the end (delta: 130.0MB). Free memory was 67.5MB in the beginning and 173.6MB in the end (delta: -106.1MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,147 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:38,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.34ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 59.5MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.53ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 54.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,148 INFO L158 Benchmark]: Boogie Preprocessor took 48.91ms. Allocated memory is still 96.5MB. Free memory was 54.2MB in the beginning and 50.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,148 INFO L158 Benchmark]: RCFGBuilder took 1035.52ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 50.3MB in the beginning and 96.2MB in the end (delta: -45.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,148 INFO L158 Benchmark]: TraceAbstraction took 32084.84ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 95.7MB in the beginning and 173.6MB in the end (delta: -78.0MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:38,151 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.34ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 59.5MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.53ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 54.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.91ms. Allocated memory is still 96.5MB. Free memory was 54.2MB in the beginning and 50.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1035.52ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 50.3MB in the beginning and 96.2MB in the end (delta: -45.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32084.84ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 95.7MB in the beginning and 173.6MB in the end (delta: -78.0MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:38,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:39,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:39,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:39,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:39,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:39,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:39,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:39,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:39,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:39,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:39,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:39,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:39,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:39,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:39,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:39,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:39,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:39,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:39,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:39,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:39,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:39,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:39,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:39,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:39,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:39,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:39,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:39,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:39,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:39,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:39,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:39,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:39,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:39,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:39,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:39,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:39,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:39,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:39,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:39,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:39,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:39,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:59:39,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:40,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:40,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:40,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:40,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:40,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:40,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:40,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:40,009 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:40,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:40,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:40,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:40,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:40,011 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:40,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:40,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:40,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:40,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:40,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:40,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:40,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:40,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:40,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:40,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:40,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:40,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:40,019 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b [2022-02-20 19:59:40,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:40,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:40,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:40,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:40,253 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:40,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:40,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e81d0d52/41c29f84efd2430996d93c1828bcb8a9/FLAG43a6f108b [2022-02-20 19:59:40,710 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:40,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:40,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e81d0d52/41c29f84efd2430996d93c1828bcb8a9/FLAG43a6f108b [2022-02-20 19:59:41,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e81d0d52/41c29f84efd2430996d93c1828bcb8a9 [2022-02-20 19:59:41,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:41,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:41,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:41,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:41,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:41,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fbcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41, skipping insertion in model container [2022-02-20 19:59:41,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:41,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:41,254 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-2+token_ring.08.cil-1.c[914,927] [2022-02-20 19:59:41,333 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-2+token_ring.08.cil-1.c[7125,7138] [2022-02-20 19:59:41,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:41,407 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:41,415 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-2+token_ring.08.cil-1.c[914,927] [2022-02-20 19:59:41,428 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-2+token_ring.08.cil-1.c[7125,7138] [2022-02-20 19:59:41,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:41,485 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:41,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41 WrapperNode [2022-02-20 19:59:41,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:41,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:41,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:41,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:41,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,577 INFO L137 Inliner]: procedures = 70, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 778 [2022-02-20 19:59:41,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:41,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:41,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:41,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:41,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:41,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:41,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:41,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:41,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (1/1) ... [2022-02-20 19:59:41,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:41,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:41,702 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:41,703 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:41,703 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:41,703 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:41,706 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:41,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:41,706 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:41,800 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:41,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:42,484 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:42,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:42,496 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-02-20 19:59:42,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:42 BoogieIcfgContainer [2022-02-20 19:59:42,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:42,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:42,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:42,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:42,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:41" (1/3) ... [2022-02-20 19:59:42,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:42, skipping insertion in model container [2022-02-20 19:59:42,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:41" (2/3) ... [2022-02-20 19:59:42,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:42, skipping insertion in model container [2022-02-20 19:59:42,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:42" (3/3) ... [2022-02-20 19:59:42,503 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2022-02-20 19:59:42,506 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:42,506 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:42,543 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:42,547 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:42,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 19:59:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:42,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:42,579 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] [2022-02-20 19:59:42,580 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:42,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1531446909, now seen corresponding path program 1 times [2022-02-20 19:59:42,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:42,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405919596] [2022-02-20 19:59:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:42,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:42,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:42,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:59:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:42,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {387#true} is VALID [2022-02-20 19:59:42,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1; {387#true} is VALID [2022-02-20 19:59:42,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#true} assume 0bv32 != main_#t~nondet42#1;havoc main_#t~nondet42#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {398#(= (_ bv2 32) ~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 := 0bv32; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,998 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {398#(= (_ bv2 32) ~q_read_ev~0)} #1437#return; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {398#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,000 INFO L272 TraceCheckUtils]: 12: Hoare triple {398#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:43,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {433#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:43,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {433#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {433#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:43,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {433#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {433#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:43,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {433#(= |old(~q_read_ev~0)| (_ bv0 32))} {398#(= (_ bv2 32) ~q_read_ev~0)} #1439#return; {388#false} is VALID [2022-02-20 19:59:43,004 INFO L272 TraceCheckUtils]: 17: Hoare triple {388#false} call activate_threads1(); {388#false} is VALID [2022-02-20 19:59:43,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {388#false} havoc ~tmp~1;havoc ~tmp___0~1; {388#false} is VALID [2022-02-20 19:59:43,004 INFO L272 TraceCheckUtils]: 19: Hoare triple {388#false} call #t~ret8 := is_do_write_p_triggered(); {388#false} is VALID [2022-02-20 19:59:43,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {388#false} havoc ~__retres1~0; {388#false} is VALID [2022-02-20 19:59:43,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {388#false} assume !(1bv32 == ~p_dw_pc~0); {388#false} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {388#false} ~__retres1~0 := 0bv32; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {388#false} #res := ~__retres1~0; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {388#false} assume true; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {388#false} {388#false} #1433#return; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {388#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {388#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {388#false} is VALID [2022-02-20 19:59:43,005 INFO L272 TraceCheckUtils]: 28: Hoare triple {388#false} call #t~ret9 := is_do_read_c_triggered(); {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {388#false} havoc ~__retres1~1; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {388#false} assume 1bv32 == ~c_dr_pc~0; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {388#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {388#false} #res := ~__retres1~1; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {388#false} assume true; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {388#false} {388#false} #1435#return; {388#false} is VALID [2022-02-20 19:59:43,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {388#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {388#false} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {388#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {388#false} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {388#false} assume true; {388#false} is VALID [2022-02-20 19:59:43,007 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {388#false} {388#false} #1441#return; {388#false} is VALID [2022-02-20 19:59:43,007 INFO L272 TraceCheckUtils]: 39: Hoare triple {388#false} call reset_delta_events1(); {388#false} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {388#false} assume !(1bv32 == ~q_read_ev~0); {388#false} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {388#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {388#false} is VALID [2022-02-20 19:59:43,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {388#false} assume true; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {388#false} {388#false} #1443#return; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {388#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L272 TraceCheckUtils]: 47: Hoare triple {388#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {388#false} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {388#false} havoc ~__retres1~2; {388#false} is VALID [2022-02-20 19:59:43,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {388#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {388#false} #res := ~__retres1~2; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {388#false} assume true; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {388#false} {388#false} #1445#return; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {388#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {388#false} assume 0bv32 != eval1_~tmp___1~0#1; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {388#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {388#false} is VALID [2022-02-20 19:59:43,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {388#false} assume !(0bv32 != eval1_~tmp~2#1); {388#false} is VALID [2022-02-20 19:59:43,009 INFO L272 TraceCheckUtils]: 57: Hoare triple {388#false} call error1(); {388#false} is VALID [2022-02-20 19:59:43,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {388#false} assume !false; {388#false} is VALID [2022-02-20 19:59:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:43,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:43,011 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:43,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405919596] [2022-02-20 19:59:43,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405919596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:43,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:43,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:43,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148898445] [2022-02-20 19:59:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:43,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:43,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:43,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:43,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:43,085 INFO L87 Difference]: Start difference. First operand has 384 states, 330 states have (on average 1.621212121212121) internal successors, (535), 337 states have internal predecessors, (535), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,188 INFO L93 Difference]: Finished difference Result 848 states and 1340 transitions. [2022-02-20 19:59:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2022-02-20 19:59:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2022-02-20 19:59:45,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1340 transitions. [2022-02-20 19:59:46,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1340 edges. 1340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,240 INFO L225 Difference]: With dead ends: 848 [2022-02-20 19:59:46,240 INFO L226 Difference]: Without dead ends: 478 [2022-02-20 19:59:46,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:46,248 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 398 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:46,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 1489 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-02-20 19:59:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2022-02-20 19:59:46,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:46,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 478 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:46,301 INFO L74 IsIncluded]: Start isIncluded. First operand 478 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:46,302 INFO L87 Difference]: Start difference. First operand 478 states. Second operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,322 INFO L93 Difference]: Finished difference Result 478 states and 705 transitions. [2022-02-20 19:59:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 705 transitions. [2022-02-20 19:59:46,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 478 states. [2022-02-20 19:59:46,328 INFO L87 Difference]: Start difference. First operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) Second operand 478 states. [2022-02-20 19:59:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,345 INFO L93 Difference]: Finished difference Result 478 states and 705 transitions. [2022-02-20 19:59:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 705 transitions. [2022-02-20 19:59:46,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:46,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 405 states have internal predecessors, (598), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2022-02-20 19:59:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 696 transitions. [2022-02-20 19:59:46,366 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 696 transitions. Word has length 59 [2022-02-20 19:59:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:46,366 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 696 transitions. [2022-02-20 19:59:46,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 696 transitions. [2022-02-20 19:59:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:46,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:46,368 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] [2022-02-20 19:59:46,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:46,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:46,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 396825793, now seen corresponding path program 1 times [2022-02-20 19:59:46,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:46,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141632750] [2022-02-20 19:59:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:46,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:46,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:59:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:46,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3285#true} is VALID [2022-02-20 19:59:46,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1; {3285#true} is VALID [2022-02-20 19:59:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} assume 0bv32 != main_#t~nondet42#1;havoc main_#t~nondet42#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {3296#(= (_ bv2 32) ~q_write_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 := 0bv32; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,872 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {3296#(= (_ bv2 32) ~q_write_ev~0)} #1437#return; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {3296#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {3296#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:46,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {3303#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {3334#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:46,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {3334#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {3334#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:46,890 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3334#(= |old(~q_write_ev~0)| (_ bv0 32))} {3296#(= (_ bv2 32) ~q_write_ev~0)} #1439#return; {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L272 TraceCheckUtils]: 17: Hoare triple {3286#false} call activate_threads1(); {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {3286#false} havoc ~tmp~1;havoc ~tmp___0~1; {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L272 TraceCheckUtils]: 19: Hoare triple {3286#false} call #t~ret8 := is_do_write_p_triggered(); {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {3286#false} havoc ~__retres1~0; {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {3286#false} assume !(1bv32 == ~p_dw_pc~0); {3286#false} is VALID [2022-02-20 19:59:46,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {3286#false} ~__retres1~0 := 0bv32; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {3286#false} #res := ~__retres1~0; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {3286#false} assume true; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3286#false} {3286#false} #1433#return; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {3286#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {3286#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L272 TraceCheckUtils]: 28: Hoare triple {3286#false} call #t~ret9 := is_do_read_c_triggered(); {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {3286#false} havoc ~__retres1~1; {3286#false} is VALID [2022-02-20 19:59:46,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {3286#false} assume 1bv32 == ~c_dr_pc~0; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {3286#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {3286#false} #res := ~__retres1~1; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#false} assume true; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3286#false} {3286#false} #1435#return; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {3286#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {3286#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {3286#false} assume true; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3286#false} {3286#false} #1441#return; {3286#false} is VALID [2022-02-20 19:59:46,892 INFO L272 TraceCheckUtils]: 39: Hoare triple {3286#false} call reset_delta_events1(); {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#false} assume !(1bv32 == ~q_read_ev~0); {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {3286#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {3286#false} assume true; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3286#false} {3286#false} #1443#return; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {3286#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L272 TraceCheckUtils]: 47: Hoare triple {3286#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3286#false} is VALID [2022-02-20 19:59:46,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {3286#false} havoc ~__retres1~2; {3286#false} is VALID [2022-02-20 19:59:46,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {3286#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3286#false} is VALID [2022-02-20 19:59:46,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {3286#false} #res := ~__retres1~2; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {3286#false} assume true; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3286#false} {3286#false} #1445#return; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {3286#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {3286#false} assume 0bv32 != eval1_~tmp___1~0#1; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {3286#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {3286#false} assume !(0bv32 != eval1_~tmp~2#1); {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L272 TraceCheckUtils]: 57: Hoare triple {3286#false} call error1(); {3286#false} is VALID [2022-02-20 19:59:46,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 19:59:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:46,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:46,898 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:46,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141632750] [2022-02-20 19:59:46,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141632750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:46,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638078394] [2022-02-20 19:59:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:46,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:46,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:46,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:46,939 INFO L87 Difference]: Start difference. First operand 470 states and 696 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,877 INFO L93 Difference]: Finished difference Result 864 states and 1252 transitions. [2022-02-20 19:59:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:48,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 833 transitions. [2022-02-20 19:59:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 833 transitions. [2022-02-20 19:59:48,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 833 transitions. [2022-02-20 19:59:49,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 833 edges. 833 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:49,438 INFO L225 Difference]: With dead ends: 864 [2022-02-20 19:59:49,438 INFO L226 Difference]: Without dead ends: 684 [2022-02-20 19:59:49,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:49,441 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 385 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:49,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 1419 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-02-20 19:59:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 675. [2022-02-20 19:59:49,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:49,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 684 states. Second operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) [2022-02-20 19:59:49,488 INFO L74 IsIncluded]: Start isIncluded. First operand 684 states. Second operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) [2022-02-20 19:59:49,489 INFO L87 Difference]: Start difference. First operand 684 states. Second operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) [2022-02-20 19:59:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,510 INFO L93 Difference]: Finished difference Result 684 states and 986 transitions. [2022-02-20 19:59:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 986 transitions. [2022-02-20 19:59:49,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:49,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:49,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) Second operand 684 states. [2022-02-20 19:59:49,515 INFO L87 Difference]: Start difference. First operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) Second operand 684 states. [2022-02-20 19:59:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,535 INFO L93 Difference]: Finished difference Result 684 states and 986 transitions. [2022-02-20 19:59:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 986 transitions. [2022-02-20 19:59:49,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:49,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:49,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:49,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 559 states have (on average 1.4561717352415027) internal successors, (814), 574 states have internal predecessors, (814), 70 states have call successors, (70), 35 states have call predecessors, (70), 44 states have return successors, (92), 70 states have call predecessors, (92), 67 states have call successors, (92) [2022-02-20 19:59:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 976 transitions. [2022-02-20 19:59:49,562 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 976 transitions. Word has length 59 [2022-02-20 19:59:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:49,563 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 976 transitions. [2022-02-20 19:59:49,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 976 transitions. [2022-02-20 19:59:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:49,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:49,571 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] [2022-02-20 19:59:49,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:49,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:49,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1675507262, now seen corresponding path program 1 times [2022-02-20 19:59:49,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:49,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519491448] [2022-02-20 19:59:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:49,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:49,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:49,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:49,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 19:59:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:49,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:49,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {6906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {6906#true} is VALID [2022-02-20 19:59:49,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1; {6906#true} is VALID [2022-02-20 19:59:49,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6906#true} assume 0bv32 != main_#t~nondet42#1;havoc main_#t~nondet42#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {6906#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 := 0bv32; {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {6906#true} call update_channels1(); {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {6906#true} assume !(1bv32 == ~q_req_up~0); {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6906#true} {6906#true} #1437#return; {6906#true} is VALID [2022-02-20 19:59:49,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {6906#true} assume { :begin_inline_init_threads1 } true; {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {6906#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {6906#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {6906#true} assume { :end_inline_init_threads1 } true; {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L272 TraceCheckUtils]: 12: Hoare triple {6906#true} call fire_delta_events1(); {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {6906#true} assume !(0bv32 == ~q_read_ev~0); {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {6906#true} assume !(0bv32 == ~q_write_ev~0); {6906#true} is VALID [2022-02-20 19:59:49,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {6906#true} assume true; {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6906#true} {6906#true} #1439#return; {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L272 TraceCheckUtils]: 17: Hoare triple {6906#true} call activate_threads1(); {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#true} havoc ~tmp~1;havoc ~tmp___0~1; {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L272 TraceCheckUtils]: 19: Hoare triple {6906#true} call #t~ret8 := is_do_write_p_triggered(); {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {6906#true} havoc ~__retres1~0; {6906#true} is VALID [2022-02-20 19:59:49,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {6906#true} assume !(1bv32 == ~p_dw_pc~0); {6906#true} is VALID [2022-02-20 19:59:49,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {6906#true} ~__retres1~0 := 0bv32; {6977#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:49,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {6977#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {6981#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:49,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {6981#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {6981#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:49,994 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6981#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {6906#true} #1433#return; {6988#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:49,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {6988#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {6992#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:49,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {6992#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L272 TraceCheckUtils]: 28: Hoare triple {6907#false} call #t~ret9 := is_do_read_c_triggered(); {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {6907#false} havoc ~__retres1~1; {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {6907#false} assume !(1bv32 == ~c_dr_pc~0); {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {6907#false} ~__retres1~1 := 0bv32; {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {6907#false} #res := ~__retres1~1; {6907#false} is VALID [2022-02-20 19:59:49,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {6907#false} assume true; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6907#false} {6907#false} #1435#return; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {6907#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {6907#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {6907#false} assume true; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6907#false} {6906#true} #1441#return; {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L272 TraceCheckUtils]: 39: Hoare triple {6907#false} call reset_delta_events1(); {6907#false} is VALID [2022-02-20 19:59:49,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {6907#false} assume !(1bv32 == ~q_read_ev~0); {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {6907#false} assume !(1bv32 == ~q_write_ev~0); {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {6907#false} assume true; {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6907#false} {6907#false} #1443#return; {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {6907#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {6907#false} is VALID [2022-02-20 19:59:49,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L272 TraceCheckUtils]: 47: Hoare triple {6907#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {6907#false} havoc ~__retres1~2; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {6907#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {6907#false} #res := ~__retres1~2; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {6907#false} assume true; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6907#false} {6907#false} #1445#return; {6907#false} is VALID [2022-02-20 19:59:49,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {6907#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {6907#false} assume 0bv32 != eval1_~tmp___1~0#1; {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {6907#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {6907#false} assume !(0bv32 != eval1_~tmp~2#1); {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L272 TraceCheckUtils]: 57: Hoare triple {6907#false} call error1(); {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {6907#false} assume !false; {6907#false} is VALID [2022-02-20 19:59:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:50,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:50,000 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:50,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519491448] [2022-02-20 19:59:50,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519491448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:50,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:50,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:50,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913810322] [2022-02-20 19:59:50,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:50,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:50,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:50,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:50,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:50,038 INFO L87 Difference]: Start difference. First operand 675 states and 976 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,202 INFO L93 Difference]: Finished difference Result 1066 states and 1509 transitions. [2022-02-20 19:59:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:51,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2022-02-20 19:59:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2022-02-20 19:59:51,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 698 transitions. [2022-02-20 19:59:51,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,642 INFO L225 Difference]: With dead ends: 1066 [2022-02-20 19:59:51,643 INFO L226 Difference]: Without dead ends: 695 [2022-02-20 19:59:51,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:51,644 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 7 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:51,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2809 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-02-20 19:59:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 685. [2022-02-20 19:59:51,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) [2022-02-20 19:59:51,662 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) [2022-02-20 19:59:51,663 INFO L87 Difference]: Start difference. First operand 695 states. Second operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) [2022-02-20 19:59:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,682 INFO L93 Difference]: Finished difference Result 695 states and 1000 transitions. [2022-02-20 19:59:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1000 transitions. [2022-02-20 19:59:51,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) Second operand 695 states. [2022-02-20 19:59:51,686 INFO L87 Difference]: Start difference. First operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) Second operand 695 states. [2022-02-20 19:59:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,706 INFO L93 Difference]: Finished difference Result 695 states and 1000 transitions. [2022-02-20 19:59:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1000 transitions. [2022-02-20 19:59:51,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 567 states have (on average 1.4462081128747795) internal successors, (820), 582 states have internal predecessors, (820), 70 states have call successors, (70), 35 states have call predecessors, (70), 46 states have return successors, (94), 72 states have call predecessors, (94), 67 states have call successors, (94) [2022-02-20 19:59:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 984 transitions. [2022-02-20 19:59:51,742 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 984 transitions. Word has length 59 [2022-02-20 19:59:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,742 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 984 transitions. [2022-02-20 19:59:51,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 984 transitions. [2022-02-20 19:59:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:51,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,743 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] [2022-02-20 19:59:51,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:51,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:51,953 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1400747648, now seen corresponding path program 1 times [2022-02-20 19:59:51,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:51,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888841573] [2022-02-20 19:59:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:51,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:51,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 19:59:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:52,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {10828#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {10828#true} is VALID [2022-02-20 19:59:52,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {10828#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet42#1, main_#t~ret43#1, main_#t~ret44#1; {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {10828#true} assume 0bv32 != main_#t~nondet42#1;havoc main_#t~nondet42#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 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {10828#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 := 0bv32; {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {10828#true} call update_channels1(); {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {10828#true} assume !(1bv32 == ~q_req_up~0); {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {10828#true} assume true; {10828#true} is VALID [2022-02-20 19:59:52,184 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10828#true} {10828#true} #1437#return; {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {10828#true} assume { :begin_inline_init_threads1 } true; {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {10828#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {10828#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {10828#true} assume { :end_inline_init_threads1 } true; {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L272 TraceCheckUtils]: 12: Hoare triple {10828#true} call fire_delta_events1(); {10828#true} is VALID [2022-02-20 19:59:52,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {10828#true} assume !(0bv32 == ~q_read_ev~0); {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {10828#true} assume !(0bv32 == ~q_write_ev~0); {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {10828#true} assume true; {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10828#true} {10828#true} #1439#return; {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L272 TraceCheckUtils]: 17: Hoare triple {10828#true} call activate_threads1(); {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {10828#true} havoc ~tmp~1;havoc ~tmp___0~1; {10828#true} is VALID [2022-02-20 19:59:52,186 INFO L272 TraceCheckUtils]: 19: Hoare triple {10828#true} call #t~ret8 := is_do_write_p_triggered(); {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {10828#true} havoc ~__retres1~0; {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {10828#true} assume !(1bv32 == ~p_dw_pc~0); {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {10828#true} ~__retres1~0 := 0bv32; {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {10828#true} #res := ~__retres1~0; {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {10828#true} assume true; {10828#true} is VALID [2022-02-20 19:59:52,187 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10828#true} {10828#true} #1433#return; {10828#true} is VALID [2022-02-20 19:59:52,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {10828#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {10828#true} is VALID [2022-02-20 19:59:52,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {10828#true} assume !(0bv32 != ~tmp~1); {10828#true} is VALID [2022-02-20 19:59:52,188 INFO L272 TraceCheckUtils]: 28: Hoare triple {10828#true} call #t~ret9 := is_do_read_c_triggered(); {10828#true} is VALID [2022-02-20 19:59:52,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {10828#true} havoc ~__retres1~1; {10828#true} is VALID [2022-02-20 19:59:52,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {10828#true} assume !(1bv32 == ~c_dr_pc~0); {10828#true} is VALID [2022-02-20 19:59:52,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {10828#true} ~__retres1~1 := 0bv32; {10926#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:52,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {10926#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {10930#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:52,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {10930#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {10930#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:52,193 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10930#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {10828#true} #1435#return; {10937#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:52,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {10937#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {10941#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:52,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {10941#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {10829#false} is VALID [2022-02-20 19:59:52,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {10829#false} assume true; {10829#false} is VALID [2022-02-20 19:59:52,194 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10829#false} {10828#true} #1441#return; {10829#false} is VALID [2022-02-20 19:59:52,194 INFO L272 TraceCheckUtils]: 39: Hoare triple {10829#false} call reset_delta_events1(); {10829#false} is VALID [2022-02-20 19:59:52,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {10829#false} assume !(1bv32 == ~q_read_ev~0); {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {10829#false} assume !(1bv32 == ~q_write_ev~0); {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {10829#false} assume true; {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10829#false} {10829#false} #1443#return; {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {10829#false} assume !false; {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {10829#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {10829#false} assume !false; {10829#false} is VALID [2022-02-20 19:59:52,195 INFO L272 TraceCheckUtils]: 47: Hoare triple {10829#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {10829#false} havoc ~__retres1~2; {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {10829#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {10829#false} #res := ~__retres1~2; {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {10829#false} assume true; {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10829#false} {10829#false} #1445#return; {10829#false} is VALID [2022-02-20 19:59:52,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {10829#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {10829#false} is VALID [2022-02-20 19:59:52,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {10829#false} assume 0bv32 != eval1_~tmp___1~0#1; {10829#false} is VALID [2022-02-20 19:59:52,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {10829#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {10829#false} is VALID [2022-02-20 19:59:52,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {10829#false} assume !(0bv32 != eval1_~tmp~2#1); {10829#false} is VALID [2022-02-20 19:59:52,197 INFO L272 TraceCheckUtils]: 57: Hoare triple {10829#false} call error1(); {10829#false} is VALID [2022-02-20 19:59:52,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {10829#false} assume !false; {10829#false} is VALID [2022-02-20 19:59:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:52,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:52,198 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:52,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888841573] [2022-02-20 19:59:52,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888841573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:52,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:52,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:52,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234136698] [2022-02-20 19:59:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:52,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:52,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:52,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:52,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:52,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:52,241 INFO L87 Difference]: Start difference. First operand 685 states and 984 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,414 INFO L93 Difference]: Finished difference Result 1080 states and 1515 transitions. [2022-02-20 19:59:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2022-02-20 19:59:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2022-02-20 19:59:53,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 693 transitions. [2022-02-20 19:59:53,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:53,857 INFO L225 Difference]: With dead ends: 1080 [2022-02-20 19:59:53,858 INFO L226 Difference]: Without dead ends: 699 [2022-02-20 19:59:53,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:53,862 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 4 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:53,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2800 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-02-20 19:59:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 695. [2022-02-20 19:59:53,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:53,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) [2022-02-20 19:59:53,886 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) [2022-02-20 19:59:53,887 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) [2022-02-20 19:59:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,905 INFO L93 Difference]: Finished difference Result 699 states and 998 transitions. [2022-02-20 19:59:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 998 transitions. [2022-02-20 19:59:53,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) Second operand 699 states. [2022-02-20 19:59:53,910 INFO L87 Difference]: Start difference. First operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) Second operand 699 states. [2022-02-20 19:59:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,929 INFO L93 Difference]: Finished difference Result 699 states and 998 transitions. [2022-02-20 19:59:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 998 transitions. [2022-02-20 19:59:53,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:53,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 575 states have (on average 1.4365217391304348) internal successors, (826), 590 states have internal predecessors, (826), 70 states have call successors, (70), 35 states have call predecessors, (70), 48 states have return successors, (96), 74 states have call predecessors, (96), 67 states have call successors, (96) [2022-02-20 19:59:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 992 transitions. [2022-02-20 19:59:53,955 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 992 transitions. Word has length 59 [2022-02-20 19:59:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:53,956 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 992 transitions. [2022-02-20 19:59:53,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 992 transitions. [2022-02-20 19:59:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:53,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:53,958 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] [2022-02-20 19:59:53,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:54,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:54,168 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1088781314, now seen corresponding path program 1 times [2022-02-20 19:59:54,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:54,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112837847] [2022-02-20 19:59:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:54,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:54,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:54,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:54,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 19:59:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:54,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:54,389 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:54,389 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:54,391 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:54,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:54,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:54,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:54,603 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:54,605 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:54,667 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:54,668 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:54,670 INFO L158 Benchmark]: Toolchain (without parser) took 13569.92ms. Allocated memory was 52.4MB in the beginning and 142.6MB in the end (delta: 90.2MB). Free memory was 28.7MB in the beginning and 102.4MB in the end (delta: -73.7MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.52ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 34.7MB in the end (delta: -6.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.65ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 45.3MB in the end (delta: -10.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: Boogie Preprocessor took 56.36ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 41.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: RCFGBuilder took 858.87ms. Allocated memory is still 65.0MB. Free memory was 40.8MB in the beginning and 32.9MB in the end (delta: 7.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,671 INFO L158 Benchmark]: TraceAbstraction took 12170.46ms. Allocated memory was 65.0MB in the beginning and 142.6MB in the end (delta: 77.6MB). Free memory was 32.6MB in the beginning and 102.4MB in the end (delta: -69.8MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,672 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.52ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.5MB in the beginning and 34.7MB in the end (delta: -6.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.65ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 45.3MB in the end (delta: -10.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.36ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 41.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 858.87ms. Allocated memory is still 65.0MB. Free memory was 40.8MB in the beginning and 32.9MB in the end (delta: 7.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12170.46ms. Allocated memory was 65.0MB in the beginning and 142.6MB in the end (delta: 77.6MB). Free memory was 32.6MB in the beginning and 102.4MB in the end (delta: -69.8MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:54,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator