./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:29,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:29,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:29,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:29,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:29,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:29,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:29,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:29,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:29,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:29,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:29,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:29,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:29,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:29,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:29,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:29,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:29,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:29,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:29,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:29,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:29,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:29,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:29,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:29,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:29,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:29,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:29,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:29,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:29,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:29,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:29,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:29,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:29,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:29,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:29,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:29,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:29,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:29,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:29,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:29,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:29,273 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:29,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:29,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:29,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:29,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:29,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:29,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:29,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:29,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:29,308 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:29,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:29,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:29,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:29,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:29,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:29,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:29,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:29,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:29,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:29,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:29,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:29,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:29,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:29,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:29,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:29,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:29,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:29,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:29,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:29,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:29,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:29,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:29,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:29,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:29,315 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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2022-02-20 19:58:29,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:29,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:29,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:29,549 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:29,551 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:29,552 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.01.cil-1.c [2022-02-20 19:58:29,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e09805a/1f648c97da8f4347a8dbc2e7b30d9615/FLAGd2d4815c3 [2022-02-20 19:58:29,941 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:29,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-02-20 19:58:29,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e09805a/1f648c97da8f4347a8dbc2e7b30d9615/FLAGd2d4815c3 [2022-02-20 19:58:30,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e09805a/1f648c97da8f4347a8dbc2e7b30d9615 [2022-02-20 19:58:30,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:30,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:30,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:30,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:30,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:30,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:30" (1/1) ... [2022-02-20 19:58:30,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd41ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:30, skipping insertion in model container [2022-02-20 19:58:30,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:30" (1/1) ... [2022-02-20 19:58:30,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:30,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:30,549 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.01.cil-1.c[914,927] [2022-02-20 19:58:30,614 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.01.cil-1.c[7125,7138] [2022-02-20 19:58:30,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:30,645 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:30,656 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.01.cil-1.c[914,927] [2022-02-20 19:58:30,695 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.01.cil-1.c[7125,7138] [2022-02-20 19:58:30,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:30,732 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:30,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:30 WrapperNode [2022-02-20 19:58:30,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:30,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:30,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:30,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:30,741 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:30" (1/1) ... [2022-02-20 19:58:30,760 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:30" (1/1) ... [2022-02-20 19:58:30,811 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 403 [2022-02-20 19:58:30,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:30,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:30,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:30,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:30,825 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:30" (1/1) ... [2022-02-20 19:58:30,825 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:30" (1/1) ... [2022-02-20 19:58:30,834 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:30" (1/1) ... [2022-02-20 19:58:30,837 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:30" (1/1) ... [2022-02-20 19:58:30,846 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:30" (1/1) ... [2022-02-20 19:58:30,864 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:30" (1/1) ... [2022-02-20 19:58:30,867 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:30" (1/1) ... [2022-02-20 19:58:30,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:30,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:30,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:30,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:30,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:30" (1/1) ... [2022-02-20 19:58:30,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:30,898 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:30,900 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:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:31,018 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:31,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:31,470 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:31,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:31,486 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:58:31,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:31 BoogieIcfgContainer [2022-02-20 19:58:31,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:31,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:31,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:31,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:31,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:30" (1/3) ... [2022-02-20 19:58:31,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4f7b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:31, skipping insertion in model container [2022-02-20 19:58:31,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:30" (2/3) ... [2022-02-20 19:58:31,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4f7b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:31, skipping insertion in model container [2022-02-20 19:58:31,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:31" (3/3) ... [2022-02-20 19:58:31,498 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-02-20 19:58:31,507 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:31,507 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:31,566 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:31,573 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:31,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 19:58:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:31,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:31,610 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:31,611 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:31,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 740240985, now seen corresponding path program 1 times [2022-02-20 19:58:31,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:31,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336234949] [2022-02-20 19:58:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(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); {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:31,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {214#(= ~q_read_ev~0 2)} #653#return; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#(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; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#(= |old(~q_read_ev~0)| 0)} assume true; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:31,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255#(= |old(~q_read_ev~0)| 0)} {214#(= ~q_read_ev~0 2)} #655#return; {213#false} is VALID [2022-02-20 19:58:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} havoc ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:31,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume 1 == ~p_dw_pc~0; {212#true} is VALID [2022-02-20 19:58:31,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {212#true} is VALID [2022-02-20 19:58:31,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#true} #res := ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:31,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:31,995 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {212#true} {212#true} #649#return; {212#true} is VALID [2022-02-20 19:58:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} havoc ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume 1 == ~c_dr_pc~0; {212#true} is VALID [2022-02-20 19:58:32,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {212#true} is VALID [2022-02-20 19:58:32,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#true} #res := ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,002 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {212#true} {212#true} #651#return; {212#true} is VALID [2022-02-20 19:58:32,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#(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; {212#true} is VALID [2022-02-20 19:58:32,003 INFO L272 TraceCheckUtils]: 1: Hoare triple {212#true} call #t~ret8 := is_do_write_p_triggered(); {212#true} is VALID [2022-02-20 19:58:32,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} havoc ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:32,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#true} assume 1 == ~p_dw_pc~0; {212#true} is VALID [2022-02-20 19:58:32,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {212#true} is VALID [2022-02-20 19:58:32,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} #res := ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:32,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,004 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {212#true} {212#true} #649#return; {212#true} is VALID [2022-02-20 19:58:32,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {212#true} is VALID [2022-02-20 19:58:32,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {212#true} is VALID [2022-02-20 19:58:32,005 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#true} call #t~ret9 := is_do_read_c_triggered(); {212#true} is VALID [2022-02-20 19:58:32,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#true} havoc ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#true} assume 1 == ~c_dr_pc~0; {212#true} is VALID [2022-02-20 19:58:32,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {212#true} is VALID [2022-02-20 19:58:32,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {212#true} #res := ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,006 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {212#true} {212#true} #651#return; {212#true} is VALID [2022-02-20 19:58:32,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {212#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {212#true} is VALID [2022-02-20 19:58:32,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {212#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {212#true} is VALID [2022-02-20 19:58:32,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,008 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {212#true} {213#false} #657#return; {213#false} is VALID [2022-02-20 19:58:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#(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; {212#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {212#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {213#false} #659#return; {213#false} is VALID [2022-02-20 19:58:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} havoc ~__retres1~2; {212#true} is VALID [2022-02-20 19:58:32,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {212#true} is VALID [2022-02-20 19:58:32,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} #res := ~__retres1~2; {212#true} is VALID [2022-02-20 19:58:32,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,023 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {212#true} {213#false} #661#return; {213#false} is VALID [2022-02-20 19:58:32,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {212#true} is VALID [2022-02-20 19:58:32,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {212#true} is VALID [2022-02-20 19:58:32,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(= ~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; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#(= ~q_read_ev~0 2)} call update_channels1(); {252#(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:32,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#(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); {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:32,028 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {253#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {214#(= ~q_read_ev~0 2)} #653#return; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {214#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:32,031 INFO L272 TraceCheckUtils]: 12: Hoare triple {214#(= ~q_read_ev~0 2)} call fire_delta_events1(); {254#(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:32,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#(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; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:32,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:32,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {255#(= |old(~q_read_ev~0)| 0)} assume true; {255#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:32,033 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {255#(= |old(~q_read_ev~0)| 0)} {214#(= ~q_read_ev~0 2)} #655#return; {213#false} is VALID [2022-02-20 19:58:32,033 INFO L272 TraceCheckUtils]: 17: Hoare triple {213#false} call activate_threads1(); {256#(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:32,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {256#(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; {212#true} is VALID [2022-02-20 19:58:32,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {212#true} call #t~ret8 := is_do_write_p_triggered(); {212#true} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {212#true} havoc ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {212#true} assume 1 == ~p_dw_pc~0; {212#true} is VALID [2022-02-20 19:58:32,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {212#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {212#true} is VALID [2022-02-20 19:58:32,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {212#true} #res := ~__retres1~0; {212#true} is VALID [2022-02-20 19:58:32,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,035 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {212#true} {212#true} #649#return; {212#true} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {212#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {212#true} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {212#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {212#true} is VALID [2022-02-20 19:58:32,036 INFO L272 TraceCheckUtils]: 28: Hoare triple {212#true} call #t~ret9 := is_do_read_c_triggered(); {212#true} is VALID [2022-02-20 19:58:32,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {212#true} havoc ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {212#true} assume 1 == ~c_dr_pc~0; {212#true} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {212#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {212#true} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {212#true} #res := ~__retres1~1; {212#true} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,038 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {212#true} {212#true} #651#return; {212#true} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {212#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {212#true} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {212#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {212#true} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,039 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {212#true} {213#false} #657#return; {213#false} is VALID [2022-02-20 19:58:32,039 INFO L272 TraceCheckUtils]: 39: Hoare triple {213#false} call reset_delta_events1(); {254#(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:32,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {254#(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; {212#true} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {212#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {212#true} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,040 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {212#true} {213#false} #659#return; {213#false} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {213#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; {213#false} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:58:32,041 INFO L272 TraceCheckUtils]: 47: Hoare triple {213#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {212#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {212#true} havoc ~__retres1~2; {212#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {212#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {212#true} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {212#true} #res := ~__retres1~2; {212#true} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {212#true} assume true; {212#true} is VALID [2022-02-20 19:58:32,042 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {212#true} {213#false} #661#return; {213#false} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {213#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; {213#false} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {213#false} assume 0 != eval1_~tmp___1~0#1; {213#false} is VALID [2022-02-20 19:58:32,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {213#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; {213#false} is VALID [2022-02-20 19:58:32,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {213#false} assume !(0 != eval1_~tmp~2#1); {213#false} is VALID [2022-02-20 19:58:32,043 INFO L272 TraceCheckUtils]: 57: Hoare triple {213#false} call error1(); {213#false} is VALID [2022-02-20 19:58:32,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:58:32,044 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:32,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:32,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336234949] [2022-02-20 19:58:32,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336234949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:32,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:32,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:32,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736387717] [2022-02-20 19:58:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,060 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:32,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,067 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:32,121 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:32,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:32,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:32,144 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:34,326 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2022-02-20 19:58:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:34,327 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:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:34,329 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:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 798 transitions. [2022-02-20 19:58:34,358 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:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 798 transitions. [2022-02-20 19:58:34,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 798 transitions. [2022-02-20 19:58:35,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:35,076 INFO L225 Difference]: With dead ends: 537 [2022-02-20 19:58:35,076 INFO L226 Difference]: Without dead ends: 335 [2022-02-20 19:58:35,080 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:35,083 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 664 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:35,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 820 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-02-20 19:58:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 295. [2022-02-20 19:58:35,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:35,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:58:35,138 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:58:35,140 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:58:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,159 INFO L93 Difference]: Finished difference Result 335 states and 464 transitions. [2022-02-20 19:58:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2022-02-20 19:58:35,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:35,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:35,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 335 states. [2022-02-20 19:58:35,166 INFO L87 Difference]: Start difference. First operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 335 states. [2022-02-20 19:58:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,184 INFO L93 Difference]: Finished difference Result 335 states and 464 transitions. [2022-02-20 19:58:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2022-02-20 19:58:35,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:35,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:35,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:35,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:58:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 409 transitions. [2022-02-20 19:58:35,204 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 409 transitions. Word has length 59 [2022-02-20 19:58:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:35,205 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 409 transitions. [2022-02-20 19:58:35,205 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:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2022-02-20 19:58:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:35,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:35,207 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:35,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:35,208 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1502890616, now seen corresponding path program 1 times [2022-02-20 19:58:35,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:35,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446794631] [2022-02-20 19:58:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {2156#(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); {2157#(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:35,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2157#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2157#(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:35,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2157#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2118#(= ~q_write_ev~0 ~q_read_ev~0)} #653#return; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {2157#(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); {2158#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {2158#(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; {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2118#(= ~q_write_ev~0 ~q_read_ev~0)} #655#return; {2117#false} is VALID [2022-02-20 19:58:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {2116#true} havoc ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume !(1 == ~p_dw_pc~0); {2116#true} is VALID [2022-02-20 19:58:35,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} ~__retres1~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {2116#true} #res := ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,323 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2116#true} {2116#true} #649#return; {2116#true} is VALID [2022-02-20 19:58:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {2116#true} havoc ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume 1 == ~c_dr_pc~0; {2116#true} is VALID [2022-02-20 19:58:35,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2116#true} is VALID [2022-02-20 19:58:35,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {2116#true} #res := ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,328 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2116#true} {2116#true} #651#return; {2116#true} is VALID [2022-02-20 19:58:35,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {2160#(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; {2116#true} is VALID [2022-02-20 19:58:35,328 INFO L272 TraceCheckUtils]: 1: Hoare triple {2116#true} call #t~ret8 := is_do_write_p_triggered(); {2116#true} is VALID [2022-02-20 19:58:35,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} havoc ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {2116#true} assume !(1 == ~p_dw_pc~0); {2116#true} is VALID [2022-02-20 19:58:35,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {2116#true} ~__retres1~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {2116#true} #res := ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,330 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2116#true} {2116#true} #649#return; {2116#true} is VALID [2022-02-20 19:58:35,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {2116#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2116#true} is VALID [2022-02-20 19:58:35,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {2116#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,330 INFO L272 TraceCheckUtils]: 10: Hoare triple {2116#true} call #t~ret9 := is_do_read_c_triggered(); {2116#true} is VALID [2022-02-20 19:58:35,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {2116#true} havoc ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {2116#true} assume 1 == ~c_dr_pc~0; {2116#true} is VALID [2022-02-20 19:58:35,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {2116#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2116#true} is VALID [2022-02-20 19:58:35,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {2116#true} #res := ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2116#true} {2116#true} #651#return; {2116#true} is VALID [2022-02-20 19:58:35,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {2116#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2116#true} is VALID [2022-02-20 19:58:35,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {2116#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,333 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2116#true} {2117#false} #657#return; {2117#false} is VALID [2022-02-20 19:58:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {2157#(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); {2116#true} is VALID [2022-02-20 19:58:35,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2116#true} is VALID [2022-02-20 19:58:35,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2116#true} {2117#false} #659#return; {2117#false} is VALID [2022-02-20 19:58:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {2116#true} havoc ~__retres1~2; {2116#true} is VALID [2022-02-20 19:58:35,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2116#true} is VALID [2022-02-20 19:58:35,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} #res := ~__retres1~2; {2116#true} is VALID [2022-02-20 19:58:35,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,343 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2116#true} {2117#false} #661#return; {2117#false} is VALID [2022-02-20 19:58:35,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {2116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {2116#true} is VALID [2022-02-20 19:58:35,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {2118#(= ~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; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2156#(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:35,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2156#(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); {2157#(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:35,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2157#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2157#(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:35,347 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2157#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2118#(= ~q_write_ev~0 ~q_read_ev~0)} #653#return; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2118#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {2118#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2157#(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:35,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {2157#(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); {2158#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {2158#(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; {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,351 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2159#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2118#(= ~q_write_ev~0 ~q_read_ev~0)} #655#return; {2117#false} is VALID [2022-02-20 19:58:35,351 INFO L272 TraceCheckUtils]: 17: Hoare triple {2117#false} call activate_threads1(); {2160#(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:35,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(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; {2116#true} is VALID [2022-02-20 19:58:35,352 INFO L272 TraceCheckUtils]: 19: Hoare triple {2116#true} call #t~ret8 := is_do_write_p_triggered(); {2116#true} is VALID [2022-02-20 19:58:35,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {2116#true} havoc ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {2116#true} assume !(1 == ~p_dw_pc~0); {2116#true} is VALID [2022-02-20 19:58:35,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {2116#true} ~__retres1~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {2116#true} #res := ~__retres1~0; {2116#true} is VALID [2022-02-20 19:58:35,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,353 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2116#true} {2116#true} #649#return; {2116#true} is VALID [2022-02-20 19:58:35,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {2116#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2116#true} is VALID [2022-02-20 19:58:35,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {2116#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {2116#true} call #t~ret9 := is_do_read_c_triggered(); {2116#true} is VALID [2022-02-20 19:58:35,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {2116#true} havoc ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {2116#true} assume 1 == ~c_dr_pc~0; {2116#true} is VALID [2022-02-20 19:58:35,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {2116#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2116#true} is VALID [2022-02-20 19:58:35,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {2116#true} #res := ~__retres1~1; {2116#true} is VALID [2022-02-20 19:58:35,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,355 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2116#true} {2116#true} #651#return; {2116#true} is VALID [2022-02-20 19:58:35,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {2116#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2116#true} is VALID [2022-02-20 19:58:35,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {2116#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2116#true} is VALID [2022-02-20 19:58:35,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,356 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2116#true} {2117#false} #657#return; {2117#false} is VALID [2022-02-20 19:58:35,356 INFO L272 TraceCheckUtils]: 39: Hoare triple {2117#false} call reset_delta_events1(); {2157#(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:35,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2157#(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); {2116#true} is VALID [2022-02-20 19:58:35,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {2116#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2116#true} is VALID [2022-02-20 19:58:35,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,357 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2116#true} {2117#false} #659#return; {2117#false} is VALID [2022-02-20 19:58:35,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:58:35,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {2117#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; {2117#false} is VALID [2022-02-20 19:58:35,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:58:35,358 INFO L272 TraceCheckUtils]: 47: Hoare triple {2117#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2116#true} is VALID [2022-02-20 19:58:35,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {2116#true} havoc ~__retres1~2; {2116#true} is VALID [2022-02-20 19:58:35,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {2116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2116#true} is VALID [2022-02-20 19:58:35,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {2116#true} #res := ~__retres1~2; {2116#true} is VALID [2022-02-20 19:58:35,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {2116#true} assume true; {2116#true} is VALID [2022-02-20 19:58:35,359 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2116#true} {2117#false} #661#return; {2117#false} is VALID [2022-02-20 19:58:35,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {2117#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; {2117#false} is VALID [2022-02-20 19:58:35,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {2117#false} assume 0 != eval1_~tmp___1~0#1; {2117#false} is VALID [2022-02-20 19:58:35,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {2117#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; {2117#false} is VALID [2022-02-20 19:58:35,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#false} assume !(0 != eval1_~tmp~2#1); {2117#false} is VALID [2022-02-20 19:58:35,360 INFO L272 TraceCheckUtils]: 57: Hoare triple {2117#false} call error1(); {2117#false} is VALID [2022-02-20 19:58:35,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:58:35,360 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:35,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:35,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446794631] [2022-02-20 19:58:35,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446794631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:35,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:35,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:35,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420352639] [2022-02-20 19:58:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:35,363 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:35,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:35,364 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:35,413 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:35,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:35,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:35,414 INFO L87 Difference]: Start difference. First operand 295 states and 409 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:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:37,859 INFO L93 Difference]: Finished difference Result 644 states and 888 transitions. [2022-02-20 19:58:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:37,859 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:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:37,860 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:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-02-20 19:58:37,871 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:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-02-20 19:58:37,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 617 transitions. [2022-02-20 19:58:38,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:38,358 INFO L225 Difference]: With dead ends: 644 [2022-02-20 19:58:38,358 INFO L226 Difference]: Without dead ends: 466 [2022-02-20 19:58:38,360 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:38,361 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 720 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:38,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 1044 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-02-20 19:58:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 391. [2022-02-20 19:58:38,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:38,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2022-02-20 19:58:38,403 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2022-02-20 19:58:38,405 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2022-02-20 19:58:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:38,424 INFO L93 Difference]: Finished difference Result 466 states and 647 transitions. [2022-02-20 19:58:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2022-02-20 19:58:38,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:38,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:38,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) Second operand 466 states. [2022-02-20 19:58:38,429 INFO L87 Difference]: Start difference. First operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) Second operand 466 states. [2022-02-20 19:58:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:38,449 INFO L93 Difference]: Finished difference Result 466 states and 647 transitions. [2022-02-20 19:58:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2022-02-20 19:58:38,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:38,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:38,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:38,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2022-02-20 19:58:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 543 transitions. [2022-02-20 19:58:38,470 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 543 transitions. Word has length 59 [2022-02-20 19:58:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:38,470 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 543 transitions. [2022-02-20 19:58:38,470 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:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 543 transitions. [2022-02-20 19:58:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:38,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:38,472 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:38,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:38,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1898590342, now seen corresponding path program 1 times [2022-02-20 19:58:38,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:38,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749167912] [2022-02-20 19:58:38,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {4592#(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); {4553#true} is VALID [2022-02-20 19:58:38,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4553#true} {4553#true} #653#return; {4553#true} is VALID [2022-02-20 19:58:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {4593#(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); {4553#true} is VALID [2022-02-20 19:58:38,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume !(0 == ~q_write_ev~0); {4553#true} is VALID [2022-02-20 19:58:38,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4553#true} {4553#true} #655#return; {4553#true} is VALID [2022-02-20 19:58:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#true} havoc ~__retres1~0; {4553#true} is VALID [2022-02-20 19:58:38,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume !(1 == ~p_dw_pc~0); {4553#true} is VALID [2022-02-20 19:58:38,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} ~__retres1~0 := 0; {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:38,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,629 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4553#true} #649#return; {4601#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#true} havoc ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume 1 == ~c_dr_pc~0; {4553#true} is VALID [2022-02-20 19:58:38,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4553#true} is VALID [2022-02-20 19:58:38,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {4553#true} #res := ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,639 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4553#true} {4554#false} #651#return; {4554#false} is VALID [2022-02-20 19:58:38,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {4594#(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; {4553#true} is VALID [2022-02-20 19:58:38,641 INFO L272 TraceCheckUtils]: 1: Hoare triple {4553#true} call #t~ret8 := is_do_write_p_triggered(); {4553#true} is VALID [2022-02-20 19:58:38,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} havoc ~__retres1~0; {4553#true} is VALID [2022-02-20 19:58:38,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {4553#true} assume !(1 == ~p_dw_pc~0); {4553#true} is VALID [2022-02-20 19:58:38,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {4553#true} ~__retres1~0 := 0; {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:38,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,644 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4553#true} #649#return; {4601#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:38,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {4601#(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; {4602#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:38,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {4602#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4554#false} is VALID [2022-02-20 19:58:38,645 INFO L272 TraceCheckUtils]: 10: Hoare triple {4554#false} call #t~ret9 := is_do_read_c_triggered(); {4553#true} is VALID [2022-02-20 19:58:38,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {4553#true} havoc ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {4553#true} assume 1 == ~c_dr_pc~0; {4553#true} is VALID [2022-02-20 19:58:38,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {4553#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4553#true} is VALID [2022-02-20 19:58:38,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {4553#true} #res := ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,652 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4553#true} {4554#false} #651#return; {4554#false} is VALID [2022-02-20 19:58:38,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {4554#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4554#false} is VALID [2022-02-20 19:58:38,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {4554#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4554#false} is VALID [2022-02-20 19:58:38,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {4554#false} assume true; {4554#false} is VALID [2022-02-20 19:58:38,658 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4554#false} {4553#true} #657#return; {4554#false} is VALID [2022-02-20 19:58:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {4593#(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); {4553#true} is VALID [2022-02-20 19:58:38,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4553#true} is VALID [2022-02-20 19:58:38,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4553#true} {4554#false} #659#return; {4554#false} is VALID [2022-02-20 19:58:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:38,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#true} havoc ~__retres1~2; {4553#true} is VALID [2022-02-20 19:58:38,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4553#true} is VALID [2022-02-20 19:58:38,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} #res := ~__retres1~2; {4553#true} is VALID [2022-02-20 19:58:38,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,674 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4553#true} {4554#false} #661#return; {4554#false} is VALID [2022-02-20 19:58:38,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {4553#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {4553#true} is VALID [2022-02-20 19:58:38,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {4553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {4553#true} is VALID [2022-02-20 19:58:38,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {4553#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {4553#true} is VALID [2022-02-20 19:58:38,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {4553#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; {4553#true} is VALID [2022-02-20 19:58:38,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {4553#true} call update_channels1(); {4592#(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:38,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {4592#(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); {4553#true} is VALID [2022-02-20 19:58:38,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,676 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4553#true} {4553#true} #653#return; {4553#true} is VALID [2022-02-20 19:58:38,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {4553#true} assume { :begin_inline_init_threads1 } true; {4553#true} is VALID [2022-02-20 19:58:38,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {4553#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4553#true} is VALID [2022-02-20 19:58:38,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4553#true} is VALID [2022-02-20 19:58:38,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {4553#true} assume { :end_inline_init_threads1 } true; {4553#true} is VALID [2022-02-20 19:58:38,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {4553#true} call fire_delta_events1(); {4593#(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:38,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {4593#(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); {4553#true} is VALID [2022-02-20 19:58:38,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {4553#true} assume !(0 == ~q_write_ev~0); {4553#true} is VALID [2022-02-20 19:58:38,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,678 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4553#true} {4553#true} #655#return; {4553#true} is VALID [2022-02-20 19:58:38,681 INFO L272 TraceCheckUtils]: 17: Hoare triple {4553#true} call activate_threads1(); {4594#(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:38,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {4594#(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; {4553#true} is VALID [2022-02-20 19:58:38,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {4553#true} call #t~ret8 := is_do_write_p_triggered(); {4553#true} is VALID [2022-02-20 19:58:38,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#true} havoc ~__retres1~0; {4553#true} is VALID [2022-02-20 19:58:38,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {4553#true} assume !(1 == ~p_dw_pc~0); {4553#true} is VALID [2022-02-20 19:58:38,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {4553#true} ~__retres1~0 := 0; {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:38,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {4609#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:38,684 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4610#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4553#true} #649#return; {4601#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:38,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {4601#(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; {4602#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:38,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {4602#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4554#false} is VALID [2022-02-20 19:58:38,686 INFO L272 TraceCheckUtils]: 28: Hoare triple {4554#false} call #t~ret9 := is_do_read_c_triggered(); {4553#true} is VALID [2022-02-20 19:58:38,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {4553#true} havoc ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {4553#true} assume 1 == ~c_dr_pc~0; {4553#true} is VALID [2022-02-20 19:58:38,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {4553#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4553#true} is VALID [2022-02-20 19:58:38,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {4553#true} #res := ~__retres1~1; {4553#true} is VALID [2022-02-20 19:58:38,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,687 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4553#true} {4554#false} #651#return; {4554#false} is VALID [2022-02-20 19:58:38,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {4554#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4554#false} is VALID [2022-02-20 19:58:38,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {4554#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4554#false} is VALID [2022-02-20 19:58:38,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {4554#false} assume true; {4554#false} is VALID [2022-02-20 19:58:38,688 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4554#false} {4553#true} #657#return; {4554#false} is VALID [2022-02-20 19:58:38,688 INFO L272 TraceCheckUtils]: 39: Hoare triple {4554#false} call reset_delta_events1(); {4593#(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:38,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {4593#(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); {4553#true} is VALID [2022-02-20 19:58:38,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {4553#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4553#true} is VALID [2022-02-20 19:58:38,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,689 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4553#true} {4554#false} #659#return; {4554#false} is VALID [2022-02-20 19:58:38,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {4554#false} assume !false; {4554#false} is VALID [2022-02-20 19:58:38,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {4554#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; {4554#false} is VALID [2022-02-20 19:58:38,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {4554#false} assume !false; {4554#false} is VALID [2022-02-20 19:58:38,689 INFO L272 TraceCheckUtils]: 47: Hoare triple {4554#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4553#true} is VALID [2022-02-20 19:58:38,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {4553#true} havoc ~__retres1~2; {4553#true} is VALID [2022-02-20 19:58:38,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {4553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4553#true} is VALID [2022-02-20 19:58:38,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {4553#true} #res := ~__retres1~2; {4553#true} is VALID [2022-02-20 19:58:38,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {4553#true} assume true; {4553#true} is VALID [2022-02-20 19:58:38,690 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4553#true} {4554#false} #661#return; {4554#false} is VALID [2022-02-20 19:58:38,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {4554#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; {4554#false} is VALID [2022-02-20 19:58:38,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {4554#false} assume 0 != eval1_~tmp___1~0#1; {4554#false} is VALID [2022-02-20 19:58:38,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {4554#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; {4554#false} is VALID [2022-02-20 19:58:38,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {4554#false} assume !(0 != eval1_~tmp~2#1); {4554#false} is VALID [2022-02-20 19:58:38,691 INFO L272 TraceCheckUtils]: 57: Hoare triple {4554#false} call error1(); {4554#false} is VALID [2022-02-20 19:58:38,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {4554#false} assume !false; {4554#false} is VALID [2022-02-20 19:58:38,694 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:38,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:38,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749167912] [2022-02-20 19:58:38,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749167912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:38,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:38,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:38,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222600352] [2022-02-20 19:58:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:38,697 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:38,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:38,698 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:38,736 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:38,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:38,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:38,738 INFO L87 Difference]: Start difference. First operand 391 states and 543 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:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:40,647 INFO L93 Difference]: Finished difference Result 693 states and 958 transitions. [2022-02-20 19:58:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:40,647 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:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:40,648 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:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 434 transitions. [2022-02-20 19:58:40,654 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:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 434 transitions. [2022-02-20 19:58:40,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 434 transitions. [2022-02-20 19:58:40,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:40,993 INFO L225 Difference]: With dead ends: 693 [2022-02-20 19:58:40,994 INFO L226 Difference]: Without dead ends: 425 [2022-02-20 19:58:40,994 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:40,996 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 210 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:40,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1201 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:58:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-02-20 19:58:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 396. [2022-02-20 19:58:41,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:41,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2022-02-20 19:58:41,022 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2022-02-20 19:58:41,023 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2022-02-20 19:58:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,038 INFO L93 Difference]: Finished difference Result 425 states and 587 transitions. [2022-02-20 19:58:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 587 transitions. [2022-02-20 19:58:41,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) Second operand 425 states. [2022-02-20 19:58:41,041 INFO L87 Difference]: Start difference. First operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) Second operand 425 states. [2022-02-20 19:58:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,055 INFO L93 Difference]: Finished difference Result 425 states and 587 transitions. [2022-02-20 19:58:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 587 transitions. [2022-02-20 19:58:41,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:41,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2022-02-20 19:58:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 546 transitions. [2022-02-20 19:58:41,073 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 546 transitions. Word has length 59 [2022-02-20 19:58:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:41,074 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 546 transitions. [2022-02-20 19:58:41,074 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:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 546 transitions. [2022-02-20 19:58:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:41,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:41,075 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:41,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:41,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1623830728, now seen corresponding path program 1 times [2022-02-20 19:58:41,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:41,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040993226] [2022-02-20 19:58:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {7011#(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); {6971#true} is VALID [2022-02-20 19:58:41,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #653#return; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {7012#(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); {6971#true} is VALID [2022-02-20 19:58:41,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume !(0 == ~q_write_ev~0); {6971#true} is VALID [2022-02-20 19:58:41,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #655#return; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {6971#true} havoc ~__retres1~0; {6971#true} is VALID [2022-02-20 19:58:41,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume !(1 == ~p_dw_pc~0); {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,210 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {6971#true} #649#return; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {6971#true} havoc ~__retres1~1; {6971#true} is VALID [2022-02-20 19:58:41,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume 1 == ~c_dr_pc~0; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,232 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #651#return; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {7013#(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; {6971#true} is VALID [2022-02-20 19:58:41,233 INFO L272 TraceCheckUtils]: 1: Hoare triple {6971#true} call #t~ret8 := is_do_write_p_triggered(); {6971#true} is VALID [2022-02-20 19:58:41,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} havoc ~__retres1~0; {6971#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {6971#true} assume !(1 == ~p_dw_pc~0); {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,235 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {6971#true} #649#return; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,236 INFO L272 TraceCheckUtils]: 10: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {6971#true} is VALID [2022-02-20 19:58:41,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {6971#true} havoc ~__retres1~1; {6971#true} is VALID [2022-02-20 19:58:41,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {6971#true} assume 1 == ~c_dr_pc~0; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,239 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #651#return; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,241 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #657#return; {6972#false} is VALID [2022-02-20 19:58:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {7012#(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); {6971#true} is VALID [2022-02-20 19:58:41,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6971#true} is VALID [2022-02-20 19:58:41,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6972#false} #659#return; {6972#false} is VALID [2022-02-20 19:58:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {6971#true} havoc ~__retres1~2; {6971#true} is VALID [2022-02-20 19:58:41,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6971#true} is VALID [2022-02-20 19:58:41,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} #res := ~__retres1~2; {6971#true} is VALID [2022-02-20 19:58:41,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,251 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6971#true} {6972#false} #661#return; {6972#false} is VALID [2022-02-20 19:58:41,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {6971#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {6971#true} is VALID [2022-02-20 19:58:41,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {6971#true} is VALID [2022-02-20 19:58:41,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} call update_channels1(); {7011#(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:41,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {7011#(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); {6971#true} is VALID [2022-02-20 19:58:41,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,254 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6971#true} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #653#return; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :begin_inline_init_threads1 } true; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} assume { :end_inline_init_threads1 } true; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,256 INFO L272 TraceCheckUtils]: 12: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} call fire_delta_events1(); {7012#(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:41,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {7012#(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); {6971#true} is VALID [2022-02-20 19:58:41,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {6971#true} assume !(0 == ~q_write_ev~0); {6971#true} is VALID [2022-02-20 19:58:41,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6971#true} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #655#return; {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:41,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} call activate_threads1(); {7013#(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:41,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {7013#(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; {6971#true} is VALID [2022-02-20 19:58:41,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {6971#true} call #t~ret8 := is_do_write_p_triggered(); {6971#true} is VALID [2022-02-20 19:58:41,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {6971#true} havoc ~__retres1~0; {6971#true} is VALID [2022-02-20 19:58:41,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {6971#true} assume !(1 == ~p_dw_pc~0); {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} ~__retres1~0 := 0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #res := ~__retres1~0; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume true; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,260 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} {6971#true} #649#return; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} assume !(0 != ~tmp~1); {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} is VALID [2022-02-20 19:58:41,261 INFO L272 TraceCheckUtils]: 28: Hoare triple {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} call #t~ret9 := is_do_read_c_triggered(); {6971#true} is VALID [2022-02-20 19:58:41,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {6971#true} havoc ~__retres1~1; {6971#true} is VALID [2022-02-20 19:58:41,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {6971#true} assume 1 == ~c_dr_pc~0; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} #res := ~__retres1~1; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} assume true; {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:41,263 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7028#(and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1))} {7020#(or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))} #651#return; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} assume true; {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} is VALID [2022-02-20 19:58:41,266 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7027#(and (or (not (<= ~p_dw_pc~0 0)) (<= 1 ~c_dr_pc~0)) (or (<= ~p_dw_pc~0 0) (and (<= ~c_dr_pc~0 1) (not (<= ~p_dw_pc~0 1)))))} {6973#(= ~c_dr_pc~0 ~p_dw_pc~0)} #657#return; {6972#false} is VALID [2022-02-20 19:58:41,266 INFO L272 TraceCheckUtils]: 39: Hoare triple {6972#false} call reset_delta_events1(); {7012#(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:41,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {7012#(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); {6971#true} is VALID [2022-02-20 19:58:41,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {6971#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6971#true} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,267 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6971#true} {6972#false} #659#return; {6972#false} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {6972#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; {6972#false} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-02-20 19:58:41,267 INFO L272 TraceCheckUtils]: 47: Hoare triple {6972#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6971#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {6971#true} havoc ~__retres1~2; {6971#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {6971#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6971#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {6971#true} #res := ~__retres1~2; {6971#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-02-20 19:58:41,268 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6971#true} {6972#false} #661#return; {6972#false} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {6972#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; {6972#false} is VALID [2022-02-20 19:58:41,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {6972#false} assume 0 != eval1_~tmp___1~0#1; {6972#false} is VALID [2022-02-20 19:58:41,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {6972#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; {6972#false} is VALID [2022-02-20 19:58:41,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {6972#false} assume !(0 != eval1_~tmp~2#1); {6972#false} is VALID [2022-02-20 19:58:41,269 INFO L272 TraceCheckUtils]: 57: Hoare triple {6972#false} call error1(); {6972#false} is VALID [2022-02-20 19:58:41,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-02-20 19:58:41,270 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:41,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:41,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040993226] [2022-02-20 19:58:41,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040993226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:41,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:41,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:41,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652695826] [2022-02-20 19:58:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:58:41,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:41,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:41,311 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:41,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:41,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:41,312 INFO L87 Difference]: Start difference. First operand 396 states and 546 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:46,662 INFO L93 Difference]: Finished difference Result 2064 states and 2824 transitions. [2022-02-20 19:58:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:58:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1088 transitions. [2022-02-20 19:58:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1088 transitions. [2022-02-20 19:58:46,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1088 transitions. [2022-02-20 19:58:47,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1088 edges. 1088 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:47,835 INFO L225 Difference]: With dead ends: 2064 [2022-02-20 19:58:47,835 INFO L226 Difference]: Without dead ends: 1791 [2022-02-20 19:58:47,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 19:58:47,838 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1529 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:47,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 1264 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:58:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-02-20 19:58:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1533. [2022-02-20 19:58:48,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1791 states. Second operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2022-02-20 19:58:48,512 INFO L74 IsIncluded]: Start isIncluded. First operand 1791 states. Second operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2022-02-20 19:58:48,516 INFO L87 Difference]: Start difference. First operand 1791 states. Second operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2022-02-20 19:58:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,657 INFO L93 Difference]: Finished difference Result 1791 states and 2359 transitions. [2022-02-20 19:58:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2359 transitions. [2022-02-20 19:58:48,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) Second operand 1791 states. [2022-02-20 19:58:48,669 INFO L87 Difference]: Start difference. First operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) Second operand 1791 states. [2022-02-20 19:58:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,824 INFO L93 Difference]: Finished difference Result 1791 states and 2359 transitions. [2022-02-20 19:58:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2359 transitions. [2022-02-20 19:58:48,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2022-02-20 19:58:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2024 transitions. [2022-02-20 19:58:48,984 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2024 transitions. Word has length 59 [2022-02-20 19:58:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,985 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 2024 transitions. [2022-02-20 19:58:48,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2024 transitions. [2022-02-20 19:58:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:48,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,993 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,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:48,993 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1699461881, now seen corresponding path program 1 times [2022-02-20 19:58:48,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796277955] [2022-02-20 19:58:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {15552#(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); {15513#true} is VALID [2022-02-20 19:58:49,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15513#true} {15513#true} #653#return; {15513#true} is VALID [2022-02-20 19:58:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {15553#(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); {15513#true} is VALID [2022-02-20 19:58:49,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume !(0 == ~q_write_ev~0); {15513#true} is VALID [2022-02-20 19:58:49,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15513#true} {15513#true} #655#return; {15513#true} is VALID [2022-02-20 19:58:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {15513#true} havoc ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume !(1 == ~p_dw_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} ~__retres1~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {15513#true} #res := ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,138 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15513#true} {15513#true} #649#return; {15513#true} is VALID [2022-02-20 19:58:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {15513#true} havoc ~__retres1~1; {15513#true} is VALID [2022-02-20 19:58:49,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume !(1 == ~c_dr_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} ~__retres1~1 := 0; {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:49,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,180 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {15513#true} #651#return; {15567#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {15554#(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; {15513#true} is VALID [2022-02-20 19:58:49,180 INFO L272 TraceCheckUtils]: 1: Hoare triple {15513#true} call #t~ret8 := is_do_write_p_triggered(); {15513#true} is VALID [2022-02-20 19:58:49,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} havoc ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {15513#true} assume !(1 == ~p_dw_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {15513#true} ~__retres1~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {15513#true} #res := ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15513#true} {15513#true} #649#return; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {15513#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {15513#true} assume !(0 != ~tmp~1); {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L272 TraceCheckUtils]: 10: Hoare triple {15513#true} call #t~ret9 := is_do_read_c_triggered(); {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {15513#true} havoc ~__retres1~1; {15513#true} is VALID [2022-02-20 19:58:49,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {15513#true} assume !(1 == ~c_dr_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {15513#true} ~__retres1~1 := 0; {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:49,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,183 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {15513#true} #651#return; {15567#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {15567#(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; {15568#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:49,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {15568#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15514#false} is VALID [2022-02-20 19:58:49,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {15514#false} assume true; {15514#false} is VALID [2022-02-20 19:58:49,185 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15514#false} {15513#true} #657#return; {15514#false} is VALID [2022-02-20 19:58:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {15553#(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); {15513#true} is VALID [2022-02-20 19:58:49,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15513#true} is VALID [2022-02-20 19:58:49,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15513#true} {15514#false} #659#return; {15514#false} is VALID [2022-02-20 19:58:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {15513#true} havoc ~__retres1~2; {15513#true} is VALID [2022-02-20 19:58:49,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15513#true} is VALID [2022-02-20 19:58:49,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} #res := ~__retres1~2; {15513#true} is VALID [2022-02-20 19:58:49,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,202 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15513#true} {15514#false} #661#return; {15514#false} is VALID [2022-02-20 19:58:49,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {15513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {15513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {15513#true} is VALID [2022-02-20 19:58:49,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {15513#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {15513#true} is VALID [2022-02-20 19:58:49,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {15513#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; {15513#true} is VALID [2022-02-20 19:58:49,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {15513#true} call update_channels1(); {15552#(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,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {15552#(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); {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15513#true} {15513#true} #653#return; {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {15513#true} assume { :begin_inline_init_threads1 } true; {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {15513#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {15513#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {15513#true} assume { :end_inline_init_threads1 } true; {15513#true} is VALID [2022-02-20 19:58:49,205 INFO L272 TraceCheckUtils]: 12: Hoare triple {15513#true} call fire_delta_events1(); {15553#(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,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {15553#(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); {15513#true} is VALID [2022-02-20 19:58:49,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {15513#true} assume !(0 == ~q_write_ev~0); {15513#true} is VALID [2022-02-20 19:58:49,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,206 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15513#true} {15513#true} #655#return; {15513#true} is VALID [2022-02-20 19:58:49,206 INFO L272 TraceCheckUtils]: 17: Hoare triple {15513#true} call activate_threads1(); {15554#(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,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {15554#(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; {15513#true} is VALID [2022-02-20 19:58:49,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {15513#true} call #t~ret8 := is_do_write_p_triggered(); {15513#true} is VALID [2022-02-20 19:58:49,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {15513#true} havoc ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {15513#true} assume !(1 == ~p_dw_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {15513#true} ~__retres1~0 := 0; {15513#true} is VALID [2022-02-20 19:58:49,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {15513#true} #res := ~__retres1~0; {15513#true} is VALID [2022-02-20 19:58:49,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,210 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15513#true} {15513#true} #649#return; {15513#true} is VALID [2022-02-20 19:58:49,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {15513#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {15513#true} is VALID [2022-02-20 19:58:49,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {15513#true} assume !(0 != ~tmp~1); {15513#true} is VALID [2022-02-20 19:58:49,212 INFO L272 TraceCheckUtils]: 28: Hoare triple {15513#true} call #t~ret9 := is_do_read_c_triggered(); {15513#true} is VALID [2022-02-20 19:58:49,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {15513#true} havoc ~__retres1~1; {15513#true} is VALID [2022-02-20 19:58:49,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {15513#true} assume !(1 == ~c_dr_pc~0); {15513#true} is VALID [2022-02-20 19:58:49,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {15513#true} ~__retres1~1 := 0; {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:49,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {15569#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,217 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15570#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {15513#true} #651#return; {15567#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {15567#(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; {15568#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:49,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {15568#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {15514#false} is VALID [2022-02-20 19:58:49,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {15514#false} assume true; {15514#false} is VALID [2022-02-20 19:58:49,219 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15514#false} {15513#true} #657#return; {15514#false} is VALID [2022-02-20 19:58:49,219 INFO L272 TraceCheckUtils]: 39: Hoare triple {15514#false} call reset_delta_events1(); {15553#(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,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {15553#(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); {15513#true} is VALID [2022-02-20 19:58:49,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {15513#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {15513#true} is VALID [2022-02-20 19:58:49,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,225 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {15513#true} {15514#false} #659#return; {15514#false} is VALID [2022-02-20 19:58:49,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {15514#false} assume !false; {15514#false} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {15514#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; {15514#false} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {15514#false} assume !false; {15514#false} is VALID [2022-02-20 19:58:49,226 INFO L272 TraceCheckUtils]: 47: Hoare triple {15514#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {15513#true} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {15513#true} havoc ~__retres1~2; {15513#true} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {15513#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15513#true} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {15513#true} #res := ~__retres1~2; {15513#true} is VALID [2022-02-20 19:58:49,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {15513#true} assume true; {15513#true} is VALID [2022-02-20 19:58:49,227 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15513#true} {15514#false} #661#return; {15514#false} is VALID [2022-02-20 19:58:49,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {15514#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; {15514#false} is VALID [2022-02-20 19:58:49,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {15514#false} assume 0 != eval1_~tmp___1~0#1; {15514#false} is VALID [2022-02-20 19:58:49,227 INFO L290 TraceCheckUtils]: 55: Hoare triple {15514#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; {15514#false} is VALID [2022-02-20 19:58:49,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {15514#false} assume !(0 != eval1_~tmp~2#1); {15514#false} is VALID [2022-02-20 19:58:49,227 INFO L272 TraceCheckUtils]: 57: Hoare triple {15514#false} call error1(); {15514#false} is VALID [2022-02-20 19:58:49,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {15514#false} assume !false; {15514#false} is VALID [2022-02-20 19:58:49,228 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,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:49,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796277955] [2022-02-20 19:58:49,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796277955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:49,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:49,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:49,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439032779] [2022-02-20 19:58:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:49,232 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:49,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:49,232 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:49,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:49,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:49,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:49,269 INFO L87 Difference]: Start difference. First operand 1533 states and 2024 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:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,237 INFO L93 Difference]: Finished difference Result 3132 states and 4143 transitions. [2022-02-20 19:58:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:52,238 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:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:52,238 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:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2022-02-20 19:58:52,243 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:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2022-02-20 19:58:52,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 436 transitions. [2022-02-20 19:58:52,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:52,808 INFO L225 Difference]: With dead ends: 3132 [2022-02-20 19:58:52,808 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:58:52,811 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:58:52,815 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 208 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:52,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1199 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:58:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:58:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1578. [2022-02-20 19:58:53,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:53,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2022-02-20 19:58:53,480 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2022-02-20 19:58:53,483 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2022-02-20 19:58:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,623 INFO L93 Difference]: Finished difference Result 1722 states and 2243 transitions. [2022-02-20 19:58:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2243 transitions. [2022-02-20 19:58:53,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) Second operand 1722 states. [2022-02-20 19:58:53,650 INFO L87 Difference]: Start difference. First operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) Second operand 1722 states. [2022-02-20 19:58:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,775 INFO L93 Difference]: Finished difference Result 1722 states and 2243 transitions. [2022-02-20 19:58:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2243 transitions. [2022-02-20 19:58:53,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:53,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2022-02-20 19:58:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2063 transitions. [2022-02-20 19:58:53,916 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2063 transitions. Word has length 59 [2022-02-20 19:58:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:53,917 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2063 transitions. [2022-02-20 19:58:53,917 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:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2063 transitions. [2022-02-20 19:58:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:53,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:53,918 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:53,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:53,918 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -105976453, now seen corresponding path program 1 times [2022-02-20 19:58:53,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:53,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041251051] [2022-02-20 19:58:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {25380#(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); {25381#(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:53,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {25381#(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:53,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #653#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {25381#(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); {25381#(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:53,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {25381#(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); {25381#(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:53,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {25381#(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:53,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #655#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {25340#true} havoc ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:53,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {25340#true} assume !(1 == ~p_dw_pc~0); {25340#true} is VALID [2022-02-20 19:58:53,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {25340#true} ~__retres1~0 := 0; {25340#true} is VALID [2022-02-20 19:58:53,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {25340#true} #res := ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:53,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:53,999 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25340#true} {25340#true} #649#return; {25340#true} is VALID [2022-02-20 19:58:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {25340#true} havoc ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {25340#true} assume !(1 == ~c_dr_pc~0); {25340#true} is VALID [2022-02-20 19:58:54,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {25340#true} ~__retres1~1 := 0; {25340#true} is VALID [2022-02-20 19:58:54,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {25340#true} #res := ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25340#true} {25340#true} #651#return; {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {25382#(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; {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L272 TraceCheckUtils]: 1: Hoare triple {25340#true} call #t~ret8 := is_do_write_p_triggered(); {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {25340#true} havoc ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {25340#true} assume !(1 == ~p_dw_pc~0); {25340#true} is VALID [2022-02-20 19:58:54,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {25340#true} ~__retres1~0 := 0; {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {25340#true} #res := ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25340#true} {25340#true} #649#return; {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {25340#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {25340#true} assume !(0 != ~tmp~1); {25340#true} is VALID [2022-02-20 19:58:54,004 INFO L272 TraceCheckUtils]: 10: Hoare triple {25340#true} call #t~ret9 := is_do_read_c_triggered(); {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {25340#true} havoc ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {25340#true} assume !(1 == ~c_dr_pc~0); {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {25340#true} ~__retres1~1 := 0; {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {25340#true} #res := ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25340#true} {25340#true} #651#return; {25340#true} is VALID [2022-02-20 19:58:54,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {25340#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25340#true} is VALID [2022-02-20 19:58:54,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {25340#true} assume !(0 != ~tmp___0~1); {25340#true} is VALID [2022-02-20 19:58:54,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,006 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25340#true} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #657#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {25381#(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); {25395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:54,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {25395#(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; {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #659#return; {25341#false} is VALID [2022-02-20 19:58:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {25340#true} havoc ~__retres1~2; {25340#true} is VALID [2022-02-20 19:58:54,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {25340#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25340#true} is VALID [2022-02-20 19:58:54,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {25340#true} #res := ~__retres1~2; {25340#true} is VALID [2022-02-20 19:58:54,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,037 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25340#true} {25341#false} #661#return; {25341#false} is VALID [2022-02-20 19:58:54,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {25340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {25340#true} is VALID [2022-02-20 19:58:54,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {25340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647; {25340#true} is VALID [2022-02-20 19:58:54,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {25340#true} assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {25342#(= ~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; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {25380#(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:54,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {25380#(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); {25381#(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:54,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {25381#(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:54,041 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #653#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {25381#(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:54,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {25381#(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); {25381#(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:54,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {25381#(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); {25381#(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:54,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {25381#(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:54,045 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25381#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #655#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,045 INFO L272 TraceCheckUtils]: 17: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {25382#(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:54,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {25382#(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; {25340#true} is VALID [2022-02-20 19:58:54,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {25340#true} call #t~ret8 := is_do_write_p_triggered(); {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {25340#true} havoc ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {25340#true} assume !(1 == ~p_dw_pc~0); {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {25340#true} ~__retres1~0 := 0; {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {25340#true} #res := ~__retres1~0; {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,046 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25340#true} {25340#true} #649#return; {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {25340#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {25340#true} assume !(0 != ~tmp~1); {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {25340#true} call #t~ret9 := is_do_read_c_triggered(); {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {25340#true} havoc ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {25340#true} assume !(1 == ~c_dr_pc~0); {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {25340#true} ~__retres1~1 := 0; {25340#true} is VALID [2022-02-20 19:58:54,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {25340#true} #res := ~__retres1~1; {25340#true} is VALID [2022-02-20 19:58:54,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,048 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25340#true} {25340#true} #651#return; {25340#true} is VALID [2022-02-20 19:58:54,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {25340#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {25340#true} is VALID [2022-02-20 19:58:54,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {25340#true} assume !(0 != ~tmp___0~1); {25340#true} is VALID [2022-02-20 19:58:54,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,049 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25340#true} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #657#return; {25342#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,049 INFO L272 TraceCheckUtils]: 39: Hoare triple {25342#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {25381#(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:54,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {25381#(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); {25395#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:54,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {25395#(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; {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,052 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {25396#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {25342#(= ~q_write_ev~0 ~q_read_ev~0)} #659#return; {25341#false} is VALID [2022-02-20 19:58:54,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {25341#false} assume !false; {25341#false} is VALID [2022-02-20 19:58:54,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {25341#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; {25341#false} is VALID [2022-02-20 19:58:54,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {25341#false} assume !false; {25341#false} is VALID [2022-02-20 19:58:54,053 INFO L272 TraceCheckUtils]: 47: Hoare triple {25341#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {25340#true} is VALID [2022-02-20 19:58:54,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {25340#true} havoc ~__retres1~2; {25340#true} is VALID [2022-02-20 19:58:54,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {25340#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {25340#true} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {25340#true} #res := ~__retres1~2; {25340#true} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {25340#true} assume true; {25340#true} is VALID [2022-02-20 19:58:54,054 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25340#true} {25341#false} #661#return; {25341#false} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {25341#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; {25341#false} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {25341#false} assume 0 != eval1_~tmp___1~0#1; {25341#false} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {25341#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; {25341#false} is VALID [2022-02-20 19:58:54,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {25341#false} assume !(0 != eval1_~tmp~2#1); {25341#false} is VALID [2022-02-20 19:58:54,055 INFO L272 TraceCheckUtils]: 57: Hoare triple {25341#false} call error1(); {25341#false} is VALID [2022-02-20 19:58:54,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {25341#false} assume !false; {25341#false} is VALID [2022-02-20 19:58:54,055 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:54,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:54,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041251051] [2022-02-20 19:58:54,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041251051] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:54,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:54,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:54,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740767943] [2022-02-20 19:58:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:54,057 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,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:54,057 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:54,094 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:54,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:54,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:54,096 INFO L87 Difference]: Start difference. First operand 1578 states and 2063 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:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,148 INFO L93 Difference]: Finished difference Result 3013 states and 3900 transitions. [2022-02-20 19:58:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:57,148 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:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:57,148 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:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 609 transitions. [2022-02-20 19:58:57,153 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:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 609 transitions. [2022-02-20 19:58:57,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 609 transitions. [2022-02-20 19:58:57,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,789 INFO L225 Difference]: With dead ends: 3013 [2022-02-20 19:58:57,789 INFO L226 Difference]: Without dead ends: 1777 [2022-02-20 19:58:57,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:57,793 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 558 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:57,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 935 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-02-20 19:58:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1556. [2022-02-20 19:58:58,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:58,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1777 states. Second operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2022-02-20 19:58:58,423 INFO L74 IsIncluded]: Start isIncluded. First operand 1777 states. Second operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2022-02-20 19:58:58,426 INFO L87 Difference]: Start difference. First operand 1777 states. Second operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2022-02-20 19:58:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,545 INFO L93 Difference]: Finished difference Result 1777 states and 2291 transitions. [2022-02-20 19:58:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2291 transitions. [2022-02-20 19:58:58,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) Second operand 1777 states. [2022-02-20 19:58:58,556 INFO L87 Difference]: Start difference. First operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) Second operand 1777 states. [2022-02-20 19:58:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,702 INFO L93 Difference]: Finished difference Result 1777 states and 2291 transitions. [2022-02-20 19:58:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2291 transitions. [2022-02-20 19:58:58,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:58,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2022-02-20 19:58:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2023 transitions. [2022-02-20 19:58:58,837 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2023 transitions. Word has length 59 [2022-02-20 19:58:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:58,838 INFO L470 AbstractCegarLoop]: Abstraction has 1556 states and 2023 transitions. [2022-02-20 19:58:58,838 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:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2023 transitions. [2022-02-20 19:58:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:58,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:58,839 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,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:58,839 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2100121159, now seen corresponding path program 1 times [2022-02-20 19:58:58,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:58,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976207664] [2022-02-20 19:58:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:58,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:58:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:58,907 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:58:58,908 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:58:58,908 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:58:58,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:58:58,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:58,914 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:58,916 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:58:58,954 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:58:58,955 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:58:58,959 INFO L158 Benchmark]: Toolchain (without parser) took 28588.71ms. Allocated memory was 88.1MB in the beginning and 218.1MB in the end (delta: 130.0MB). Free memory was 54.5MB in the beginning and 90.2MB in the end (delta: -35.8MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,959 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:58:58,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.59ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 54.5MB in the beginning and 92.8MB in the end (delta: -38.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.42ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 89.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,960 INFO L158 Benchmark]: Boogie Preprocessor took 52.62ms. Allocated memory is still 123.7MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,961 INFO L158 Benchmark]: RCFGBuilder took 619.62ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 59.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,961 INFO L158 Benchmark]: TraceAbstraction took 27466.64ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 58.4MB in the beginning and 90.2MB in the end (delta: -31.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,962 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.22ms. Allocated memory is still 88.1MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.59ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 54.5MB in the beginning and 92.8MB in the end (delta: -38.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.42ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 89.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.62ms. Allocated memory is still 123.7MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.62ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 59.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27466.64ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 58.4MB in the beginning and 90.2MB in the end (delta: -31.8MB). Peak memory consumption was 64.2MB. 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:58:58,999 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.01.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 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:00,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:00,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:00,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:00,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:00,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:00,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:00,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:00,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:00,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:00,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:00,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:00,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:00,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:00,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:00,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:00,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:00,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:00,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:00,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:00,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:00,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:00,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:00,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:00,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:00,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:00,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:00,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:01,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:01,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:01,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:01,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:01,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:01,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:01,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:01,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:01,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:01,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:01,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:01,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:01,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:01,012 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:01,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:01,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:01,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:01,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:01,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:01,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:01,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:01,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:01,052 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:01,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:01,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:01,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:01,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:01,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:01,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:01,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:01,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:01,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:01,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:01,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:01,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:01,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:01,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:01,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:01,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:01,056 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:01,056 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:01,057 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:01,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:01,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:01,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:01,058 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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2022-02-20 19:59:01,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:01,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:01,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:01,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:01,419 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:01,420 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.01.cil-1.c [2022-02-20 19:59:01,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6e8451d/867000140654474ab46fbbacbe2222cd/FLAGbeaa8336c [2022-02-20 19:59:01,879 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:01,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-02-20 19:59:01,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6e8451d/867000140654474ab46fbbacbe2222cd/FLAGbeaa8336c [2022-02-20 19:59:02,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6e8451d/867000140654474ab46fbbacbe2222cd [2022-02-20 19:59:02,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:02,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:02,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:02,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:02,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:02,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df450c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02, skipping insertion in model container [2022-02-20 19:59:02,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:02,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:02,440 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.01.cil-1.c[914,927] [2022-02-20 19:59:02,519 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.01.cil-1.c[7125,7138] [2022-02-20 19:59:02,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:02,570 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:02,586 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.01.cil-1.c[914,927] [2022-02-20 19:59:02,624 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.01.cil-1.c[7125,7138] [2022-02-20 19:59:02,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:02,669 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:02,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02 WrapperNode [2022-02-20 19:59:02,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:02,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:02,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:02,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:02,676 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:02" (1/1) ... [2022-02-20 19:59:02,704 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:02" (1/1) ... [2022-02-20 19:59:02,743 INFO L137 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 386 [2022-02-20 19:59:02,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:02,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:02,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:02,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:02,751 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:02" (1/1) ... [2022-02-20 19:59:02,751 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:02" (1/1) ... [2022-02-20 19:59:02,754 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:02" (1/1) ... [2022-02-20 19:59:02,755 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:02" (1/1) ... [2022-02-20 19:59:02,763 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:02" (1/1) ... [2022-02-20 19:59:02,769 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:02" (1/1) ... [2022-02-20 19:59:02,781 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:02" (1/1) ... [2022-02-20 19:59:02,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:02,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:02,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:02,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:02,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:02,823 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:02,831 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:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:02,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:02,866 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:02,944 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:02,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:03,442 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:03,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:03,450 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:59:03,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:03 BoogieIcfgContainer [2022-02-20 19:59:03,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:03,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:03,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:03,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:03,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:02" (1/3) ... [2022-02-20 19:59:03,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23acecc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:03, skipping insertion in model container [2022-02-20 19:59:03,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (2/3) ... [2022-02-20 19:59:03,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23acecc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:03, skipping insertion in model container [2022-02-20 19:59:03,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:03" (3/3) ... [2022-02-20 19:59:03,467 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2022-02-20 19:59:03,472 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:03,472 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:03,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:03,531 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:03,531 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 19:59:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:03,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:03,581 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:03,582 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 740240985, now seen corresponding path program 1 times [2022-02-20 19:59:03,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:03,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232897148] [2022-02-20 19:59:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:03,603 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:03,604 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:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:03,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:03,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:04,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {212#true} is VALID [2022-02-20 19:59:04,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1; {212#true} is VALID [2022-02-20 19:59:04,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume 0bv32 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 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; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {223#(= (_ 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; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,033 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {223#(= (_ bv2 32) ~q_read_ev~0)} #653#return; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {223#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,036 INFO L272 TraceCheckUtils]: 12: Hoare triple {223#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:04,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {230#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {258#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:04,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {258#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:04,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {258#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:04,038 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {258#(= |old(~q_read_ev~0)| (_ bv0 32))} {223#(= (_ bv2 32) ~q_read_ev~0)} #655#return; {213#false} is VALID [2022-02-20 19:59:04,038 INFO L272 TraceCheckUtils]: 17: Hoare triple {213#false} call activate_threads1(); {213#false} is VALID [2022-02-20 19:59:04,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {213#false} havoc ~tmp~1;havoc ~tmp___0~1; {213#false} is VALID [2022-02-20 19:59:04,039 INFO L272 TraceCheckUtils]: 19: Hoare triple {213#false} call #t~ret8 := is_do_write_p_triggered(); {213#false} is VALID [2022-02-20 19:59:04,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {213#false} havoc ~__retres1~0; {213#false} is VALID [2022-02-20 19:59:04,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {213#false} assume 1bv32 == ~p_dw_pc~0; {213#false} is VALID [2022-02-20 19:59:04,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {213#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {213#false} is VALID [2022-02-20 19:59:04,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {213#false} #res := ~__retres1~0; {213#false} is VALID [2022-02-20 19:59:04,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 19:59:04,040 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {213#false} {213#false} #649#return; {213#false} is VALID [2022-02-20 19:59:04,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {213#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {213#false} is VALID [2022-02-20 19:59:04,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {213#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {213#false} is VALID [2022-02-20 19:59:04,041 INFO L272 TraceCheckUtils]: 28: Hoare triple {213#false} call #t~ret9 := is_do_read_c_triggered(); {213#false} is VALID [2022-02-20 19:59:04,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {213#false} havoc ~__retres1~1; {213#false} is VALID [2022-02-20 19:59:04,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {213#false} assume 1bv32 == ~c_dr_pc~0; {213#false} is VALID [2022-02-20 19:59:04,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {213#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {213#false} is VALID [2022-02-20 19:59:04,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {213#false} #res := ~__retres1~1; {213#false} is VALID [2022-02-20 19:59:04,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 19:59:04,043 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {213#false} {213#false} #651#return; {213#false} is VALID [2022-02-20 19:59:04,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {213#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {213#false} is VALID [2022-02-20 19:59:04,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {213#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {213#false} is VALID [2022-02-20 19:59:04,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 19:59:04,044 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {213#false} {213#false} #657#return; {213#false} is VALID [2022-02-20 19:59:04,044 INFO L272 TraceCheckUtils]: 39: Hoare triple {213#false} call reset_delta_events1(); {213#false} is VALID [2022-02-20 19:59:04,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {213#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {213#false} is VALID [2022-02-20 19:59:04,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {213#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {213#false} is VALID [2022-02-20 19:59:04,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 19:59:04,045 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {213#false} {213#false} #659#return; {213#false} is VALID [2022-02-20 19:59:04,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:59:04,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {213#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; {213#false} is VALID [2022-02-20 19:59:04,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:59:04,046 INFO L272 TraceCheckUtils]: 47: Hoare triple {213#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {213#false} is VALID [2022-02-20 19:59:04,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {213#false} havoc ~__retres1~2; {213#false} is VALID [2022-02-20 19:59:04,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {213#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {213#false} is VALID [2022-02-20 19:59:04,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {213#false} #res := ~__retres1~2; {213#false} is VALID [2022-02-20 19:59:04,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 19:59:04,047 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {213#false} {213#false} #661#return; {213#false} is VALID [2022-02-20 19:59:04,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {213#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {213#false} is VALID [2022-02-20 19:59:04,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {213#false} assume 0bv32 != eval1_~tmp___1~0#1; {213#false} is VALID [2022-02-20 19:59:04,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {213#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {213#false} is VALID [2022-02-20 19:59:04,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {213#false} assume !(0bv32 != eval1_~tmp~2#1); {213#false} is VALID [2022-02-20 19:59:04,048 INFO L272 TraceCheckUtils]: 57: Hoare triple {213#false} call error1(); {213#false} is VALID [2022-02-20 19:59:04,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 19:59:04,050 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:04,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:04,055 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:04,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232897148] [2022-02-20 19:59:04,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232897148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:04,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:04,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:04,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642228444] [2022-02-20 19:59:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:04,068 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:04,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:04,074 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:04,138 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:04,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:04,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:04,171 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,661 INFO L93 Difference]: Finished difference Result 505 states and 752 transitions. [2022-02-20 19:59:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:05,662 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:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:05,663 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:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2022-02-20 19:59:05,686 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:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2022-02-20 19:59:05,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 752 transitions. [2022-02-20 19:59:06,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 752 edges. 752 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,323 INFO L225 Difference]: With dead ends: 505 [2022-02-20 19:59:06,323 INFO L226 Difference]: Without dead ends: 303 [2022-02-20 19:59:06,327 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:06,330 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 258 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:06,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 759 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-02-20 19:59:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 295. [2022-02-20 19:59:06,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:06,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:59:06,390 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:59:06,391 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:59:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,408 INFO L93 Difference]: Finished difference Result 303 states and 418 transitions. [2022-02-20 19:59:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 418 transitions. [2022-02-20 19:59:06,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 303 states. [2022-02-20 19:59:06,414 INFO L87 Difference]: Start difference. First operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 303 states. [2022-02-20 19:59:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,430 INFO L93 Difference]: Finished difference Result 303 states and 418 transitions. [2022-02-20 19:59:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 418 transitions. [2022-02-20 19:59:06,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:06,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:59:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 409 transitions. [2022-02-20 19:59:06,449 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 409 transitions. Word has length 59 [2022-02-20 19:59:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,450 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 409 transitions. [2022-02-20 19:59:06,450 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:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2022-02-20 19:59:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:06,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:06,470 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:06,665 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:06,666 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1502890616, now seen corresponding path program 1 times [2022-02-20 19:59:06,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:06,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338633653] [2022-02-20 19:59:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:06,669 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:06,672 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:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:06,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {2116#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {2116#true} is VALID [2022-02-20 19:59:06,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1; {2116#true} is VALID [2022-02-20 19:59:06,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2116#true} assume 0bv32 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 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; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {2127#(= (_ 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; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,932 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {2127#(= (_ bv2 32) ~q_write_ev~0)} #653#return; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {2127#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {2127#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {2134#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {2165#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:06,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {2165#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {2165#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:06,936 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2165#(= |old(~q_write_ev~0)| (_ bv0 32))} {2127#(= (_ bv2 32) ~q_write_ev~0)} #655#return; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L272 TraceCheckUtils]: 17: Hoare triple {2117#false} call activate_threads1(); {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {2117#false} havoc ~tmp~1;havoc ~tmp___0~1; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L272 TraceCheckUtils]: 19: Hoare triple {2117#false} call #t~ret8 := is_do_write_p_triggered(); {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {2117#false} havoc ~__retres1~0; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {2117#false} assume !(1bv32 == ~p_dw_pc~0); {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {2117#false} ~__retres1~0 := 0bv32; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {2117#false} #res := ~__retres1~0; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {2117#false} assume true; {2117#false} is VALID [2022-02-20 19:59:06,937 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2117#false} {2117#false} #649#return; {2117#false} is VALID [2022-02-20 19:59:06,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {2117#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2117#false} is VALID [2022-02-20 19:59:06,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {2117#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2117#false} is VALID [2022-02-20 19:59:06,938 INFO L272 TraceCheckUtils]: 28: Hoare triple {2117#false} call #t~ret9 := is_do_read_c_triggered(); {2117#false} is VALID [2022-02-20 19:59:06,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {2117#false} havoc ~__retres1~1; {2117#false} is VALID [2022-02-20 19:59:06,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {2117#false} assume 1bv32 == ~c_dr_pc~0; {2117#false} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {2117#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {2117#false} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {2117#false} #res := ~__retres1~1; {2117#false} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {2117#false} assume true; {2117#false} is VALID [2022-02-20 19:59:06,939 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2117#false} {2117#false} #651#return; {2117#false} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {2117#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2117#false} is VALID [2022-02-20 19:59:06,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {2117#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2117#false} is VALID [2022-02-20 19:59:06,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {2117#false} assume true; {2117#false} is VALID [2022-02-20 19:59:06,940 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2117#false} {2117#false} #657#return; {2117#false} is VALID [2022-02-20 19:59:06,940 INFO L272 TraceCheckUtils]: 39: Hoare triple {2117#false} call reset_delta_events1(); {2117#false} is VALID [2022-02-20 19:59:06,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {2117#false} assume !(1bv32 == ~q_read_ev~0); {2117#false} is VALID [2022-02-20 19:59:06,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {2117#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2117#false} is VALID [2022-02-20 19:59:06,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {2117#false} assume true; {2117#false} is VALID [2022-02-20 19:59:06,941 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2117#false} {2117#false} #659#return; {2117#false} is VALID [2022-02-20 19:59:06,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:59:06,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {2117#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; {2117#false} is VALID [2022-02-20 19:59:06,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:59:06,942 INFO L272 TraceCheckUtils]: 47: Hoare triple {2117#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2117#false} is VALID [2022-02-20 19:59:06,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {2117#false} havoc ~__retres1~2; {2117#false} is VALID [2022-02-20 19:59:06,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {2117#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2117#false} is VALID [2022-02-20 19:59:06,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {2117#false} #res := ~__retres1~2; {2117#false} is VALID [2022-02-20 19:59:06,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {2117#false} assume true; {2117#false} is VALID [2022-02-20 19:59:06,943 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2117#false} {2117#false} #661#return; {2117#false} is VALID [2022-02-20 19:59:06,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {2117#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2117#false} is VALID [2022-02-20 19:59:06,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {2117#false} assume 0bv32 != eval1_~tmp___1~0#1; {2117#false} is VALID [2022-02-20 19:59:06,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {2117#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2117#false} is VALID [2022-02-20 19:59:06,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#false} assume !(0bv32 != eval1_~tmp~2#1); {2117#false} is VALID [2022-02-20 19:59:06,944 INFO L272 TraceCheckUtils]: 57: Hoare triple {2117#false} call error1(); {2117#false} is VALID [2022-02-20 19:59:06,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {2117#false} assume !false; {2117#false} is VALID [2022-02-20 19:59:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:06,945 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:06,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338633653] [2022-02-20 19:59:06,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338633653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:06,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:06,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:06,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571223459] [2022-02-20 19:59:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,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:06,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,948 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:06,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:06,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:06,994 INFO L87 Difference]: Start difference. First operand 295 states and 409 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:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,241 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2022-02-20 19:59:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:08,241 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:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:08,242 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:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2022-02-20 19:59:08,250 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:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2022-02-20 19:59:08,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 546 transitions. [2022-02-20 19:59:08,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:08,729 INFO L225 Difference]: With dead ends: 689 [2022-02-20 19:59:08,730 INFO L226 Difference]: Without dead ends: 509 [2022-02-20 19:59:08,731 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:08,732 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 245 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:08,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 732 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-02-20 19:59:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 500. [2022-02-20 19:59:08,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:08,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) [2022-02-20 19:59:08,764 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) [2022-02-20 19:59:08,767 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) [2022-02-20 19:59:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,793 INFO L93 Difference]: Finished difference Result 509 states and 699 transitions. [2022-02-20 19:59:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 699 transitions. [2022-02-20 19:59:08,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) Second operand 509 states. [2022-02-20 19:59:08,798 INFO L87 Difference]: Start difference. First operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) Second operand 509 states. [2022-02-20 19:59:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,829 INFO L93 Difference]: Finished difference Result 509 states and 699 transitions. [2022-02-20 19:59:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 699 transitions. [2022-02-20 19:59:08,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:08,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 406 states have internal predecessors, (541), 63 states have call successors, (63), 35 states have call predecessors, (63), 44 states have return successors, (85), 63 states have call predecessors, (85), 60 states have call successors, (85) [2022-02-20 19:59:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 689 transitions. [2022-02-20 19:59:08,869 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 689 transitions. Word has length 59 [2022-02-20 19:59:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:08,869 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 689 transitions. [2022-02-20 19:59:08,869 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:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 689 transitions. [2022-02-20 19:59:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:08,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:08,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:08,885 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:09,080 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:09,081 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -569442439, now seen corresponding path program 1 times [2022-02-20 19:59:09,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:09,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049253800] [2022-02-20 19:59:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:09,084 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:09,085 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:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:09,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {4953#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {4953#true} is VALID [2022-02-20 19:59:09,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1; {4953#true} is VALID [2022-02-20 19:59:09,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume 0bv32 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 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; {4953#true} is VALID [2022-02-20 19:59:09,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {4953#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; {4953#true} is VALID [2022-02-20 19:59:09,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call update_channels1(); {4953#true} is VALID [2022-02-20 19:59:09,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#true} assume !(1bv32 == ~q_req_up~0); {4953#true} is VALID [2022-02-20 19:59:09,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-02-20 19:59:09,324 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4953#true} {4953#true} #653#return; {4953#true} is VALID [2022-02-20 19:59:09,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume { :begin_inline_init_threads1 } true; {4953#true} is VALID [2022-02-20 19:59:09,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {4953#true} is VALID [2022-02-20 19:59:09,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {4953#true} is VALID [2022-02-20 19:59:09,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {4953#true} assume { :end_inline_init_threads1 } true; {4953#true} is VALID [2022-02-20 19:59:09,325 INFO L272 TraceCheckUtils]: 12: Hoare triple {4953#true} call fire_delta_events1(); {4953#true} is VALID [2022-02-20 19:59:09,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {4953#true} assume !(0bv32 == ~q_read_ev~0); {4953#true} is VALID [2022-02-20 19:59:09,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {4953#true} assume !(0bv32 == ~q_write_ev~0); {4953#true} is VALID [2022-02-20 19:59:09,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-02-20 19:59:09,331 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4953#true} {4953#true} #655#return; {4953#true} is VALID [2022-02-20 19:59:09,331 INFO L272 TraceCheckUtils]: 17: Hoare triple {4953#true} call activate_threads1(); {4953#true} is VALID [2022-02-20 19:59:09,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#true} havoc ~tmp~1;havoc ~tmp___0~1; {4953#true} is VALID [2022-02-20 19:59:09,332 INFO L272 TraceCheckUtils]: 19: Hoare triple {4953#true} call #t~ret8 := is_do_write_p_triggered(); {4953#true} is VALID [2022-02-20 19:59:09,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {4953#true} havoc ~__retres1~0; {4953#true} is VALID [2022-02-20 19:59:09,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {4953#true} assume !(1bv32 == ~p_dw_pc~0); {4953#true} is VALID [2022-02-20 19:59:09,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {4953#true} ~__retres1~0 := 0bv32; {5024#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:09,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {5024#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {5028#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {5028#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {5028#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,335 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5028#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {4953#true} #649#return; {5035#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:09,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {5035#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {5039#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:09,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {5039#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {4954#false} is VALID [2022-02-20 19:59:09,337 INFO L272 TraceCheckUtils]: 28: Hoare triple {4954#false} call #t~ret9 := is_do_read_c_triggered(); {4954#false} is VALID [2022-02-20 19:59:09,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {4954#false} havoc ~__retres1~1; {4954#false} is VALID [2022-02-20 19:59:09,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {4954#false} assume !(1bv32 == ~c_dr_pc~0); {4954#false} is VALID [2022-02-20 19:59:09,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {4954#false} ~__retres1~1 := 0bv32; {4954#false} is VALID [2022-02-20 19:59:09,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {4954#false} #res := ~__retres1~1; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {4954#false} assume true; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4954#false} {4954#false} #651#return; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {4954#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {4954#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {4954#false} assume true; {4954#false} is VALID [2022-02-20 19:59:09,338 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4954#false} {4953#true} #657#return; {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L272 TraceCheckUtils]: 39: Hoare triple {4954#false} call reset_delta_events1(); {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {4954#false} assume !(1bv32 == ~q_read_ev~0); {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {4954#false} assume !(1bv32 == ~q_write_ev~0); {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {4954#false} assume true; {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4954#false} {4954#false} #659#return; {4954#false} is VALID [2022-02-20 19:59:09,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-02-20 19:59:09,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {4954#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; {4954#false} is VALID [2022-02-20 19:59:09,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-02-20 19:59:09,340 INFO L272 TraceCheckUtils]: 47: Hoare triple {4954#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4954#false} is VALID [2022-02-20 19:59:09,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {4954#false} havoc ~__retres1~2; {4954#false} is VALID [2022-02-20 19:59:09,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {4954#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {4954#false} is VALID [2022-02-20 19:59:09,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {4954#false} #res := ~__retres1~2; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {4954#false} assume true; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4954#false} {4954#false} #661#return; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {4954#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {4954#false} assume 0bv32 != eval1_~tmp___1~0#1; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {4954#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {4954#false} is VALID [2022-02-20 19:59:09,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {4954#false} assume !(0bv32 != eval1_~tmp~2#1); {4954#false} is VALID [2022-02-20 19:59:09,344 INFO L272 TraceCheckUtils]: 57: Hoare triple {4954#false} call error1(); {4954#false} is VALID [2022-02-20 19:59:09,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-02-20 19:59:09,344 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:09,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:09,345 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:09,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049253800] [2022-02-20 19:59:09,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049253800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:09,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:09,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:09,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382378602] [2022-02-20 19:59:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:09,346 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:09,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:09,347 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:09,392 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:09,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:09,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:09,394 INFO L87 Difference]: Start difference. First operand 500 states and 689 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:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,168 INFO L93 Difference]: Finished difference Result 891 states and 1222 transitions. [2022-02-20 19:59:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:10,169 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:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:10,169 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:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 411 transitions. [2022-02-20 19:59:10,174 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:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 411 transitions. [2022-02-20 19:59:10,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 411 transitions. [2022-02-20 19:59:10,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,469 INFO L225 Difference]: With dead ends: 891 [2022-02-20 19:59:10,470 INFO L226 Difference]: Without dead ends: 520 [2022-02-20 19:59:10,471 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:10,472 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 7 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1369 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:10,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1369 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:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-20 19:59:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 510. [2022-02-20 19:59:10,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:10,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 520 states. Second operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) [2022-02-20 19:59:10,496 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) [2022-02-20 19:59:10,497 INFO L87 Difference]: Start difference. First operand 520 states. Second operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) [2022-02-20 19:59:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,516 INFO L93 Difference]: Finished difference Result 520 states and 713 transitions. [2022-02-20 19:59:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 713 transitions. [2022-02-20 19:59:10,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) Second operand 520 states. [2022-02-20 19:59:10,521 INFO L87 Difference]: Start difference. First operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) Second operand 520 states. [2022-02-20 19:59:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,540 INFO L93 Difference]: Finished difference Result 520 states and 713 transitions. [2022-02-20 19:59:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 713 transitions. [2022-02-20 19:59:10,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 414 states have internal predecessors, (547), 63 states have call successors, (63), 35 states have call predecessors, (63), 46 states have return successors, (87), 65 states have call predecessors, (87), 60 states have call successors, (87) [2022-02-20 19:59:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 697 transitions. [2022-02-20 19:59:10,565 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 697 transitions. Word has length 59 [2022-02-20 19:59:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,566 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 697 transitions. [2022-02-20 19:59:10,566 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:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 697 transitions. [2022-02-20 19:59:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,568 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,578 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:10,778 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:10,778 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash -294682825, now seen corresponding path program 1 times [2022-02-20 19:59:10,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:10,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113543681] [2022-02-20 19:59:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:10,780 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:10,781 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:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:11,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {8091#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {8091#true} is VALID [2022-02-20 19:59:11,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {8091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~ret29#1, main_#t~ret30#1; {8091#true} is VALID [2022-02-20 19:59:11,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {8091#true} assume 0bv32 != main_#t~nondet28#1;havoc main_#t~nondet28#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 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; {8091#true} is VALID [2022-02-20 19:59:11,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {8091#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; {8091#true} is VALID [2022-02-20 19:59:11,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {8091#true} call update_channels1(); {8091#true} is VALID [2022-02-20 19:59:11,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {8091#true} assume !(1bv32 == ~q_req_up~0); {8091#true} is VALID [2022-02-20 19:59:11,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {8091#true} assume true; {8091#true} is VALID [2022-02-20 19:59:11,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8091#true} {8091#true} #653#return; {8091#true} is VALID [2022-02-20 19:59:11,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {8091#true} assume { :begin_inline_init_threads1 } true; {8091#true} is VALID [2022-02-20 19:59:11,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {8091#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {8091#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {8091#true} assume { :end_inline_init_threads1 } true; {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {8091#true} call fire_delta_events1(); {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {8091#true} assume !(0bv32 == ~q_read_ev~0); {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {8091#true} assume !(0bv32 == ~q_write_ev~0); {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {8091#true} assume true; {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8091#true} {8091#true} #655#return; {8091#true} is VALID [2022-02-20 19:59:11,056 INFO L272 TraceCheckUtils]: 17: Hoare triple {8091#true} call activate_threads1(); {8091#true} is VALID [2022-02-20 19:59:11,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {8091#true} havoc ~tmp~1;havoc ~tmp___0~1; {8091#true} is VALID [2022-02-20 19:59:11,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {8091#true} call #t~ret8 := is_do_write_p_triggered(); {8091#true} is VALID [2022-02-20 19:59:11,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {8091#true} havoc ~__retres1~0; {8091#true} is VALID [2022-02-20 19:59:11,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {8091#true} assume !(1bv32 == ~p_dw_pc~0); {8091#true} is VALID [2022-02-20 19:59:11,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {8091#true} ~__retres1~0 := 0bv32; {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {8091#true} #res := ~__retres1~0; {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {8091#true} assume true; {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8091#true} {8091#true} #649#return; {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {8091#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {8091#true} assume !(0bv32 != ~tmp~1); {8091#true} is VALID [2022-02-20 19:59:11,058 INFO L272 TraceCheckUtils]: 28: Hoare triple {8091#true} call #t~ret9 := is_do_read_c_triggered(); {8091#true} is VALID [2022-02-20 19:59:11,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {8091#true} havoc ~__retres1~1; {8091#true} is VALID [2022-02-20 19:59:11,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {8091#true} assume !(1bv32 == ~c_dr_pc~0); {8091#true} is VALID [2022-02-20 19:59:11,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {8091#true} ~__retres1~1 := 0bv32; {8189#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:11,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {8189#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {8193#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:11,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {8193#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {8193#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:11,063 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8193#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {8091#true} #651#return; {8200#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:11,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {8200#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8204#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:11,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {8204#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {8092#false} assume true; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8092#false} {8091#true} #657#return; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L272 TraceCheckUtils]: 39: Hoare triple {8092#false} call reset_delta_events1(); {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {8092#false} assume !(1bv32 == ~q_read_ev~0); {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {8092#false} assume !(1bv32 == ~q_write_ev~0); {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {8092#false} assume true; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8092#false} {8092#false} #659#return; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {8092#false} assume !false; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {8092#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; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {8092#false} assume !false; {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L272 TraceCheckUtils]: 47: Hoare triple {8092#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8092#false} is VALID [2022-02-20 19:59:11,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {8092#false} havoc ~__retres1~2; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {8092#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {8092#false} #res := ~__retres1~2; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {8092#false} assume true; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8092#false} {8092#false} #661#return; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {8092#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {8092#false} assume 0bv32 != eval1_~tmp___1~0#1; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {8092#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {8092#false} assume !(0bv32 != eval1_~tmp~2#1); {8092#false} is VALID [2022-02-20 19:59:11,065 INFO L272 TraceCheckUtils]: 57: Hoare triple {8092#false} call error1(); {8092#false} is VALID [2022-02-20 19:59:11,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {8092#false} assume !false; {8092#false} is VALID [2022-02-20 19:59:11,066 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:11,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:11,066 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:11,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113543681] [2022-02-20 19:59:11,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113543681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:11,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:11,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:11,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215408316] [2022-02-20 19:59:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:11,068 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:11,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:11,068 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:11,105 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:11,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:11,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:11,106 INFO L87 Difference]: Start difference. First operand 510 states and 697 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:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:11,831 INFO L93 Difference]: Finished difference Result 905 states and 1228 transitions. [2022-02-20 19:59:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:11,831 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:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:11,831 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:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 406 transitions. [2022-02-20 19:59:11,835 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:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 406 transitions. [2022-02-20 19:59:11,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 406 transitions. [2022-02-20 19:59:12,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,104 INFO L225 Difference]: With dead ends: 905 [2022-02-20 19:59:12,105 INFO L226 Difference]: Without dead ends: 524 [2022-02-20 19:59:12,106 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:12,107 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 4 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1365 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:12,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1365 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:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-20 19:59:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2022-02-20 19:59:12,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) [2022-02-20 19:59:12,128 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) [2022-02-20 19:59:12,129 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) [2022-02-20 19:59:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,147 INFO L93 Difference]: Finished difference Result 524 states and 711 transitions. [2022-02-20 19:59:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 711 transitions. [2022-02-20 19:59:12,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) Second operand 524 states. [2022-02-20 19:59:12,152 INFO L87 Difference]: Start difference. First operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) Second operand 524 states. [2022-02-20 19:59:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,171 INFO L93 Difference]: Finished difference Result 524 states and 711 transitions. [2022-02-20 19:59:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 711 transitions. [2022-02-20 19:59:12,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 407 states have (on average 1.3587223587223587) internal successors, (553), 422 states have internal predecessors, (553), 63 states have call successors, (63), 35 states have call predecessors, (63), 48 states have return successors, (89), 67 states have call predecessors, (89), 60 states have call successors, (89) [2022-02-20 19:59:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 705 transitions. [2022-02-20 19:59:12,197 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 705 transitions. Word has length 59 [2022-02-20 19:59:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,197 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 705 transitions. [2022-02-20 19:59:12,198 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:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 705 transitions. [2022-02-20 19:59:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,199 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,215 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:12,409 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:12,410 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2100121159, now seen corresponding path program 1 times [2022-02-20 19:59:12,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:12,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769040071] [2022-02-20 19:59:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:12,413 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:12,448 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:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,581 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:12,582 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:12,582 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:12,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:12,616 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:12,790 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:12,793 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:12,796 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:12,849 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:12,850 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:12,855 INFO L158 Benchmark]: Toolchain (without parser) took 10584.95ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 42.1MB in the beginning and 67.1MB in the end (delta: -25.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,855 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:12,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.19ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 38.9MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.13ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,856 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 33.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,857 INFO L158 Benchmark]: RCFGBuilder took 666.26ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.0MB in the beginning and 37.5MB in the end (delta: -4.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,857 INFO L158 Benchmark]: TraceAbstraction took 9400.64ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 36.7MB in the beginning and 67.1MB in the end (delta: -30.5MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,862 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.14ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.19ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 38.9MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.13ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.98ms. Allocated memory is still 62.9MB. Free memory was 35.8MB in the beginning and 33.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 666.26ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.0MB in the beginning and 37.5MB in the end (delta: -4.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9400.64ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 36.7MB in the beginning and 67.1MB in the end (delta: -30.5MB). Peak memory consumption was 3.4MB. 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:12,897 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