./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.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.05.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 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:44,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:44,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:44,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:44,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:44,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:44,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:44,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:44,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:44,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:44,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:44,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:44,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:44,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:44,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:44,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:44,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:44,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:44,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:44,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:44,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:44,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:44,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:44,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:44,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:44,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:44,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:44,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:44,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:44,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:44,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:44,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:44,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:44,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:44,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:44,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:44,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:44,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:44,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:44,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:44,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:44,607 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:58:44,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:44,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:44,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:44,625 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:44,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:44,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:44,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:44,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:44,626 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:44,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:44,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:44,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:44,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:44,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:44,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:44,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:44,629 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:44,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:44,630 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 -> 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 [2022-02-20 19:58:44,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:44,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:44,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:44,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:44,818 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:44,819 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.05.cil-1.c [2022-02-20 19:58:44,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0212096cd/6e2b61e00a634715bdc159c7108da5cd/FLAGbe0a1345d [2022-02-20 19:58:45,229 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:45,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-02-20 19:58:45,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0212096cd/6e2b61e00a634715bdc159c7108da5cd/FLAGbe0a1345d [2022-02-20 19:58:45,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0212096cd/6e2b61e00a634715bdc159c7108da5cd [2022-02-20 19:58:45,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:45,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:45,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:45,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:45,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:45,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa15d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45, skipping insertion in model container [2022-02-20 19:58:45,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:45,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:45,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.05.cil-1.c[914,927] [2022-02-20 19:58:45,450 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.05.cil-1.c[7125,7138] [2022-02-20 19:58:45,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:45,497 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:45,511 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.05.cil-1.c[914,927] [2022-02-20 19:58:45,524 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.05.cil-1.c[7125,7138] [2022-02-20 19:58:45,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:45,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:45,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45 WrapperNode [2022-02-20 19:58:45,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:45,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:45,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:45,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:45,579 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:58:45" (1/1) ... [2022-02-20 19:58:45,588 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:58:45" (1/1) ... [2022-02-20 19:58:45,619 INFO L137 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 635 [2022-02-20 19:58:45,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:45,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:45,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:45,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:45,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:45,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:45,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:45,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:45,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (1/1) ... [2022-02-20 19:58:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:45,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:45,702 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:58:45,703 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:58:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:45,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:45,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:45,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:45,729 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:45,730 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:45,819 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:45,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:46,303 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:46,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:46,312 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 19:58:46,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:46 BoogieIcfgContainer [2022-02-20 19:58:46,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:46,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:46,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:46,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:46,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:45" (1/3) ... [2022-02-20 19:58:46,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b63e429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:46, skipping insertion in model container [2022-02-20 19:58:46,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:45" (2/3) ... [2022-02-20 19:58:46,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b63e429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:46, skipping insertion in model container [2022-02-20 19:58:46,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:46" (3/3) ... [2022-02-20 19:58:46,319 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-02-20 19:58:46,322 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:46,323 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:46,368 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:46,372 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:58:46,373 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:58:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:46,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:46,407 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:58:46,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2022-02-20 19:58:46,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:46,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960894410] [2022-02-20 19:58:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(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); {312#true} is VALID [2022-02-20 19:58:46,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {312#true} {314#(= 1 ~c_dr_i~0)} #1101#return; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(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; {312#true} is VALID [2022-02-20 19:58:46,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {312#true} is VALID [2022-02-20 19:58:46,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#true} {313#false} #1103#return; {313#false} is VALID [2022-02-20 19:58:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} havoc ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume 1 == ~p_dw_pc~0; {312#true} is VALID [2022-02-20 19:58:46,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {312#true} is VALID [2022-02-20 19:58:46,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} #res := ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,743 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {312#true} {312#true} #1097#return; {312#true} is VALID [2022-02-20 19:58:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} havoc ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(1 == ~c_dr_pc~0); {312#true} is VALID [2022-02-20 19:58:46,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} ~__retres1~1 := 0; {312#true} is VALID [2022-02-20 19:58:46,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} #res := ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,752 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {312#true} {312#true} #1099#return; {312#true} is VALID [2022-02-20 19:58:46,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#(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; {312#true} is VALID [2022-02-20 19:58:46,753 INFO L272 TraceCheckUtils]: 1: Hoare triple {312#true} call #t~ret8 := is_do_write_p_triggered(); {312#true} is VALID [2022-02-20 19:58:46,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} havoc ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} assume 1 == ~p_dw_pc~0; {312#true} is VALID [2022-02-20 19:58:46,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {312#true} is VALID [2022-02-20 19:58:46,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} #res := ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,755 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {312#true} {312#true} #1097#return; {312#true} is VALID [2022-02-20 19:58:46,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {312#true} is VALID [2022-02-20 19:58:46,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {312#true} is VALID [2022-02-20 19:58:46,756 INFO L272 TraceCheckUtils]: 10: Hoare triple {312#true} call #t~ret9 := is_do_read_c_triggered(); {312#true} is VALID [2022-02-20 19:58:46,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#true} havoc ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#true} assume !(1 == ~c_dr_pc~0); {312#true} is VALID [2022-02-20 19:58:46,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {312#true} ~__retres1~1 := 0; {312#true} is VALID [2022-02-20 19:58:46,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#true} #res := ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,757 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {312#true} {312#true} #1099#return; {312#true} is VALID [2022-02-20 19:58:46,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {312#true} is VALID [2022-02-20 19:58:46,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {312#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {312#true} is VALID [2022-02-20 19:58:46,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,758 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {312#true} {313#false} #1105#return; {313#false} is VALID [2022-02-20 19:58:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {312#true} is VALID [2022-02-20 19:58:46,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {312#true} is VALID [2022-02-20 19:58:46,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#true} {313#false} #1107#return; {313#false} is VALID [2022-02-20 19:58:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:46,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} havoc ~__retres1~2; {312#true} is VALID [2022-02-20 19:58:46,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {312#true} is VALID [2022-02-20 19:58:46,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} #res := ~__retres1~2; {312#true} is VALID [2022-02-20 19:58:46,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,789 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {312#true} {313#false} #1109#return; {313#false} is VALID [2022-02-20 19:58:46,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {312#true} is VALID [2022-02-20 19:58:46,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {312#true} is VALID [2022-02-20 19:58:46,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#(= 1 ~c_dr_i~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; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(= 1 ~c_dr_i~0)} call update_channels1(); {352#(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:58:46,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(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); {312#true} is VALID [2022-02-20 19:58:46,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,796 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {312#true} {314#(= 1 ~c_dr_i~0)} #1101#return; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {314#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:58:46,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {313#false} is VALID [2022-02-20 19:58:46,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} assume { :end_inline_init_threads1 } true; {313#false} is VALID [2022-02-20 19:58:46,798 INFO L272 TraceCheckUtils]: 12: Hoare triple {313#false} call fire_delta_events1(); {353#(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:58:46,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#(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; {312#true} is VALID [2022-02-20 19:58:46,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {312#true} is VALID [2022-02-20 19:58:46,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,799 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {312#true} {313#false} #1103#return; {313#false} is VALID [2022-02-20 19:58:46,799 INFO L272 TraceCheckUtils]: 17: Hoare triple {313#false} call activate_threads1(); {354#(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:58:46,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {354#(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; {312#true} is VALID [2022-02-20 19:58:46,799 INFO L272 TraceCheckUtils]: 19: Hoare triple {312#true} call #t~ret8 := is_do_write_p_triggered(); {312#true} is VALID [2022-02-20 19:58:46,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {312#true} havoc ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {312#true} assume 1 == ~p_dw_pc~0; {312#true} is VALID [2022-02-20 19:58:46,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {312#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {312#true} is VALID [2022-02-20 19:58:46,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {312#true} #res := ~__retres1~0; {312#true} is VALID [2022-02-20 19:58:46,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,800 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {312#true} {312#true} #1097#return; {312#true} is VALID [2022-02-20 19:58:46,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {312#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {312#true} is VALID [2022-02-20 19:58:46,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {312#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {312#true} is VALID [2022-02-20 19:58:46,801 INFO L272 TraceCheckUtils]: 28: Hoare triple {312#true} call #t~ret9 := is_do_read_c_triggered(); {312#true} is VALID [2022-02-20 19:58:46,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {312#true} havoc ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {312#true} assume !(1 == ~c_dr_pc~0); {312#true} is VALID [2022-02-20 19:58:46,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {312#true} ~__retres1~1 := 0; {312#true} is VALID [2022-02-20 19:58:46,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {312#true} #res := ~__retres1~1; {312#true} is VALID [2022-02-20 19:58:46,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,802 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {312#true} {312#true} #1099#return; {312#true} is VALID [2022-02-20 19:58:46,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {312#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {312#true} is VALID [2022-02-20 19:58:46,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {312#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {312#true} is VALID [2022-02-20 19:58:46,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,803 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {312#true} {313#false} #1105#return; {313#false} is VALID [2022-02-20 19:58:46,803 INFO L272 TraceCheckUtils]: 39: Hoare triple {313#false} call reset_delta_events1(); {353#(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:58:46,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {353#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {312#true} is VALID [2022-02-20 19:58:46,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {312#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {312#true} is VALID [2022-02-20 19:58:46,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,804 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {312#true} {313#false} #1107#return; {313#false} is VALID [2022-02-20 19:58:46,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:58:46,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {313#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; {313#false} is VALID [2022-02-20 19:58:46,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:58:46,805 INFO L272 TraceCheckUtils]: 47: Hoare triple {313#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {312#true} is VALID [2022-02-20 19:58:46,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {312#true} havoc ~__retres1~2; {312#true} is VALID [2022-02-20 19:58:46,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {312#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {312#true} is VALID [2022-02-20 19:58:46,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {312#true} #res := ~__retres1~2; {312#true} is VALID [2022-02-20 19:58:46,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 19:58:46,807 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {312#true} {313#false} #1109#return; {313#false} is VALID [2022-02-20 19:58:46,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {313#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; {313#false} is VALID [2022-02-20 19:58:46,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {313#false} assume 0 != eval1_~tmp___1~0#1; {313#false} is VALID [2022-02-20 19:58:46,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {313#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; {313#false} is VALID [2022-02-20 19:58:46,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {313#false} assume !(0 != eval1_~tmp~2#1); {313#false} is VALID [2022-02-20 19:58:46,808 INFO L272 TraceCheckUtils]: 57: Hoare triple {313#false} call error1(); {313#false} is VALID [2022-02-20 19:58:46,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:58:46,809 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:58:46,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:46,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960894410] [2022-02-20 19:58:46,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960894410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:46,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:46,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:46,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437499113] [2022-02-20 19:58:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:46,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:58:46,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:46,820 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), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:46,867 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:58:46,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:46,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:46,889 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,217 INFO L93 Difference]: Finished difference Result 615 states and 953 transitions. [2022-02-20 19:58:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:58:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:58:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2022-02-20 19:58:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2022-02-20 19:58:48,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 953 transitions. [2022-02-20 19:58:48,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,892 INFO L225 Difference]: With dead ends: 615 [2022-02-20 19:58:48,892 INFO L226 Difference]: Without dead ends: 317 [2022-02-20 19:58:48,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:48,898 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 647 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:48,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 1002 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-02-20 19:58:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 299. [2022-02-20 19:58:48,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:58:48,934 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:58:48,936 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:58:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,949 INFO L93 Difference]: Finished difference Result 317 states and 468 transitions. [2022-02-20 19:58:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2022-02-20 19:58:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 317 states. [2022-02-20 19:58:48,954 INFO L87 Difference]: Start difference. First operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 317 states. [2022-02-20 19:58:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,966 INFO L93 Difference]: Finished difference Result 317 states and 468 transitions. [2022-02-20 19:58:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2022-02-20 19:58:48,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:58:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2022-02-20 19:58:48,990 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2022-02-20 19:58:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,990 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2022-02-20 19:58:48,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-02-20 19:58:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:48,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,994 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:58:48,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:48,995 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2022-02-20 19:58:48,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820981538] [2022-02-20 19:58:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2286#(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); {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:49,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:49,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2248#(= ~q_read_ev~0 2)} #1101#return; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {2288#(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; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {2289#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {2289#(= |old(~q_read_ev~0)| 0)} assume true; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2289#(= |old(~q_read_ev~0)| 0)} {2248#(= ~q_read_ev~0 2)} #1103#return; {2247#false} is VALID [2022-02-20 19:58:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {2246#true} havoc ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2246#true} assume 1 == ~p_dw_pc~0; {2246#true} is VALID [2022-02-20 19:58:49,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2246#true} is VALID [2022-02-20 19:58:49,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {2246#true} #res := ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,095 INFO L290 TraceCheckUtils]: 4: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,095 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2246#true} {2246#true} #1097#return; {2246#true} is VALID [2022-02-20 19:58:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {2246#true} havoc ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2246#true} assume !(1 == ~c_dr_pc~0); {2246#true} is VALID [2022-02-20 19:58:49,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} ~__retres1~1 := 0; {2246#true} is VALID [2022-02-20 19:58:49,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {2246#true} #res := ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,099 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2246#true} {2246#true} #1099#return; {2246#true} is VALID [2022-02-20 19:58:49,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {2290#(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; {2246#true} is VALID [2022-02-20 19:58:49,099 INFO L272 TraceCheckUtils]: 1: Hoare triple {2246#true} call #t~ret8 := is_do_write_p_triggered(); {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} havoc ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {2246#true} assume 1 == ~p_dw_pc~0; {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {2246#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {2246#true} #res := ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,100 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2246#true} {2246#true} #1097#return; {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2246#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L272 TraceCheckUtils]: 10: Hoare triple {2246#true} call #t~ret9 := is_do_read_c_triggered(); {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {2246#true} havoc ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {2246#true} assume !(1 == ~c_dr_pc~0); {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {2246#true} ~__retres1~1 := 0; {2246#true} is VALID [2022-02-20 19:58:49,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {2246#true} #res := ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2246#true} {2246#true} #1099#return; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {2246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {2246#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,102 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2246#true} {2247#false} #1105#return; {2247#false} is VALID [2022-02-20 19:58:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {2288#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2246#true} is VALID [2022-02-20 19:58:49,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {2246#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2246#true} is VALID [2022-02-20 19:58:49,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2246#true} {2247#false} #1107#return; {2247#false} is VALID [2022-02-20 19:58:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {2246#true} havoc ~__retres1~2; {2246#true} is VALID [2022-02-20 19:58:49,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2246#true} is VALID [2022-02-20 19:58:49,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} #res := ~__retres1~2; {2246#true} is VALID [2022-02-20 19:58:49,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,112 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2246#true} {2247#false} #1109#return; {2247#false} is VALID [2022-02-20 19:58:49,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {2246#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {2246#true} is VALID [2022-02-20 19:58:49,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {2246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {2246#true} is VALID [2022-02-20 19:58:49,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {2246#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {2248#(= ~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; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2248#(= ~q_read_ev~0 2)} call update_channels1(); {2286#(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:58:49,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {2286#(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); {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:49,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:49,115 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2287#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2248#(= ~q_read_ev~0 2)} #1101#return; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {2248#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {2248#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {2248#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {2248#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2248#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:49,117 INFO L272 TraceCheckUtils]: 12: Hoare triple {2248#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2288#(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:58:49,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {2288#(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; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2289#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2289#(= |old(~q_read_ev~0)| 0)} assume true; {2289#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:49,118 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2289#(= |old(~q_read_ev~0)| 0)} {2248#(= ~q_read_ev~0 2)} #1103#return; {2247#false} is VALID [2022-02-20 19:58:49,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {2247#false} call activate_threads1(); {2290#(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:58:49,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {2290#(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; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L272 TraceCheckUtils]: 19: Hoare triple {2246#true} call #t~ret8 := is_do_write_p_triggered(); {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {2246#true} havoc ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#true} assume 1 == ~p_dw_pc~0; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {2246#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {2246#true} #res := ~__retres1~0; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,119 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2246#true} {2246#true} #1097#return; {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {2246#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {2246#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L272 TraceCheckUtils]: 28: Hoare triple {2246#true} call #t~ret9 := is_do_read_c_triggered(); {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {2246#true} havoc ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {2246#true} assume !(1 == ~c_dr_pc~0); {2246#true} is VALID [2022-02-20 19:58:49,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {2246#true} ~__retres1~1 := 0; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {2246#true} #res := ~__retres1~1; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2246#true} {2246#true} #1099#return; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {2246#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {2246#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,121 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2246#true} {2247#false} #1105#return; {2247#false} is VALID [2022-02-20 19:58:49,122 INFO L272 TraceCheckUtils]: 39: Hoare triple {2247#false} call reset_delta_events1(); {2288#(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:58:49,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {2288#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2246#true} is VALID [2022-02-20 19:58:49,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {2246#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2246#true} is VALID [2022-02-20 19:58:49,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,122 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2246#true} {2247#false} #1107#return; {2247#false} is VALID [2022-02-20 19:58:49,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {2247#false} assume !false; {2247#false} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {2247#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; {2247#false} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {2247#false} assume !false; {2247#false} is VALID [2022-02-20 19:58:49,123 INFO L272 TraceCheckUtils]: 47: Hoare triple {2247#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2246#true} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {2246#true} havoc ~__retres1~2; {2246#true} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {2246#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2246#true} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {2246#true} #res := ~__retres1~2; {2246#true} is VALID [2022-02-20 19:58:49,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {2246#true} assume true; {2246#true} is VALID [2022-02-20 19:58:49,124 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2246#true} {2247#false} #1109#return; {2247#false} is VALID [2022-02-20 19:58:49,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {2247#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; {2247#false} is VALID [2022-02-20 19:58:49,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {2247#false} assume 0 != eval1_~tmp___1~0#1; {2247#false} is VALID [2022-02-20 19:58:49,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {2247#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; {2247#false} is VALID [2022-02-20 19:58:49,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {2247#false} assume !(0 != eval1_~tmp~2#1); {2247#false} is VALID [2022-02-20 19:58:49,124 INFO L272 TraceCheckUtils]: 57: Hoare triple {2247#false} call error1(); {2247#false} is VALID [2022-02-20 19:58:49,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {2247#false} assume !false; {2247#false} is VALID [2022-02-20 19:58:49,125 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:58:49,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:49,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820981538] [2022-02-20 19:58:49,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820981538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:49,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:49,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:49,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111787547] [2022-02-20 19:58:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:49,127 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:58:49,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:49,128 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:58:49,178 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:58:49,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:49,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:49,181 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. 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:58:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,132 INFO L93 Difference]: Finished difference Result 524 states and 756 transitions. [2022-02-20 19:58:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:51,133 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:58:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:51,133 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:58:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 756 transitions. [2022-02-20 19:58:51,142 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:58:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 756 transitions. [2022-02-20 19:58:51,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 756 transitions. [2022-02-20 19:58:51,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:51,644 INFO L225 Difference]: With dead ends: 524 [2022-02-20 19:58:51,644 INFO L226 Difference]: Without dead ends: 435 [2022-02-20 19:58:51,648 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:58:51,650 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 765 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:51,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1248 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:58:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-02-20 19:58:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2022-02-20 19:58:51,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:51,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:58:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:58:51,676 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:58:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,689 INFO L93 Difference]: Finished difference Result 435 states and 626 transitions. [2022-02-20 19:58:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 626 transitions. [2022-02-20 19:58:51,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 435 states. [2022-02-20 19:58:51,693 INFO L87 Difference]: Start difference. First operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 435 states. [2022-02-20 19:58:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,722 INFO L93 Difference]: Finished difference Result 435 states and 626 transitions. [2022-02-20 19:58:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 626 transitions. [2022-02-20 19:58:51,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:51,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:58:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2022-02-20 19:58:51,737 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2022-02-20 19:58:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:51,738 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2022-02-20 19:58:51,738 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:58:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2022-02-20 19:58:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:51,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:51,739 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:58:51,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:51,739 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2022-02-20 19:58:51,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:51,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203149929] [2022-02-20 19:58:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {4480#(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); {4481#(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:58:51,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {4481#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4481#(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:58:51,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4481#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4442#(= ~q_write_ev~0 ~q_read_ev~0)} #1101#return; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {4481#(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); {4482#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {4482#(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; {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4442#(= ~q_write_ev~0 ~q_read_ev~0)} #1103#return; {4441#false} is VALID [2022-02-20 19:58:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {4440#true} havoc ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {4440#true} assume !(1 == ~p_dw_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} ~__retres1~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {4440#true} #res := ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,841 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4440#true} {4440#true} #1097#return; {4440#true} is VALID [2022-02-20 19:58:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {4440#true} havoc ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {4440#true} assume !(1 == ~c_dr_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} ~__retres1~1 := 0; {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {4440#true} #res := ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4440#true} {4440#true} #1099#return; {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {4484#(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; {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L272 TraceCheckUtils]: 1: Hoare triple {4440#true} call #t~ret8 := is_do_write_p_triggered(); {4440#true} is VALID [2022-02-20 19:58:51,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} havoc ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {4440#true} assume !(1 == ~p_dw_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {4440#true} ~__retres1~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {4440#true} #res := ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4440#true} {4440#true} #1097#return; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {4440#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {4440#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L272 TraceCheckUtils]: 10: Hoare triple {4440#true} call #t~ret9 := is_do_read_c_triggered(); {4440#true} is VALID [2022-02-20 19:58:51,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {4440#true} havoc ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {4440#true} assume !(1 == ~c_dr_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4440#true} ~__retres1~1 := 0; {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4440#true} #res := ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4440#true} {4440#true} #1099#return; {4440#true} is VALID [2022-02-20 19:58:51,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4440#true} is VALID [2022-02-20 19:58:51,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,848 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4440#true} {4441#false} #1105#return; {4441#false} is VALID [2022-02-20 19:58:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {4481#(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); {4440#true} is VALID [2022-02-20 19:58:51,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {4440#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4440#true} is VALID [2022-02-20 19:58:51,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4440#true} {4441#false} #1107#return; {4441#false} is VALID [2022-02-20 19:58:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {4440#true} havoc ~__retres1~2; {4440#true} is VALID [2022-02-20 19:58:51,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {4440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4440#true} is VALID [2022-02-20 19:58:51,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} #res := ~__retres1~2; {4440#true} is VALID [2022-02-20 19:58:51,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,855 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4440#true} {4441#false} #1109#return; {4441#false} is VALID [2022-02-20 19:58:51,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4440#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4440#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {4440#true} is VALID [2022-02-20 19:58:51,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4440#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {4442#(= ~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; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {4480#(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:58:51,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {4480#(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); {4481#(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:58:51,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {4481#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4481#(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:58:51,858 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4481#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4442#(= ~q_write_ev~0 ~q_read_ev~0)} #1101#return; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {4442#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:51,860 INFO L272 TraceCheckUtils]: 12: Hoare triple {4442#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {4481#(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:58:51,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {4481#(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); {4482#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4482#(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; {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:51,861 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4483#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4442#(= ~q_write_ev~0 ~q_read_ev~0)} #1103#return; {4441#false} is VALID [2022-02-20 19:58:51,861 INFO L272 TraceCheckUtils]: 17: Hoare triple {4441#false} call activate_threads1(); {4484#(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:58:51,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {4484#(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; {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {4440#true} call #t~ret8 := is_do_write_p_triggered(); {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#true} havoc ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {4440#true} assume !(1 == ~p_dw_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#true} ~__retres1~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#true} #res := ~__retres1~0; {4440#true} is VALID [2022-02-20 19:58:51,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4440#true} {4440#true} #1097#return; {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {4440#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {4440#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L272 TraceCheckUtils]: 28: Hoare triple {4440#true} call #t~ret9 := is_do_read_c_triggered(); {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {4440#true} havoc ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {4440#true} assume !(1 == ~c_dr_pc~0); {4440#true} is VALID [2022-02-20 19:58:51,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {4440#true} ~__retres1~1 := 0; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {4440#true} #res := ~__retres1~1; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4440#true} {4440#true} #1099#return; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {4440#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {4440#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,864 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4440#true} {4441#false} #1105#return; {4441#false} is VALID [2022-02-20 19:58:51,865 INFO L272 TraceCheckUtils]: 39: Hoare triple {4441#false} call reset_delta_events1(); {4481#(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:58:51,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {4481#(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); {4440#true} is VALID [2022-02-20 19:58:51,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {4440#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4440#true} is VALID [2022-02-20 19:58:51,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,865 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4440#true} {4441#false} #1107#return; {4441#false} is VALID [2022-02-20 19:58:51,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {4441#false} assume !false; {4441#false} is VALID [2022-02-20 19:58:51,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {4441#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; {4441#false} is VALID [2022-02-20 19:58:51,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {4441#false} assume !false; {4441#false} is VALID [2022-02-20 19:58:51,866 INFO L272 TraceCheckUtils]: 47: Hoare triple {4441#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4440#true} is VALID [2022-02-20 19:58:51,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {4440#true} havoc ~__retres1~2; {4440#true} is VALID [2022-02-20 19:58:51,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {4440#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4440#true} is VALID [2022-02-20 19:58:51,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {4440#true} #res := ~__retres1~2; {4440#true} is VALID [2022-02-20 19:58:51,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {4440#true} assume true; {4440#true} is VALID [2022-02-20 19:58:51,866 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4440#true} {4441#false} #1109#return; {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {4441#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; {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {4441#false} assume 0 != eval1_~tmp___1~0#1; {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {4441#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; {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L290 TraceCheckUtils]: 56: Hoare triple {4441#false} assume !(0 != eval1_~tmp~2#1); {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L272 TraceCheckUtils]: 57: Hoare triple {4441#false} call error1(); {4441#false} is VALID [2022-02-20 19:58:51,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {4441#false} assume !false; {4441#false} is VALID [2022-02-20 19:58:51,868 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:58:51,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203149929] [2022-02-20 19:58:51,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203149929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:51,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:51,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:51,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644323120] [2022-02-20 19:58:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:51,869 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:58:51,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:51,870 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:58:51,898 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:58:51,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:51,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:51,900 INFO L87 Difference]: Start difference. First operand 395 states and 571 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:58:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,472 INFO L93 Difference]: Finished difference Result 744 states and 1049 transitions. [2022-02-20 19:58:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:54,472 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:58:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:54,474 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:58:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 779 transitions. [2022-02-20 19:58:54,484 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:58:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 779 transitions. [2022-02-20 19:58:54,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 779 transitions. [2022-02-20 19:58:54,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:55,005 INFO L225 Difference]: With dead ends: 744 [2022-02-20 19:58:55,006 INFO L226 Difference]: Without dead ends: 566 [2022-02-20 19:58:55,006 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:58:55,007 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 878 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:55,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 1743 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-02-20 19:58:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 491. [2022-02-20 19:58:55,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:55,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:58:55,026 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:58:55,027 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:58:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,042 INFO L93 Difference]: Finished difference Result 566 states and 808 transitions. [2022-02-20 19:58:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 808 transitions. [2022-02-20 19:58:55,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) Second operand 566 states. [2022-02-20 19:58:55,046 INFO L87 Difference]: Start difference. First operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) Second operand 566 states. [2022-02-20 19:58:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,061 INFO L93 Difference]: Finished difference Result 566 states and 808 transitions. [2022-02-20 19:58:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 808 transitions. [2022-02-20 19:58:55,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:55,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:58:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 704 transitions. [2022-02-20 19:58:55,078 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 704 transitions. Word has length 59 [2022-02-20 19:58:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:55,078 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 704 transitions. [2022-02-20 19:58:55,079 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:58:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 704 transitions. [2022-02-20 19:58:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:55,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:55,080 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:58:55,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:55,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1661601801, now seen corresponding path program 1 times [2022-02-20 19:58:55,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:55,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653784014] [2022-02-20 19:58:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {7364#(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); {7325#true} is VALID [2022-02-20 19:58:55,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7325#true} {7325#true} #1101#return; {7325#true} is VALID [2022-02-20 19:58:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {7365#(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); {7325#true} is VALID [2022-02-20 19:58:55,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume !(0 == ~q_write_ev~0); {7325#true} is VALID [2022-02-20 19:58:55,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7325#true} {7325#true} #1103#return; {7325#true} is VALID [2022-02-20 19:58:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {7325#true} havoc ~__retres1~0; {7325#true} is VALID [2022-02-20 19:58:55,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume !(1 == ~p_dw_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} ~__retres1~0 := 0; {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:55,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,181 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7325#true} #1097#return; {7373#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {7325#true} havoc ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume !(1 == ~c_dr_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} ~__retres1~1 := 0; {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {7325#true} #res := ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7325#true} {7326#false} #1099#return; {7326#false} is VALID [2022-02-20 19:58:55,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {7366#(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; {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L272 TraceCheckUtils]: 1: Hoare triple {7325#true} call #t~ret8 := is_do_write_p_triggered(); {7325#true} is VALID [2022-02-20 19:58:55,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} havoc ~__retres1~0; {7325#true} is VALID [2022-02-20 19:58:55,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {7325#true} assume !(1 == ~p_dw_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {7325#true} ~__retres1~0 := 0; {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:55,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,188 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7325#true} #1097#return; {7373#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:55,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {7373#(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; {7374#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:55,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {7374#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7326#false} is VALID [2022-02-20 19:58:55,189 INFO L272 TraceCheckUtils]: 10: Hoare triple {7326#false} call #t~ret9 := is_do_read_c_triggered(); {7325#true} is VALID [2022-02-20 19:58:55,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {7325#true} havoc ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {7325#true} assume !(1 == ~c_dr_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {7325#true} ~__retres1~1 := 0; {7325#true} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#true} #res := ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,190 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7325#true} {7326#false} #1099#return; {7326#false} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {7326#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7326#false} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {7326#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7326#false} is VALID [2022-02-20 19:58:55,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {7326#false} assume true; {7326#false} is VALID [2022-02-20 19:58:55,190 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7326#false} {7325#true} #1105#return; {7326#false} is VALID [2022-02-20 19:58:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {7365#(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); {7325#true} is VALID [2022-02-20 19:58:55,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7325#true} is VALID [2022-02-20 19:58:55,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7325#true} {7326#false} #1107#return; {7326#false} is VALID [2022-02-20 19:58:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {7325#true} havoc ~__retres1~2; {7325#true} is VALID [2022-02-20 19:58:55,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7325#true} is VALID [2022-02-20 19:58:55,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} #res := ~__retres1~2; {7325#true} is VALID [2022-02-20 19:58:55,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,207 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7325#true} {7326#false} #1109#return; {7326#false} is VALID [2022-02-20 19:58:55,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {7325#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {7325#true} is VALID [2022-02-20 19:58:55,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {7325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {7325#true} is VALID [2022-02-20 19:58:55,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {7325#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {7325#true} is VALID [2022-02-20 19:58:55,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {7325#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; {7325#true} is VALID [2022-02-20 19:58:55,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {7325#true} call update_channels1(); {7364#(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:58:55,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {7364#(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); {7325#true} is VALID [2022-02-20 19:58:55,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,213 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7325#true} {7325#true} #1101#return; {7325#true} is VALID [2022-02-20 19:58:55,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {7325#true} assume { :begin_inline_init_threads1 } true; {7325#true} is VALID [2022-02-20 19:58:55,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {7325#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7325#true} is VALID [2022-02-20 19:58:55,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {7325#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7325#true} is VALID [2022-02-20 19:58:55,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {7325#true} assume { :end_inline_init_threads1 } true; {7325#true} is VALID [2022-02-20 19:58:55,217 INFO L272 TraceCheckUtils]: 12: Hoare triple {7325#true} call fire_delta_events1(); {7365#(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:58:55,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {7365#(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); {7325#true} is VALID [2022-02-20 19:58:55,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#true} assume !(0 == ~q_write_ev~0); {7325#true} is VALID [2022-02-20 19:58:55,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7325#true} {7325#true} #1103#return; {7325#true} is VALID [2022-02-20 19:58:55,218 INFO L272 TraceCheckUtils]: 17: Hoare triple {7325#true} call activate_threads1(); {7366#(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:58:55,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(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; {7325#true} is VALID [2022-02-20 19:58:55,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {7325#true} call #t~ret8 := is_do_write_p_triggered(); {7325#true} is VALID [2022-02-20 19:58:55,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {7325#true} havoc ~__retres1~0; {7325#true} is VALID [2022-02-20 19:58:55,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {7325#true} assume !(1 == ~p_dw_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {7325#true} ~__retres1~0 := 0; {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:55,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {7381#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:55,222 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7382#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7325#true} #1097#return; {7373#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:55,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {7373#(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; {7374#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:55,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {7374#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7326#false} is VALID [2022-02-20 19:58:55,223 INFO L272 TraceCheckUtils]: 28: Hoare triple {7326#false} call #t~ret9 := is_do_read_c_triggered(); {7325#true} is VALID [2022-02-20 19:58:55,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {7325#true} havoc ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {7325#true} assume !(1 == ~c_dr_pc~0); {7325#true} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {7325#true} ~__retres1~1 := 0; {7325#true} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {7325#true} #res := ~__retres1~1; {7325#true} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,225 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7325#true} {7326#false} #1099#return; {7326#false} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {7326#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7326#false} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {7326#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7326#false} is VALID [2022-02-20 19:58:55,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {7326#false} assume true; {7326#false} is VALID [2022-02-20 19:58:55,226 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7326#false} {7325#true} #1105#return; {7326#false} is VALID [2022-02-20 19:58:55,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {7326#false} call reset_delta_events1(); {7365#(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:58:55,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {7365#(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); {7325#true} is VALID [2022-02-20 19:58:55,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {7325#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7325#true} is VALID [2022-02-20 19:58:55,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,226 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7325#true} {7326#false} #1107#return; {7326#false} is VALID [2022-02-20 19:58:55,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {7326#false} assume !false; {7326#false} is VALID [2022-02-20 19:58:55,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {7326#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; {7326#false} is VALID [2022-02-20 19:58:55,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {7326#false} assume !false; {7326#false} is VALID [2022-02-20 19:58:55,227 INFO L272 TraceCheckUtils]: 47: Hoare triple {7326#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7325#true} is VALID [2022-02-20 19:58:55,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {7325#true} havoc ~__retres1~2; {7325#true} is VALID [2022-02-20 19:58:55,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {7325#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7325#true} is VALID [2022-02-20 19:58:55,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {7325#true} #res := ~__retres1~2; {7325#true} is VALID [2022-02-20 19:58:55,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {7325#true} assume true; {7325#true} is VALID [2022-02-20 19:58:55,227 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7325#true} {7326#false} #1109#return; {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {7326#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; {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {7326#false} assume 0 != eval1_~tmp___1~0#1; {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {7326#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; {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {7326#false} assume !(0 != eval1_~tmp~2#1); {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L272 TraceCheckUtils]: 57: Hoare triple {7326#false} call error1(); {7326#false} is VALID [2022-02-20 19:58:55,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {7326#false} assume !false; {7326#false} is VALID [2022-02-20 19:58:55,236 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:58:55,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:55,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653784014] [2022-02-20 19:58:55,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653784014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:55,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:55,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:55,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243626538] [2022-02-20 19:58:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:55,239 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:58:55,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:55,239 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:58:55,267 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:58:55,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:55,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:55,268 INFO L87 Difference]: Start difference. First operand 491 states and 704 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:58:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,546 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2022-02-20 19:58:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:57,546 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:58:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:57,548 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:58:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 597 transitions. [2022-02-20 19:58:57,556 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:58:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 597 transitions. [2022-02-20 19:58:57,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 597 transitions. [2022-02-20 19:58:57,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,952 INFO L225 Difference]: With dead ends: 793 [2022-02-20 19:58:57,952 INFO L226 Difference]: Without dead ends: 525 [2022-02-20 19:58:57,953 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:58:57,959 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 548 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:57,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1714 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-02-20 19:58:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 496. [2022-02-20 19:58:57,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:57,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 525 states. Second operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:58:57,983 INFO L74 IsIncluded]: Start isIncluded. First operand 525 states. Second operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:58:57,984 INFO L87 Difference]: Start difference. First operand 525 states. Second operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:58:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,997 INFO L93 Difference]: Finished difference Result 525 states and 748 transitions. [2022-02-20 19:58:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 748 transitions. [2022-02-20 19:58:57,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:57,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:57,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) Second operand 525 states. [2022-02-20 19:58:58,001 INFO L87 Difference]: Start difference. First operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) Second operand 525 states. [2022-02-20 19:58:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,013 INFO L93 Difference]: Finished difference Result 525 states and 748 transitions. [2022-02-20 19:58:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 748 transitions. [2022-02-20 19:58:58,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:58,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:58:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 707 transitions. [2022-02-20 19:58:58,031 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 707 transitions. Word has length 59 [2022-02-20 19:58:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:58,031 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 707 transitions. [2022-02-20 19:58:58,031 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:58:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 707 transitions. [2022-02-20 19:58:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:58,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:58,032 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:58:58,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:58,033 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1386842187, now seen corresponding path program 1 times [2022-02-20 19:58:58,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:58,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781568635] [2022-02-20 19:58:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {10230#(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); {10191#true} is VALID [2022-02-20 19:58:58,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10191#true} {10191#true} #1101#return; {10191#true} is VALID [2022-02-20 19:58:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {10231#(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); {10191#true} is VALID [2022-02-20 19:58:58,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume !(0 == ~q_write_ev~0); {10191#true} is VALID [2022-02-20 19:58:58,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10191#true} {10191#true} #1103#return; {10191#true} is VALID [2022-02-20 19:58:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {10191#true} havoc ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume !(1 == ~p_dw_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} ~__retres1~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {10191#true} #res := ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10191#true} {10191#true} #1097#return; {10191#true} is VALID [2022-02-20 19:58:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {10191#true} havoc ~__retres1~1; {10191#true} is VALID [2022-02-20 19:58:58,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume !(1 == ~c_dr_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} ~__retres1~1 := 0; {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:58,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,156 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10191#true} #1099#return; {10245#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:58,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {10232#(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; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L272 TraceCheckUtils]: 1: Hoare triple {10191#true} call #t~ret8 := is_do_write_p_triggered(); {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} havoc ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {10191#true} assume !(1 == ~p_dw_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {10191#true} ~__retres1~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {10191#true} #res := ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10191#true} {10191#true} #1097#return; {10191#true} is VALID [2022-02-20 19:58:58,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {10191#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10191#true} is VALID [2022-02-20 19:58:58,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {10191#true} assume !(0 != ~tmp~1); {10191#true} is VALID [2022-02-20 19:58:58,158 INFO L272 TraceCheckUtils]: 10: Hoare triple {10191#true} call #t~ret9 := is_do_read_c_triggered(); {10191#true} is VALID [2022-02-20 19:58:58,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {10191#true} havoc ~__retres1~1; {10191#true} is VALID [2022-02-20 19:58:58,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {10191#true} assume !(1 == ~c_dr_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {10191#true} ~__retres1~1 := 0; {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:58,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10191#true} #1099#return; {10245#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:58,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {10245#(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; {10246#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:58,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {10246#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10192#false} is VALID [2022-02-20 19:58:58,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {10192#false} assume true; {10192#false} is VALID [2022-02-20 19:58:58,161 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10192#false} {10191#true} #1105#return; {10192#false} is VALID [2022-02-20 19:58:58,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {10231#(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); {10191#true} is VALID [2022-02-20 19:58:58,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10191#true} is VALID [2022-02-20 19:58:58,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10191#true} {10192#false} #1107#return; {10192#false} is VALID [2022-02-20 19:58:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:58,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {10191#true} havoc ~__retres1~2; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} #res := ~__retres1~2; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10191#true} {10192#false} #1109#return; {10192#false} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {10191#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {10191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {10191#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {10191#true} is VALID [2022-02-20 19:58:58,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {10191#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; {10191#true} is VALID [2022-02-20 19:58:58,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {10191#true} call update_channels1(); {10230#(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:58:58,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {10230#(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); {10191#true} is VALID [2022-02-20 19:58:58,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,170 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10191#true} {10191#true} #1101#return; {10191#true} is VALID [2022-02-20 19:58:58,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {10191#true} assume { :begin_inline_init_threads1 } true; {10191#true} is VALID [2022-02-20 19:58:58,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {10191#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {10191#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {10191#true} assume { :end_inline_init_threads1 } true; {10191#true} is VALID [2022-02-20 19:58:58,172 INFO L272 TraceCheckUtils]: 12: Hoare triple {10191#true} call fire_delta_events1(); {10231#(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:58:58,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {10231#(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); {10191#true} is VALID [2022-02-20 19:58:58,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {10191#true} assume !(0 == ~q_write_ev~0); {10191#true} is VALID [2022-02-20 19:58:58,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,172 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10191#true} {10191#true} #1103#return; {10191#true} is VALID [2022-02-20 19:58:58,173 INFO L272 TraceCheckUtils]: 17: Hoare triple {10191#true} call activate_threads1(); {10232#(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:58:58,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {10232#(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; {10191#true} is VALID [2022-02-20 19:58:58,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {10191#true} call #t~ret8 := is_do_write_p_triggered(); {10191#true} is VALID [2022-02-20 19:58:58,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {10191#true} havoc ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {10191#true} assume !(1 == ~p_dw_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {10191#true} ~__retres1~0 := 0; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {10191#true} #res := ~__retres1~0; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10191#true} {10191#true} #1097#return; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {10191#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {10191#true} assume !(0 != ~tmp~1); {10191#true} is VALID [2022-02-20 19:58:58,176 INFO L272 TraceCheckUtils]: 28: Hoare triple {10191#true} call #t~ret9 := is_do_read_c_triggered(); {10191#true} is VALID [2022-02-20 19:58:58,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {10191#true} havoc ~__retres1~1; {10191#true} is VALID [2022-02-20 19:58:58,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {10191#true} assume !(1 == ~c_dr_pc~0); {10191#true} is VALID [2022-02-20 19:58:58,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {10191#true} ~__retres1~1 := 0; {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:58,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {10247#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:58,178 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10248#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10191#true} #1099#return; {10245#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:58,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {10245#(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; {10246#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:58,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {10246#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10192#false} is VALID [2022-02-20 19:58:58,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {10192#false} assume true; {10192#false} is VALID [2022-02-20 19:58:58,179 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10192#false} {10191#true} #1105#return; {10192#false} is VALID [2022-02-20 19:58:58,179 INFO L272 TraceCheckUtils]: 39: Hoare triple {10192#false} call reset_delta_events1(); {10231#(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:58:58,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(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); {10191#true} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {10191#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10191#true} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,180 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10191#true} {10192#false} #1107#return; {10192#false} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {10192#false} assume !false; {10192#false} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {10192#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; {10192#false} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {10192#false} assume !false; {10192#false} is VALID [2022-02-20 19:58:58,180 INFO L272 TraceCheckUtils]: 47: Hoare triple {10192#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10191#true} is VALID [2022-02-20 19:58:58,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {10191#true} havoc ~__retres1~2; {10191#true} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {10191#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10191#true} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {10191#true} #res := ~__retres1~2; {10191#true} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {10191#true} assume true; {10191#true} is VALID [2022-02-20 19:58:58,181 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10191#true} {10192#false} #1109#return; {10192#false} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {10192#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; {10192#false} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {10192#false} assume 0 != eval1_~tmp___1~0#1; {10192#false} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {10192#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; {10192#false} is VALID [2022-02-20 19:58:58,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {10192#false} assume !(0 != eval1_~tmp~2#1); {10192#false} is VALID [2022-02-20 19:58:58,181 INFO L272 TraceCheckUtils]: 57: Hoare triple {10192#false} call error1(); {10192#false} is VALID [2022-02-20 19:58:58,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {10192#false} assume !false; {10192#false} is VALID [2022-02-20 19:58:58,182 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:58:58,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:58,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781568635] [2022-02-20 19:58:58,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781568635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:58,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:58,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:58,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390244995] [2022-02-20 19:58:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:58,184 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:58:58,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:58,184 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:58:58,215 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:58:58,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:58,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:58,217 INFO L87 Difference]: Start difference. First operand 496 states and 707 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:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,471 INFO L93 Difference]: Finished difference Result 815 states and 1141 transitions. [2022-02-20 19:59:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:00,472 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:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:00,472 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:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 601 transitions. [2022-02-20 19:59:00,476 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:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 601 transitions. [2022-02-20 19:59:00,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 601 transitions. [2022-02-20 19:59:00,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:00,863 INFO L225 Difference]: With dead ends: 815 [2022-02-20 19:59:00,863 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 19:59:00,864 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:00,865 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 549 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:00,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1711 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 19:59:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 511. [2022-02-20 19:59:00,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:00,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:59:00,886 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:59:00,887 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:59:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,900 INFO L93 Difference]: Finished difference Result 542 states and 766 transitions. [2022-02-20 19:59:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 766 transitions. [2022-02-20 19:59:00,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) Second operand 542 states. [2022-02-20 19:59:00,904 INFO L87 Difference]: Start difference. First operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) Second operand 542 states. [2022-02-20 19:59:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,917 INFO L93 Difference]: Finished difference Result 542 states and 766 transitions. [2022-02-20 19:59:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 766 transitions. [2022-02-20 19:59:00,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:00,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:59:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 722 transitions. [2022-02-20 19:59:00,934 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 722 transitions. Word has length 59 [2022-02-20 19:59:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:00,934 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 722 transitions. [2022-02-20 19:59:00,935 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:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 722 transitions. [2022-02-20 19:59:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:00,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:00,936 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:00,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:00,936 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1102686775, now seen corresponding path program 1 times [2022-02-20 19:59:00,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:00,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371828629] [2022-02-20 19:59:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {13177#(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); {13178#(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:00,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13178#(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:00,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1101#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {13178#(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); {13178#(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:00,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {13178#(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); {13178#(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:00,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13178#(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:00,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1103#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:01,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {13137#true} havoc ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {13137#true} assume !(1 == ~p_dw_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {13137#true} ~__retres1~0 := 0; {13137#true} is VALID [2022-02-20 19:59:01,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {13137#true} #res := ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,001 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13137#true} {13137#true} #1097#return; {13137#true} is VALID [2022-02-20 19:59:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:01,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {13137#true} havoc ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {13137#true} assume !(1 == ~c_dr_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {13137#true} ~__retres1~1 := 0; {13137#true} is VALID [2022-02-20 19:59:01,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {13137#true} #res := ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,006 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13137#true} {13137#true} #1099#return; {13137#true} is VALID [2022-02-20 19:59:01,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {13179#(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; {13137#true} is VALID [2022-02-20 19:59:01,006 INFO L272 TraceCheckUtils]: 1: Hoare triple {13137#true} call #t~ret8 := is_do_write_p_triggered(); {13137#true} is VALID [2022-02-20 19:59:01,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {13137#true} havoc ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {13137#true} assume !(1 == ~p_dw_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {13137#true} ~__retres1~0 := 0; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {13137#true} #res := ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13137#true} {13137#true} #1097#return; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {13137#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {13137#true} assume !(0 != ~tmp~1); {13137#true} is VALID [2022-02-20 19:59:01,007 INFO L272 TraceCheckUtils]: 10: Hoare triple {13137#true} call #t~ret9 := is_do_read_c_triggered(); {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {13137#true} havoc ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {13137#true} assume !(1 == ~c_dr_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {13137#true} ~__retres1~1 := 0; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {13137#true} #res := ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13137#true} {13137#true} #1099#return; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {13137#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13137#true} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {13137#true} assume !(0 != ~tmp___0~1); {13137#true} is VALID [2022-02-20 19:59:01,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,009 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13137#true} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1105#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:01,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {13178#(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); {13192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:01,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {13192#(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; {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:01,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:01,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1107#return; {13138#false} is VALID [2022-02-20 19:59:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:01,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {13137#true} havoc ~__retres1~2; {13137#true} is VALID [2022-02-20 19:59:01,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {13137#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13137#true} is VALID [2022-02-20 19:59:01,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {13137#true} #res := ~__retres1~2; {13137#true} is VALID [2022-02-20 19:59:01,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,030 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13137#true} {13138#false} #1109#return; {13138#false} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {13137#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {13137#true} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {13137#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {13137#true} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {13137#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {13139#(= ~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; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13177#(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:01,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {13177#(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); {13178#(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:01,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13178#(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:01,033 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1101#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,034 INFO L272 TraceCheckUtils]: 12: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13178#(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:01,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {13178#(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); {13178#(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:01,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {13178#(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); {13178#(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:01,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13178#(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:01,036 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13178#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1103#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,036 INFO L272 TraceCheckUtils]: 17: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13179#(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:01,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {13179#(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; {13137#true} is VALID [2022-02-20 19:59:01,036 INFO L272 TraceCheckUtils]: 19: Hoare triple {13137#true} call #t~ret8 := is_do_write_p_triggered(); {13137#true} is VALID [2022-02-20 19:59:01,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {13137#true} havoc ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {13137#true} assume !(1 == ~p_dw_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {13137#true} ~__retres1~0 := 0; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {13137#true} #res := ~__retres1~0; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13137#true} {13137#true} #1097#return; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {13137#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {13137#true} assume !(0 != ~tmp~1); {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L272 TraceCheckUtils]: 28: Hoare triple {13137#true} call #t~ret9 := is_do_read_c_triggered(); {13137#true} is VALID [2022-02-20 19:59:01,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {13137#true} havoc ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {13137#true} assume !(1 == ~c_dr_pc~0); {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {13137#true} ~__retres1~1 := 0; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {13137#true} #res := ~__retres1~1; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13137#true} {13137#true} #1099#return; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {13137#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {13137#true} assume !(0 != ~tmp___0~1); {13137#true} is VALID [2022-02-20 19:59:01,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,039 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13137#true} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1105#return; {13139#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:01,039 INFO L272 TraceCheckUtils]: 39: Hoare triple {13139#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13178#(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:01,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {13178#(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); {13192#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:01,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {13192#(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; {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:01,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:01,040 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13193#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13139#(= ~q_write_ev~0 ~q_read_ev~0)} #1107#return; {13138#false} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {13138#false} assume !false; {13138#false} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {13138#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; {13138#false} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {13138#false} assume !false; {13138#false} is VALID [2022-02-20 19:59:01,041 INFO L272 TraceCheckUtils]: 47: Hoare triple {13138#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13137#true} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {13137#true} havoc ~__retres1~2; {13137#true} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {13137#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13137#true} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {13137#true} #res := ~__retres1~2; {13137#true} is VALID [2022-02-20 19:59:01,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {13137#true} assume true; {13137#true} is VALID [2022-02-20 19:59:01,041 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13137#true} {13138#false} #1109#return; {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {13138#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; {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {13138#false} assume 0 != eval1_~tmp___1~0#1; {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {13138#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; {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {13138#false} assume !(0 != eval1_~tmp~2#1); {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L272 TraceCheckUtils]: 57: Hoare triple {13138#false} call error1(); {13138#false} is VALID [2022-02-20 19:59:01,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {13138#false} assume !false; {13138#false} is VALID [2022-02-20 19:59:01,042 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:01,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:01,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371828629] [2022-02-20 19:59:01,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371828629] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:01,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:01,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:01,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083471002] [2022-02-20 19:59:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:01,044 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:01,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:01,044 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:01,072 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:01,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:01,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:01,074 INFO L87 Difference]: Start difference. First operand 511 states and 722 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:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:03,447 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2022-02-20 19:59:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:03,448 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:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:03,448 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:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 780 transitions. [2022-02-20 19:59:03,453 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:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 780 transitions. [2022-02-20 19:59:03,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 780 transitions. [2022-02-20 19:59:03,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:04,002 INFO L225 Difference]: With dead ends: 905 [2022-02-20 19:59:04,003 INFO L226 Difference]: Without dead ends: 619 [2022-02-20 19:59:04,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:04,004 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 869 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:04,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [892 Valid, 1516 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-02-20 19:59:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 523. [2022-02-20 19:59:04,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:04,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:59:04,028 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:59:04,029 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:59:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,046 INFO L93 Difference]: Finished difference Result 619 states and 854 transitions. [2022-02-20 19:59:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 854 transitions. [2022-02-20 19:59:04,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) Second operand 619 states. [2022-02-20 19:59:04,049 INFO L87 Difference]: Start difference. First operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) Second operand 619 states. [2022-02-20 19:59:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,064 INFO L93 Difference]: Finished difference Result 619 states and 854 transitions. [2022-02-20 19:59:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 854 transitions. [2022-02-20 19:59:04,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:04,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:59:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 732 transitions. [2022-02-20 19:59:04,082 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 732 transitions. Word has length 59 [2022-02-20 19:59:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:04,082 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 732 transitions. [2022-02-20 19:59:04,082 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:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 732 transitions. [2022-02-20 19:59:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:04,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:04,083 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:04,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:04,084 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2022-02-20 19:59:04,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:04,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683461522] [2022-02-20 19:59:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:04,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:04,132 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:04,133 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:04,133 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:04,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:04,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:04,137 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:04,140 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:04,186 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:04,186 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:04,189 INFO L158 Benchmark]: Toolchain (without parser) took 18940.69ms. Allocated memory was 102.8MB in the beginning and 234.9MB in the end (delta: 132.1MB). Free memory was 68.7MB in the beginning and 104.5MB in the end (delta: -35.8MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,190 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 102.8MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:04,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.61ms. Allocated memory is still 102.8MB. Free memory was 68.6MB in the beginning and 67.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.10ms. Allocated memory is still 102.8MB. Free memory was 67.1MB in the beginning and 63.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,190 INFO L158 Benchmark]: Boogie Preprocessor took 56.56ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 59.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,190 INFO L158 Benchmark]: RCFGBuilder took 631.80ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 59.5MB in the beginning and 80.6MB in the end (delta: -21.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,191 INFO L158 Benchmark]: TraceAbstraction took 17873.92ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 79.9MB in the beginning and 104.5MB in the end (delta: -24.6MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:04,192 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.11ms. Allocated memory is still 102.8MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.61ms. Allocated memory is still 102.8MB. Free memory was 68.6MB in the beginning and 67.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.10ms. Allocated memory is still 102.8MB. Free memory was 67.1MB in the beginning and 63.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.56ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 59.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 631.80ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 59.5MB in the beginning and 80.6MB in the end (delta: -21.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17873.92ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 79.9MB in the beginning and 104.5MB in the end (delta: -24.6MB). Peak memory consumption was 75.3MB. 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:04,241 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.05.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 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:05,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:05,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:05,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:05,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:05,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:05,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:05,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:05,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:05,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:05,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:05,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:05,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:05,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:05,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:05,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:05,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:05,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:05,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:05,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:05,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:05,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:05,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:05,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:05,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:05,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:05,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:05,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:05,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:05,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:05,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:05,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:05,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:05,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:05,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:05,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:05,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:05,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:05,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:05,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:05,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:05,927 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:05,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:05,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:05,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:05,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:05,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:05,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:05,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:05,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:05,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:05,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:05,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:05,955 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:05,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:05,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:05,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:05,957 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:05,958 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:05,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:05,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:05,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:05,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:05,958 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 -> 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 [2022-02-20 19:59:06,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:06,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:06,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:06,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:06,213 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:06,214 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.05.cil-1.c [2022-02-20 19:59:06,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666135904/6ae3b7edb31d4593838a267925486a59/FLAG3af4b0e8d [2022-02-20 19:59:06,635 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:06,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-02-20 19:59:06,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666135904/6ae3b7edb31d4593838a267925486a59/FLAG3af4b0e8d [2022-02-20 19:59:07,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666135904/6ae3b7edb31d4593838a267925486a59 [2022-02-20 19:59:07,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:07,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:07,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:07,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:07,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:07,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:07" (1/1) ... [2022-02-20 19:59:07,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a78071d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:07, skipping insertion in model container [2022-02-20 19:59:07,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:07" (1/1) ... [2022-02-20 19:59:07,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:07,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:07,157 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.05.cil-1.c[914,927] [2022-02-20 19:59:07,205 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.05.cil-1.c[7125,7138] [2022-02-20 19:59:07,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:07,297 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:07,311 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.05.cil-1.c[914,927] [2022-02-20 19:59:07,331 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.05.cil-1.c[7125,7138] [2022-02-20 19:59:07,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:07,392 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:07,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:07 WrapperNode [2022-02-20 19:59:07,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:07,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:07,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:07,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:07,399 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:07" (1/1) ... [2022-02-20 19:59:07,423 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:07" (1/1) ... [2022-02-20 19:59:07,465 INFO L137 Inliner]: procedures = 64, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 610 [2022-02-20 19:59:07,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:07,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:07,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:07,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:07,479 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:07" (1/1) ... [2022-02-20 19:59:07,479 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:07" (1/1) ... [2022-02-20 19:59:07,486 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:07" (1/1) ... [2022-02-20 19:59:07,490 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:07" (1/1) ... [2022-02-20 19:59:07,509 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:07" (1/1) ... [2022-02-20 19:59:07,521 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:07" (1/1) ... [2022-02-20 19:59:07,531 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:07" (1/1) ... [2022-02-20 19:59:07,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:07,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:07,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:07,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:07,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:07" (1/1) ... [2022-02-20 19:59:07,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:07,561 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:07,579 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:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:07,719 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:07,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:08,170 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:08,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:08,177 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 19:59:08,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:08 BoogieIcfgContainer [2022-02-20 19:59:08,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:08,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:08,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:08,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:08,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:07" (1/3) ... [2022-02-20 19:59:08,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac6bf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:08, skipping insertion in model container [2022-02-20 19:59:08,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:07" (2/3) ... [2022-02-20 19:59:08,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac6bf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:08, skipping insertion in model container [2022-02-20 19:59:08,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:08" (3/3) ... [2022-02-20 19:59:08,201 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-02-20 19:59:08,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:08,205 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:08,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:08,239 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:08,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:59:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:08,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:08,265 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:08,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2022-02-20 19:59:08,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:08,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177108518] [2022-02-20 19:59:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:08,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:08,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:08,280 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:08,281 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:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:59:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:08,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_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;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_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;~token~0 := 0bv32;~local~0 := 0bv32; {312#true} is VALID [2022-02-20 19:59:08,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1; {312#true} is VALID [2022-02-20 19:59:08,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume 0bv32 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} 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; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} call update_channels1(); {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} assume !(1bv32 == ~q_req_up~0); {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} assume true; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,585 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {323#(= ~c_dr_i~0 (_ bv1 32))} {323#(= ~c_dr_i~0 (_ bv1 32))} #1101#return; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} assume { :begin_inline_init_threads1 } true; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {323#(= ~c_dr_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:08,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {323#(= ~c_dr_i~0 (_ bv1 32))} assume !(1bv32 == ~c_dr_i~0);~c_dr_st~0 := 2bv32; {313#false} is VALID [2022-02-20 19:59:08,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} assume { :end_inline_init_threads1 } true; {313#false} is VALID [2022-02-20 19:59:08,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {313#false} call fire_delta_events1(); {313#false} is VALID [2022-02-20 19:59:08,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#false} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {313#false} is VALID [2022-02-20 19:59:08,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#false} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {313#false} is VALID [2022-02-20 19:59:08,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {313#false} {313#false} #1103#return; {313#false} is VALID [2022-02-20 19:59:08,599 INFO L272 TraceCheckUtils]: 17: Hoare triple {313#false} call activate_threads1(); {313#false} is VALID [2022-02-20 19:59:08,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#false} havoc ~tmp~1;havoc ~tmp___0~1; {313#false} is VALID [2022-02-20 19:59:08,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {313#false} call #t~ret8 := is_do_write_p_triggered(); {313#false} is VALID [2022-02-20 19:59:08,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} havoc ~__retres1~0; {313#false} is VALID [2022-02-20 19:59:08,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume 1bv32 == ~p_dw_pc~0; {313#false} is VALID [2022-02-20 19:59:08,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {313#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {313#false} is VALID [2022-02-20 19:59:08,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {313#false} #res := ~__retres1~0; {313#false} is VALID [2022-02-20 19:59:08,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,602 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {313#false} {313#false} #1097#return; {313#false} is VALID [2022-02-20 19:59:08,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {313#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {313#false} is VALID [2022-02-20 19:59:08,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {313#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {313#false} is VALID [2022-02-20 19:59:08,603 INFO L272 TraceCheckUtils]: 28: Hoare triple {313#false} call #t~ret9 := is_do_read_c_triggered(); {313#false} is VALID [2022-02-20 19:59:08,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {313#false} havoc ~__retres1~1; {313#false} is VALID [2022-02-20 19:59:08,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {313#false} assume !(1bv32 == ~c_dr_pc~0); {313#false} is VALID [2022-02-20 19:59:08,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {313#false} ~__retres1~1 := 0bv32; {313#false} is VALID [2022-02-20 19:59:08,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {313#false} #res := ~__retres1~1; {313#false} is VALID [2022-02-20 19:59:08,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,604 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {313#false} {313#false} #1099#return; {313#false} is VALID [2022-02-20 19:59:08,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {313#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {313#false} is VALID [2022-02-20 19:59:08,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {313#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {313#false} is VALID [2022-02-20 19:59:08,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,605 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {313#false} {313#false} #1105#return; {313#false} is VALID [2022-02-20 19:59:08,606 INFO L272 TraceCheckUtils]: 39: Hoare triple {313#false} call reset_delta_events1(); {313#false} is VALID [2022-02-20 19:59:08,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {313#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {313#false} is VALID [2022-02-20 19:59:08,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {313#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {313#false} is VALID [2022-02-20 19:59:08,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,609 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {313#false} {313#false} #1107#return; {313#false} is VALID [2022-02-20 19:59:08,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:59:08,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {313#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; {313#false} is VALID [2022-02-20 19:59:08,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:59:08,610 INFO L272 TraceCheckUtils]: 47: Hoare triple {313#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {313#false} is VALID [2022-02-20 19:59:08,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {313#false} havoc ~__retres1~2; {313#false} is VALID [2022-02-20 19:59:08,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {313#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {313#false} is VALID [2022-02-20 19:59:08,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {313#false} #res := ~__retres1~2; {313#false} is VALID [2022-02-20 19:59:08,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {313#false} assume true; {313#false} is VALID [2022-02-20 19:59:08,616 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {313#false} {313#false} #1109#return; {313#false} is VALID [2022-02-20 19:59:08,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {313#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {313#false} is VALID [2022-02-20 19:59:08,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {313#false} assume 0bv32 != eval1_~tmp___1~0#1; {313#false} is VALID [2022-02-20 19:59:08,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {313#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {313#false} is VALID [2022-02-20 19:59:08,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {313#false} assume !(0bv32 != eval1_~tmp~2#1); {313#false} is VALID [2022-02-20 19:59:08,619 INFO L272 TraceCheckUtils]: 57: Hoare triple {313#false} call error1(); {313#false} is VALID [2022-02-20 19:59:08,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:59:08,620 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:08,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:08,621 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:08,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177108518] [2022-02-20 19:59:08,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177108518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:08,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:08,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:59:08,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638533054] [2022-02-20 19:59:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:08,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:08,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:08,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:08,685 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:08,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:59:08,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:59:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:08,715 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,237 INFO L93 Difference]: Finished difference Result 597 states and 925 transitions. [2022-02-20 19:59:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:59:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2022-02-20 19:59:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2022-02-20 19:59:09,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 925 transitions. [2022-02-20 19:59:09,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 925 edges. 925 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:09,929 INFO L225 Difference]: With dead ends: 597 [2022-02-20 19:59:09,929 INFO L226 Difference]: Without dead ends: 299 [2022-02-20 19:59:09,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:09,936 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 128 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:09,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 760 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-02-20 19:59:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-02-20 19:59:09,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:09,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:09,972 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:09,973 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,987 INFO L93 Difference]: Finished difference Result 299 states and 440 transitions. [2022-02-20 19:59:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-02-20 19:59:09,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:09,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:09,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 299 states. [2022-02-20 19:59:09,991 INFO L87 Difference]: Start difference. First operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 299 states. [2022-02-20 19:59:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,003 INFO L93 Difference]: Finished difference Result 299 states and 440 transitions. [2022-02-20 19:59:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-02-20 19:59:10,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2022-02-20 19:59:10,019 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2022-02-20 19:59:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,020 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2022-02-20 19:59:10,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-02-20 19:59:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,021 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,045 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:10,232 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:10,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2022-02-20 19:59:10,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:10,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504417816] [2022-02-20 19:59:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:10,235 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:10,236 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:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:10,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {2298#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_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;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_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;~token~0 := 0bv32;~local~0 := 0bv32; {2298#true} is VALID [2022-02-20 19:59:10,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {2298#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1; {2298#true} is VALID [2022-02-20 19:59:10,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {2298#true} assume 0bv32 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {2309#(= (_ 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; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,477 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2309#(= (_ bv2 32) ~q_read_ev~0)} #1101#return; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2309#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {2309#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:10,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:10,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:10,480 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2344#(= |old(~q_read_ev~0)| (_ bv0 32))} {2309#(= (_ bv2 32) ~q_read_ev~0)} #1103#return; {2299#false} is VALID [2022-02-20 19:59:10,480 INFO L272 TraceCheckUtils]: 17: Hoare triple {2299#false} call activate_threads1(); {2299#false} is VALID [2022-02-20 19:59:10,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {2299#false} havoc ~tmp~1;havoc ~tmp___0~1; {2299#false} is VALID [2022-02-20 19:59:10,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {2299#false} call #t~ret8 := is_do_write_p_triggered(); {2299#false} is VALID [2022-02-20 19:59:10,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {2299#false} havoc ~__retres1~0; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {2299#false} assume 1bv32 == ~p_dw_pc~0; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {2299#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {2299#false} #res := ~__retres1~0; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {2299#false} assume true; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2299#false} {2299#false} #1097#return; {2299#false} is VALID [2022-02-20 19:59:10,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {2299#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2299#false} is VALID [2022-02-20 19:59:10,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {2299#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2299#false} is VALID [2022-02-20 19:59:10,482 INFO L272 TraceCheckUtils]: 28: Hoare triple {2299#false} call #t~ret9 := is_do_read_c_triggered(); {2299#false} is VALID [2022-02-20 19:59:10,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {2299#false} havoc ~__retres1~1; {2299#false} is VALID [2022-02-20 19:59:10,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {2299#false} assume !(1bv32 == ~c_dr_pc~0); {2299#false} is VALID [2022-02-20 19:59:10,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {2299#false} ~__retres1~1 := 0bv32; {2299#false} is VALID [2022-02-20 19:59:10,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {2299#false} #res := ~__retres1~1; {2299#false} is VALID [2022-02-20 19:59:10,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {2299#false} assume true; {2299#false} is VALID [2022-02-20 19:59:10,486 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2299#false} {2299#false} #1099#return; {2299#false} is VALID [2022-02-20 19:59:10,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {2299#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2299#false} is VALID [2022-02-20 19:59:10,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {2299#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2299#false} is VALID [2022-02-20 19:59:10,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {2299#false} assume true; {2299#false} is VALID [2022-02-20 19:59:10,487 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2299#false} {2299#false} #1105#return; {2299#false} is VALID [2022-02-20 19:59:10,487 INFO L272 TraceCheckUtils]: 39: Hoare triple {2299#false} call reset_delta_events1(); {2299#false} is VALID [2022-02-20 19:59:10,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {2299#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {2299#false} is VALID [2022-02-20 19:59:10,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {2299#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2299#false} is VALID [2022-02-20 19:59:10,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {2299#false} assume true; {2299#false} is VALID [2022-02-20 19:59:10,490 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2299#false} {2299#false} #1107#return; {2299#false} is VALID [2022-02-20 19:59:10,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {2299#false} assume !false; {2299#false} is VALID [2022-02-20 19:59:10,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {2299#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; {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {2299#false} assume !false; {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L272 TraceCheckUtils]: 47: Hoare triple {2299#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {2299#false} havoc ~__retres1~2; {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {2299#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {2299#false} #res := ~__retres1~2; {2299#false} is VALID [2022-02-20 19:59:10,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {2299#false} assume true; {2299#false} is VALID [2022-02-20 19:59:10,492 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2299#false} {2299#false} #1109#return; {2299#false} is VALID [2022-02-20 19:59:10,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {2299#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2299#false} is VALID [2022-02-20 19:59:10,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {2299#false} assume 0bv32 != eval1_~tmp___1~0#1; {2299#false} is VALID [2022-02-20 19:59:10,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {2299#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2299#false} is VALID [2022-02-20 19:59:10,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {2299#false} assume !(0bv32 != eval1_~tmp~2#1); {2299#false} is VALID [2022-02-20 19:59:10,493 INFO L272 TraceCheckUtils]: 57: Hoare triple {2299#false} call error1(); {2299#false} is VALID [2022-02-20 19:59:10,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {2299#false} assume !false; {2299#false} is VALID [2022-02-20 19:59:10,494 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,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:10,495 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:10,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504417816] [2022-02-20 19:59:10,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504417816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:10,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:10,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:10,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860507113] [2022-02-20 19:59:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:10,501 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:10,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:10,502 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:10,540 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,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:10,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:10,541 INFO L87 Difference]: Start difference. First operand 299 states and 440 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:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:11,947 INFO L93 Difference]: Finished difference Result 492 states and 710 transitions. [2022-02-20 19:59:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:11,947 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:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:11,948 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:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2022-02-20 19:59:11,955 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:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2022-02-20 19:59:11,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 710 transitions. [2022-02-20 19:59:12,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 710 edges. 710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,446 INFO L225 Difference]: With dead ends: 492 [2022-02-20 19:59:12,446 INFO L226 Difference]: Without dead ends: 403 [2022-02-20 19:59:12,447 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:12,448 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 332 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:12,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 1119 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-02-20 19:59:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 395. [2022-02-20 19:59:12,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:59:12,481 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:59:12,482 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:59:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,494 INFO L93 Difference]: Finished difference Result 403 states and 580 transitions. [2022-02-20 19:59:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 580 transitions. [2022-02-20 19:59:12,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 403 states. [2022-02-20 19:59:12,498 INFO L87 Difference]: Start difference. First operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 403 states. [2022-02-20 19:59:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,511 INFO L93 Difference]: Finished difference Result 403 states and 580 transitions. [2022-02-20 19:59:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 580 transitions. [2022-02-20 19:59:12,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:59:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2022-02-20 19:59:12,527 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2022-02-20 19:59:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,528 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2022-02-20 19:59:12,528 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:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2022-02-20 19:59:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,529 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,529 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:12,539 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:12,734 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:12,734 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2022-02-20 19:59:12,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:12,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558566943] [2022-02-20 19:59:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:12,736 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:12,737 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:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:12,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4492#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_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;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_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;~token~0 := 0bv32;~local~0 := 0bv32; {4492#true} is VALID [2022-02-20 19:59:12,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1; {4492#true} is VALID [2022-02-20 19:59:12,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {4492#true} assume 0bv32 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {4503#(= (_ 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; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,975 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {4503#(= (_ bv2 32) ~q_write_ev~0)} #1101#return; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {4503#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {4503#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:12,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {4510#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {4541#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:12,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {4541#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {4541#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:12,980 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4541#(= |old(~q_write_ev~0)| (_ bv0 32))} {4503#(= (_ bv2 32) ~q_write_ev~0)} #1103#return; {4493#false} is VALID [2022-02-20 19:59:12,980 INFO L272 TraceCheckUtils]: 17: Hoare triple {4493#false} call activate_threads1(); {4493#false} is VALID [2022-02-20 19:59:12,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {4493#false} havoc ~tmp~1;havoc ~tmp___0~1; {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {4493#false} call #t~ret8 := is_do_write_p_triggered(); {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {4493#false} havoc ~__retres1~0; {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {4493#false} assume !(1bv32 == ~p_dw_pc~0); {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {4493#false} ~__retres1~0 := 0bv32; {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {4493#false} #res := ~__retres1~0; {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {4493#false} assume true; {4493#false} is VALID [2022-02-20 19:59:12,981 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4493#false} {4493#false} #1097#return; {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {4493#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {4493#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L272 TraceCheckUtils]: 28: Hoare triple {4493#false} call #t~ret9 := is_do_read_c_triggered(); {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {4493#false} havoc ~__retres1~1; {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#false} assume !(1bv32 == ~c_dr_pc~0); {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {4493#false} ~__retres1~1 := 0bv32; {4493#false} is VALID [2022-02-20 19:59:12,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {4493#false} #res := ~__retres1~1; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {4493#false} assume true; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4493#false} {4493#false} #1099#return; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {4493#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {4493#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {4493#false} assume true; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4493#false} {4493#false} #1105#return; {4493#false} is VALID [2022-02-20 19:59:12,983 INFO L272 TraceCheckUtils]: 39: Hoare triple {4493#false} call reset_delta_events1(); {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {4493#false} assume !(1bv32 == ~q_read_ev~0); {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {4493#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {4493#false} assume true; {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4493#false} {4493#false} #1107#return; {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {4493#false} assume !false; {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {4493#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; {4493#false} is VALID [2022-02-20 19:59:12,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {4493#false} assume !false; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L272 TraceCheckUtils]: 47: Hoare triple {4493#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {4493#false} havoc ~__retres1~2; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {4493#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {4493#false} #res := ~__retres1~2; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {4493#false} assume true; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4493#false} {4493#false} #1109#return; {4493#false} is VALID [2022-02-20 19:59:12,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {4493#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {4493#false} is VALID [2022-02-20 19:59:12,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {4493#false} assume 0bv32 != eval1_~tmp___1~0#1; {4493#false} is VALID [2022-02-20 19:59:12,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {4493#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {4493#false} is VALID [2022-02-20 19:59:12,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {4493#false} assume !(0bv32 != eval1_~tmp~2#1); {4493#false} is VALID [2022-02-20 19:59:12,986 INFO L272 TraceCheckUtils]: 57: Hoare triple {4493#false} call error1(); {4493#false} is VALID [2022-02-20 19:59:12,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {4493#false} assume !false; {4493#false} is VALID [2022-02-20 19:59:12,987 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:12,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:12,988 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:12,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558566943] [2022-02-20 19:59:12,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558566943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:12,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:12,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:12,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690590026] [2022-02-20 19:59:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:12,992 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:12,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:12,992 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:13,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:13,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:13,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:13,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:13,038 INFO L87 Difference]: Start difference. First operand 395 states and 571 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:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,425 INFO L93 Difference]: Finished difference Result 789 states and 1125 transitions. [2022-02-20 19:59:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:14,426 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:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:14,428 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:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2022-02-20 19:59:14,445 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:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2022-02-20 19:59:14,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 708 transitions. [2022-02-20 19:59:14,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,931 INFO L225 Difference]: With dead ends: 789 [2022-02-20 19:59:14,932 INFO L226 Difference]: Without dead ends: 609 [2022-02-20 19:59:14,932 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:14,933 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 324 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:14,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1124 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-02-20 19:59:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 600. [2022-02-20 19:59:14,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:14,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 609 states. Second operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) [2022-02-20 19:59:14,957 INFO L74 IsIncluded]: Start isIncluded. First operand 609 states. Second operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) [2022-02-20 19:59:14,958 INFO L87 Difference]: Start difference. First operand 609 states. Second operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) [2022-02-20 19:59:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,975 INFO L93 Difference]: Finished difference Result 609 states and 859 transitions. [2022-02-20 19:59:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 859 transitions. [2022-02-20 19:59:14,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) Second operand 609 states. [2022-02-20 19:59:14,979 INFO L87 Difference]: Start difference. First operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) Second operand 609 states. [2022-02-20 19:59:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:15,013 INFO L93 Difference]: Finished difference Result 609 states and 859 transitions. [2022-02-20 19:59:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 859 transitions. [2022-02-20 19:59:15,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:15,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:15,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:15,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) [2022-02-20 19:59:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 849 transitions. [2022-02-20 19:59:15,067 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 849 transitions. Word has length 59 [2022-02-20 19:59:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:15,067 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 849 transitions. [2022-02-20 19:59:15,068 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:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 849 transitions. [2022-02-20 19:59:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:15,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:15,069 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:15,091 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:15,269 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:15,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 639220789, now seen corresponding path program 1 times [2022-02-20 19:59:15,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:15,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874086378] [2022-02-20 19:59:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:15,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:15,271 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:15,272 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:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:15,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:15,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {7777#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_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;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_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;~token~0 := 0bv32;~local~0 := 0bv32; {7777#true} is VALID [2022-02-20 19:59:15,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1; {7777#true} is VALID [2022-02-20 19:59:15,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {7777#true} assume 0bv32 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {7777#true} is VALID [2022-02-20 19:59:15,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {7777#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; {7777#true} is VALID [2022-02-20 19:59:15,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {7777#true} call update_channels1(); {7777#true} is VALID [2022-02-20 19:59:15,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {7777#true} assume !(1bv32 == ~q_req_up~0); {7777#true} is VALID [2022-02-20 19:59:15,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {7777#true} assume true; {7777#true} is VALID [2022-02-20 19:59:15,470 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7777#true} {7777#true} #1101#return; {7777#true} is VALID [2022-02-20 19:59:15,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {7777#true} assume { :begin_inline_init_threads1 } true; {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {7777#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {7777#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {7777#true} assume { :end_inline_init_threads1 } true; {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L272 TraceCheckUtils]: 12: Hoare triple {7777#true} call fire_delta_events1(); {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {7777#true} assume !(0bv32 == ~q_read_ev~0); {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {7777#true} assume !(0bv32 == ~q_write_ev~0); {7777#true} is VALID [2022-02-20 19:59:15,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {7777#true} assume true; {7777#true} is VALID [2022-02-20 19:59:15,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7777#true} {7777#true} #1103#return; {7777#true} is VALID [2022-02-20 19:59:15,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {7777#true} call activate_threads1(); {7777#true} is VALID [2022-02-20 19:59:15,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {7777#true} havoc ~tmp~1;havoc ~tmp___0~1; {7777#true} is VALID [2022-02-20 19:59:15,472 INFO L272 TraceCheckUtils]: 19: Hoare triple {7777#true} call #t~ret8 := is_do_write_p_triggered(); {7777#true} is VALID [2022-02-20 19:59:15,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {7777#true} havoc ~__retres1~0; {7777#true} is VALID [2022-02-20 19:59:15,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {7777#true} assume !(1bv32 == ~p_dw_pc~0); {7777#true} is VALID [2022-02-20 19:59:15,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {7777#true} ~__retres1~0 := 0bv32; {7848#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:15,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {7848#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {7852#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:15,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {7852#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {7852#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:15,477 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7852#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {7777#true} #1097#return; {7859#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:15,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {7859#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {7863#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:15,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {7863#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L272 TraceCheckUtils]: 28: Hoare triple {7778#false} call #t~ret9 := is_do_read_c_triggered(); {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {7778#false} havoc ~__retres1~1; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {7778#false} assume !(1bv32 == ~c_dr_pc~0); {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {7778#false} ~__retres1~1 := 0bv32; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {7778#false} #res := ~__retres1~1; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {7778#false} assume true; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7778#false} {7778#false} #1099#return; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {7778#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {7778#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {7778#false} assume true; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7778#false} {7777#true} #1105#return; {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L272 TraceCheckUtils]: 39: Hoare triple {7778#false} call reset_delta_events1(); {7778#false} is VALID [2022-02-20 19:59:15,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {7778#false} assume !(1bv32 == ~q_read_ev~0); {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {7778#false} assume !(1bv32 == ~q_write_ev~0); {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {7778#false} assume true; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7778#false} {7778#false} #1107#return; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {7778#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; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L272 TraceCheckUtils]: 47: Hoare triple {7778#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {7778#false} havoc ~__retres1~2; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {7778#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {7778#false} #res := ~__retres1~2; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {7778#false} assume true; {7778#false} is VALID [2022-02-20 19:59:15,479 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7778#false} {7778#false} #1109#return; {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {7778#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {7778#false} assume 0bv32 != eval1_~tmp___1~0#1; {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {7778#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {7778#false} assume !(0bv32 != eval1_~tmp~2#1); {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L272 TraceCheckUtils]: 57: Hoare triple {7778#false} call error1(); {7778#false} is VALID [2022-02-20 19:59:15,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-02-20 19:59:15,481 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:15,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:15,481 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:15,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874086378] [2022-02-20 19:59:15,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874086378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:15,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:15,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:15,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952888226] [2022-02-20 19:59:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:15,482 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:15,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:15,483 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:15,515 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:15,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:15,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:15,516 INFO L87 Difference]: Start difference. First operand 600 states and 849 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:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:16,421 INFO L93 Difference]: Finished difference Result 991 states and 1382 transitions. [2022-02-20 19:59:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:16,421 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:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:16,422 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:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2022-02-20 19:59:16,427 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:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2022-02-20 19:59:16,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 574 transitions. [2022-02-20 19:59:16,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:16,780 INFO L225 Difference]: With dead ends: 991 [2022-02-20 19:59:16,780 INFO L226 Difference]: Without dead ends: 620 [2022-02-20 19:59:16,782 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:16,785 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 7 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2184 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:16,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2184 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:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-02-20 19:59:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 610. [2022-02-20 19:59:16,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:16,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 620 states. Second operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) [2022-02-20 19:59:16,808 INFO L74 IsIncluded]: Start isIncluded. First operand 620 states. Second operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) [2022-02-20 19:59:16,809 INFO L87 Difference]: Start difference. First operand 620 states. Second operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) [2022-02-20 19:59:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:16,826 INFO L93 Difference]: Finished difference Result 620 states and 873 transitions. [2022-02-20 19:59:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 873 transitions. [2022-02-20 19:59:16,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:16,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:16,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) Second operand 620 states. [2022-02-20 19:59:16,830 INFO L87 Difference]: Start difference. First operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) Second operand 620 states. [2022-02-20 19:59:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:16,847 INFO L93 Difference]: Finished difference Result 620 states and 873 transitions. [2022-02-20 19:59:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 873 transitions. [2022-02-20 19:59:16,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:16,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:16,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:16,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) [2022-02-20 19:59:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 857 transitions. [2022-02-20 19:59:16,869 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 857 transitions. Word has length 59 [2022-02-20 19:59:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:16,870 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 857 transitions. [2022-02-20 19:59:16,870 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:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 857 transitions. [2022-02-20 19:59:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:16,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:16,871 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:16,879 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:17,078 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:17,079 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 913980403, now seen corresponding path program 1 times [2022-02-20 19:59:17,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:17,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614598963] [2022-02-20 19:59:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:17,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:17,081 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:17,081 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:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:17,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:17,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:17,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {11363#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_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;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_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;~token~0 := 0bv32;~local~0 := 0bv32; {11363#true} is VALID [2022-02-20 19:59:17,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {11363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1; {11363#true} is VALID [2022-02-20 19:59:17,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {11363#true} assume 0bv32 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {11363#true} is VALID [2022-02-20 19:59:17,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {11363#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; {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {11363#true} call update_channels1(); {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {11363#true} assume !(1bv32 == ~q_req_up~0); {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {11363#true} assume true; {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11363#true} {11363#true} #1101#return; {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {11363#true} assume { :begin_inline_init_threads1 } true; {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {11363#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {11363#true} is VALID [2022-02-20 19:59:17,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {11363#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {11363#true} assume { :end_inline_init_threads1 } true; {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {11363#true} call fire_delta_events1(); {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {11363#true} assume !(0bv32 == ~q_read_ev~0); {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {11363#true} assume !(0bv32 == ~q_write_ev~0); {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {11363#true} assume true; {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11363#true} {11363#true} #1103#return; {11363#true} is VALID [2022-02-20 19:59:17,318 INFO L272 TraceCheckUtils]: 17: Hoare triple {11363#true} call activate_threads1(); {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {11363#true} havoc ~tmp~1;havoc ~tmp___0~1; {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L272 TraceCheckUtils]: 19: Hoare triple {11363#true} call #t~ret8 := is_do_write_p_triggered(); {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {11363#true} havoc ~__retres1~0; {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#true} assume !(1bv32 == ~p_dw_pc~0); {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {11363#true} ~__retres1~0 := 0bv32; {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {11363#true} #res := ~__retres1~0; {11363#true} is VALID [2022-02-20 19:59:17,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {11363#true} assume true; {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11363#true} {11363#true} #1097#return; {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {11363#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {11363#true} assume !(0bv32 != ~tmp~1); {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L272 TraceCheckUtils]: 28: Hoare triple {11363#true} call #t~ret9 := is_do_read_c_triggered(); {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {11363#true} havoc ~__retres1~1; {11363#true} is VALID [2022-02-20 19:59:17,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {11363#true} assume !(1bv32 == ~c_dr_pc~0); {11363#true} is VALID [2022-02-20 19:59:17,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {11363#true} ~__retres1~1 := 0bv32; {11461#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:17,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {11461#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {11465#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:17,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {11465#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {11465#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:17,322 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11465#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {11363#true} #1099#return; {11472#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:17,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {11472#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {11476#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:17,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {11476#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {11364#false} assume true; {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11364#false} {11363#true} #1105#return; {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L272 TraceCheckUtils]: 39: Hoare triple {11364#false} call reset_delta_events1(); {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {11364#false} assume !(1bv32 == ~q_read_ev~0); {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {11364#false} assume !(1bv32 == ~q_write_ev~0); {11364#false} is VALID [2022-02-20 19:59:17,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {11364#false} assume true; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11364#false} {11364#false} #1107#return; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {11364#false} assume !false; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {11364#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; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {11364#false} assume !false; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L272 TraceCheckUtils]: 47: Hoare triple {11364#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {11364#false} havoc ~__retres1~2; {11364#false} is VALID [2022-02-20 19:59:17,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {11364#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {11364#false} #res := ~__retres1~2; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {11364#false} assume true; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11364#false} {11364#false} #1109#return; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {11364#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {11364#false} assume 0bv32 != eval1_~tmp___1~0#1; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {11364#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {11364#false} is VALID [2022-02-20 19:59:17,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {11364#false} assume !(0bv32 != eval1_~tmp~2#1); {11364#false} is VALID [2022-02-20 19:59:17,326 INFO L272 TraceCheckUtils]: 57: Hoare triple {11364#false} call error1(); {11364#false} is VALID [2022-02-20 19:59:17,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {11364#false} assume !false; {11364#false} is VALID [2022-02-20 19:59:17,326 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:17,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:17,326 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:17,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614598963] [2022-02-20 19:59:17,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614598963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:17,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:17,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:17,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003275319] [2022-02-20 19:59:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:17,327 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:17,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:17,328 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:17,361 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:17,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:17,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:17,362 INFO L87 Difference]: Start difference. First operand 610 states and 857 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:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,269 INFO L93 Difference]: Finished difference Result 1005 states and 1388 transitions. [2022-02-20 19:59:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:18,270 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:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:18,270 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:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-02-20 19:59:18,274 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:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-02-20 19:59:18,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-02-20 19:59:18,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,629 INFO L225 Difference]: With dead ends: 1005 [2022-02-20 19:59:18,629 INFO L226 Difference]: Without dead ends: 624 [2022-02-20 19:59:18,630 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:18,630 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 4 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2185 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:18,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2185 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:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-02-20 19:59:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2022-02-20 19:59:18,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:18,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) [2022-02-20 19:59:18,646 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) [2022-02-20 19:59:18,647 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) [2022-02-20 19:59:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,664 INFO L93 Difference]: Finished difference Result 624 states and 871 transitions. [2022-02-20 19:59:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 871 transitions. [2022-02-20 19:59:18,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) Second operand 624 states. [2022-02-20 19:59:18,668 INFO L87 Difference]: Start difference. First operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) Second operand 624 states. [2022-02-20 19:59:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,684 INFO L93 Difference]: Finished difference Result 624 states and 871 transitions. [2022-02-20 19:59:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 871 transitions. [2022-02-20 19:59:18,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:18,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) [2022-02-20 19:59:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 865 transitions. [2022-02-20 19:59:18,708 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 865 transitions. Word has length 59 [2022-02-20 19:59:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:18,709 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 865 transitions. [2022-02-20 19:59:18,709 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:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 865 transitions. [2022-02-20 19:59:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:18,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,710 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,733 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:18,915 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:18,915 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2022-02-20 19:59:18,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:18,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20596446] [2022-02-20 19:59:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:18,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:18,919 INFO L229 MonitoredProcess]: Starting monitored process 7 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:18,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 19:59:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:19,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:19,107 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:19,107 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:19,108 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:19,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:19,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:19,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:19,320 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:19,323 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:19,382 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:19,383 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:19,386 INFO L158 Benchmark]: Toolchain (without parser) took 12367.89ms. Allocated memory was 62.9MB in the beginning and 142.6MB in the end (delta: 79.7MB). Free memory was 41.8MB in the beginning and 91.9MB in the end (delta: -50.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,386 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:19,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.41ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 37.4MB in the end (delta: 4.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.28ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 33.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,387 INFO L158 Benchmark]: Boogie Preprocessor took 65.72ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 29.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,387 INFO L158 Benchmark]: RCFGBuilder took 640.82ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 29.6MB in the beginning and 39.8MB in the end (delta: -10.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,387 INFO L158 Benchmark]: TraceAbstraction took 11204.63ms. Allocated memory was 86.0MB in the beginning and 142.6MB in the end (delta: 56.6MB). Free memory was 39.5MB in the beginning and 91.9MB in the end (delta: -52.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:19,389 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.16ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.41ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 37.4MB in the end (delta: 4.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.28ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 33.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.72ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 29.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 640.82ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 29.6MB in the beginning and 39.8MB in the end (delta: -10.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11204.63ms. Allocated memory was 86.0MB in the beginning and 142.6MB in the end (delta: 56.6MB). Free memory was 39.5MB in the beginning and 91.9MB in the end (delta: -52.4MB). Peak memory consumption was 5.3MB. 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:19,411 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