./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.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.11.cil-2.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 d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:15,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:15,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:15,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:15,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:15,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:15,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:15,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:15,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:15,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:15,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:15,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:15,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:15,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:15,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:15,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:15,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:15,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:15,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:15,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:15,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:15,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:15,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:15,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:15,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:15,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:15,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:15,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:15,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:15,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:15,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:15,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:15,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:15,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:15,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:15,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:15,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:15,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:15,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:15,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:15,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:15,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:15,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:15,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:15,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:15,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:15,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:15,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:15,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:15,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:15,657 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:15,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:15,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:15,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:15,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:15,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:15,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:15,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:15,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:15,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:15,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:15,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:15,661 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:15,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:15,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:15,662 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 -> d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 [2022-02-20 19:59:15,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:15,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:15,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:15,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:15,876 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:15,877 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.11.cil-2.c [2022-02-20 19:59:15,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951e35f04/c242deb5697f4cf19447a68d3837f408/FLAG7ff87f0fe [2022-02-20 19:59:16,343 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:16,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-02-20 19:59:16,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951e35f04/c242deb5697f4cf19447a68d3837f408/FLAG7ff87f0fe [2022-02-20 19:59:16,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951e35f04/c242deb5697f4cf19447a68d3837f408 [2022-02-20 19:59:16,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:16,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:16,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:16,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:16,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:16,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:16,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c1b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16, skipping insertion in model container [2022-02-20 19:59:16,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:16,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:16,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:16,590 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.11.cil-2.c[914,927] [2022-02-20 19:59:16,638 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.11.cil-2.c[7125,7138] [2022-02-20 19:59:16,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:16,730 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:16,737 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.11.cil-2.c[914,927] [2022-02-20 19:59:16,757 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.11.cil-2.c[7125,7138] [2022-02-20 19:59:16,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:16,847 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:16,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16 WrapperNode [2022-02-20 19:59:16,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:16,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:16,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:16,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:16,854 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:16" (1/1) ... [2022-02-20 19:59:16,870 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:16" (1/1) ... [2022-02-20 19:59:16,921 INFO L137 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 983 [2022-02-20 19:59:16,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:16,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:16,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:16,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:16,938 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:16" (1/1) ... [2022-02-20 19:59:16,938 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:16" (1/1) ... [2022-02-20 19:59:16,942 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:16" (1/1) ... [2022-02-20 19:59:16,947 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:16" (1/1) ... [2022-02-20 19:59:16,958 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:16" (1/1) ... [2022-02-20 19:59:17,003 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:16" (1/1) ... [2022-02-20 19:59:17,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:17,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:17,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:17,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:17,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16" (1/1) ... [2022-02-20 19:59:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:17,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:17,069 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:17,077 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:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:17,098 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:17,179 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:17,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:17,724 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:17,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:17,732 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 19:59:17,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:17 BoogieIcfgContainer [2022-02-20 19:59:17,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:17,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:17,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:17,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:17,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:16" (1/3) ... [2022-02-20 19:59:17,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d062c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:17, skipping insertion in model container [2022-02-20 19:59:17,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:16" (2/3) ... [2022-02-20 19:59:17,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d062c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:17, skipping insertion in model container [2022-02-20 19:59:17,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:17" (3/3) ... [2022-02-20 19:59:17,739 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-02-20 19:59:17,742 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:17,742 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:17,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:17,781 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:17,781 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 19:59:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:17,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:17,820 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:17,821 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2137736078, now seen corresponding path program 1 times [2022-02-20 19:59:17,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:17,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323415663] [2022-02-20 19:59:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#(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); {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {464#(= ~q_read_ev~0 2)} #1773#return; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(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; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(= |old(~q_read_ev~0)| 0)} assume true; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#(= |old(~q_read_ev~0)| 0)} {464#(= ~q_read_ev~0 2)} #1775#return; {463#false} is VALID [2022-02-20 19:59:18,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} havoc ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume !(1 == ~p_dw_pc~0); {462#true} is VALID [2022-02-20 19:59:18,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} ~__retres1~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#true} #res := ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,125 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {462#true} {462#true} #1769#return; {462#true} is VALID [2022-02-20 19:59:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} havoc ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume 1 == ~c_dr_pc~0; {462#true} is VALID [2022-02-20 19:59:18,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {462#true} is VALID [2022-02-20 19:59:18,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#true} #res := ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,129 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {462#true} {462#true} #1771#return; {462#true} is VALID [2022-02-20 19:59:18,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#(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; {462#true} is VALID [2022-02-20 19:59:18,130 INFO L272 TraceCheckUtils]: 1: Hoare triple {462#true} call #t~ret8 := is_do_write_p_triggered(); {462#true} is VALID [2022-02-20 19:59:18,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} havoc ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#true} assume !(1 == ~p_dw_pc~0); {462#true} is VALID [2022-02-20 19:59:18,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {462#true} ~__retres1~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#true} #res := ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,131 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {462#true} {462#true} #1769#return; {462#true} is VALID [2022-02-20 19:59:18,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {462#true} is VALID [2022-02-20 19:59:18,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,131 INFO L272 TraceCheckUtils]: 10: Hoare triple {462#true} call #t~ret9 := is_do_read_c_triggered(); {462#true} is VALID [2022-02-20 19:59:18,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#true} havoc ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#true} assume 1 == ~c_dr_pc~0; {462#true} is VALID [2022-02-20 19:59:18,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {462#true} is VALID [2022-02-20 19:59:18,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#true} #res := ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,132 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {462#true} {462#true} #1771#return; {462#true} is VALID [2022-02-20 19:59:18,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {462#true} is VALID [2022-02-20 19:59:18,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,133 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {462#true} {463#false} #1777#return; {463#false} is VALID [2022-02-20 19:59:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(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; {462#true} is VALID [2022-02-20 19:59:18,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {462#true} is VALID [2022-02-20 19:59:18,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {463#false} #1779#return; {463#false} is VALID [2022-02-20 19:59:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} havoc ~__retres1~2; {462#true} is VALID [2022-02-20 19:59:18,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {462#true} is VALID [2022-02-20 19:59:18,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} #res := ~__retres1~2; {462#true} is VALID [2022-02-20 19:59:18,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,145 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {462#true} {463#false} #1781#return; {463#false} is VALID [2022-02-20 19:59:18,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {462#true} is VALID [2022-02-20 19:59:18,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {464#(= ~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; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#(= ~q_read_ev~0 2)} call update_channels1(); {502#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:18,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#(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); {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:18,150 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {503#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {464#(= ~q_read_ev~0 2)} #1773#return; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {464#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {464#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {464#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:18,152 INFO L272 TraceCheckUtils]: 12: Hoare triple {464#(= ~q_read_ev~0 2)} call fire_delta_events1(); {504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {504#(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; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(= |old(~q_read_ev~0)| 0)} assume true; {505#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:18,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {505#(= |old(~q_read_ev~0)| 0)} {464#(= ~q_read_ev~0 2)} #1775#return; {463#false} is VALID [2022-02-20 19:59:18,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {463#false} call activate_threads1(); {506#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:18,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {506#(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; {462#true} is VALID [2022-02-20 19:59:18,154 INFO L272 TraceCheckUtils]: 19: Hoare triple {462#true} call #t~ret8 := is_do_write_p_triggered(); {462#true} is VALID [2022-02-20 19:59:18,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {462#true} havoc ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {462#true} assume !(1 == ~p_dw_pc~0); {462#true} is VALID [2022-02-20 19:59:18,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {462#true} ~__retres1~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {462#true} #res := ~__retres1~0; {462#true} is VALID [2022-02-20 19:59:18,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,155 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {462#true} {462#true} #1769#return; {462#true} is VALID [2022-02-20 19:59:18,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {462#true} is VALID [2022-02-20 19:59:18,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {462#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,156 INFO L272 TraceCheckUtils]: 28: Hoare triple {462#true} call #t~ret9 := is_do_read_c_triggered(); {462#true} is VALID [2022-02-20 19:59:18,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {462#true} havoc ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {462#true} assume 1 == ~c_dr_pc~0; {462#true} is VALID [2022-02-20 19:59:18,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {462#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {462#true} is VALID [2022-02-20 19:59:18,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {462#true} #res := ~__retres1~1; {462#true} is VALID [2022-02-20 19:59:18,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,157 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {462#true} {462#true} #1771#return; {462#true} is VALID [2022-02-20 19:59:18,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {462#true} is VALID [2022-02-20 19:59:18,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {462#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {462#true} is VALID [2022-02-20 19:59:18,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,157 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {462#true} {463#false} #1777#return; {463#false} is VALID [2022-02-20 19:59:18,158 INFO L272 TraceCheckUtils]: 39: Hoare triple {463#false} call reset_delta_events1(); {504#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:18,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {504#(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; {462#true} is VALID [2022-02-20 19:59:18,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {462#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {462#true} is VALID [2022-02-20 19:59:18,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,159 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {462#true} {463#false} #1779#return; {463#false} is VALID [2022-02-20 19:59:18,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:18,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {463#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; {463#false} is VALID [2022-02-20 19:59:18,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:18,160 INFO L272 TraceCheckUtils]: 47: Hoare triple {463#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {462#true} is VALID [2022-02-20 19:59:18,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {462#true} havoc ~__retres1~2; {462#true} is VALID [2022-02-20 19:59:18,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {462#true} is VALID [2022-02-20 19:59:18,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {462#true} #res := ~__retres1~2; {462#true} is VALID [2022-02-20 19:59:18,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {462#true} assume true; {462#true} is VALID [2022-02-20 19:59:18,162 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {462#true} {463#false} #1781#return; {463#false} is VALID [2022-02-20 19:59:18,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {463#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; {463#false} is VALID [2022-02-20 19:59:18,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {463#false} assume 0 != eval1_~tmp___1~0#1; {463#false} is VALID [2022-02-20 19:59:18,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {463#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; {463#false} is VALID [2022-02-20 19:59:18,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {463#false} assume !(0 != eval1_~tmp~2#1); {463#false} is VALID [2022-02-20 19:59:18,164 INFO L272 TraceCheckUtils]: 57: Hoare triple {463#false} call error1(); {463#false} is VALID [2022-02-20 19:59:18,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:18,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323415663] [2022-02-20 19:59:18,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323415663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:18,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553950831] [2022-02-20 19:59:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:18,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:18,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:18,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:18,265 INFO L87 Difference]: Start difference. First operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,275 INFO L93 Difference]: Finished difference Result 1027 states and 1638 transitions. [2022-02-20 19:59:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1638 transitions. [2022-02-20 19:59:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1638 transitions. [2022-02-20 19:59:21,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1638 transitions. [2022-02-20 19:59:22,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1638 edges. 1638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,282 INFO L225 Difference]: With dead ends: 1027 [2022-02-20 19:59:22,282 INFO L226 Difference]: Without dead ends: 585 [2022-02-20 19:59:22,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:22,288 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 1464 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:22,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 2000 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-20 19:59:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 545. [2022-02-20 19:59:22,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:22,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 585 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:22,351 INFO L74 IsIncluded]: Start isIncluded. First operand 585 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:22,353 INFO L87 Difference]: Start difference. First operand 585 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,376 INFO L93 Difference]: Finished difference Result 585 states and 874 transitions. [2022-02-20 19:59:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 874 transitions. [2022-02-20 19:59:22,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 585 states. [2022-02-20 19:59:22,384 INFO L87 Difference]: Start difference. First operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 585 states. [2022-02-20 19:59:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,405 INFO L93 Difference]: Finished difference Result 585 states and 874 transitions. [2022-02-20 19:59:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 874 transitions. [2022-02-20 19:59:22,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:22,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 819 transitions. [2022-02-20 19:59:22,431 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 819 transitions. Word has length 59 [2022-02-20 19:59:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:22,432 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 819 transitions. [2022-02-20 19:59:22,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 819 transitions. [2022-02-20 19:59:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:22,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:22,434 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:22,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:22,434 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1917902258, now seen corresponding path program 1 times [2022-02-20 19:59:22,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:22,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632088490] [2022-02-20 19:59:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {3826#(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); {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3788#(= ~q_write_ev~0 ~q_read_ev~0)} #1773#return; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {3827#(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); {3828#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {3828#(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; {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3788#(= ~q_write_ev~0 ~q_read_ev~0)} #1775#return; {3787#false} is VALID [2022-02-20 19:59:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {3786#true} havoc ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume !(1 == ~p_dw_pc~0); {3786#true} is VALID [2022-02-20 19:59:22,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} ~__retres1~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {3786#true} #res := ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,523 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3786#true} {3786#true} #1769#return; {3786#true} is VALID [2022-02-20 19:59:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {3786#true} havoc ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume 1 == ~c_dr_pc~0; {3786#true} is VALID [2022-02-20 19:59:22,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3786#true} is VALID [2022-02-20 19:59:22,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {3786#true} #res := ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,527 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3786#true} {3786#true} #1771#return; {3786#true} is VALID [2022-02-20 19:59:22,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {3830#(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; {3786#true} is VALID [2022-02-20 19:59:22,527 INFO L272 TraceCheckUtils]: 1: Hoare triple {3786#true} call #t~ret8 := is_do_write_p_triggered(); {3786#true} is VALID [2022-02-20 19:59:22,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} havoc ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {3786#true} assume !(1 == ~p_dw_pc~0); {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {3786#true} ~__retres1~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {3786#true} #res := ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3786#true} {3786#true} #1769#return; {3786#true} is VALID [2022-02-20 19:59:22,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {3786#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {3786#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L272 TraceCheckUtils]: 10: Hoare triple {3786#true} call #t~ret9 := is_do_read_c_triggered(); {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#true} havoc ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#true} assume 1 == ~c_dr_pc~0; {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3786#true} is VALID [2022-02-20 19:59:22,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#true} #res := ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3786#true} {3786#true} #1771#return; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,530 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3786#true} {3787#false} #1777#return; {3787#false} is VALID [2022-02-20 19:59:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {3827#(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); {3786#true} is VALID [2022-02-20 19:59:22,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3786#true} is VALID [2022-02-20 19:59:22,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3786#true} {3787#false} #1779#return; {3787#false} is VALID [2022-02-20 19:59:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {3786#true} havoc ~__retres1~2; {3786#true} is VALID [2022-02-20 19:59:22,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3786#true} is VALID [2022-02-20 19:59:22,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} #res := ~__retres1~2; {3786#true} is VALID [2022-02-20 19:59:22,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,538 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3786#true} {3787#false} #1781#return; {3787#false} is VALID [2022-02-20 19:59:22,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {3786#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {3786#true} is VALID [2022-02-20 19:59:22,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {3788#(= ~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; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3826#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:22,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#(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); {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,541 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3788#(= ~q_write_ev~0 ~q_read_ev~0)} #1773#return; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3788#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {3788#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {3827#(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); {3828#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#(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; {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3829#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3788#(= ~q_write_ev~0 ~q_read_ev~0)} #1775#return; {3787#false} is VALID [2022-02-20 19:59:22,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {3787#false} call activate_threads1(); {3830#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:22,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#(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; {3786#true} is VALID [2022-02-20 19:59:22,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {3786#true} call #t~ret8 := is_do_write_p_triggered(); {3786#true} is VALID [2022-02-20 19:59:22,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#true} havoc ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#true} assume !(1 == ~p_dw_pc~0); {3786#true} is VALID [2022-02-20 19:59:22,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#true} ~__retres1~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {3786#true} #res := ~__retres1~0; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3786#true} {3786#true} #1769#return; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {3786#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {3786#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,546 INFO L272 TraceCheckUtils]: 28: Hoare triple {3786#true} call #t~ret9 := is_do_read_c_triggered(); {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {3786#true} havoc ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {3786#true} assume 1 == ~c_dr_pc~0; {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {3786#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {3786#true} #res := ~__retres1~1; {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,547 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3786#true} {3786#true} #1771#return; {3786#true} is VALID [2022-02-20 19:59:22,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {3786#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3786#true} is VALID [2022-02-20 19:59:22,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {3786#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3786#true} is VALID [2022-02-20 19:59:22,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,548 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3786#true} {3787#false} #1777#return; {3787#false} is VALID [2022-02-20 19:59:22,548 INFO L272 TraceCheckUtils]: 39: Hoare triple {3787#false} call reset_delta_events1(); {3827#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {3827#(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); {3786#true} is VALID [2022-02-20 19:59:22,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {3786#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3786#true} is VALID [2022-02-20 19:59:22,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,549 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3786#true} {3787#false} #1779#return; {3787#false} is VALID [2022-02-20 19:59:22,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:22,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {3787#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; {3787#false} is VALID [2022-02-20 19:59:22,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:22,550 INFO L272 TraceCheckUtils]: 47: Hoare triple {3787#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3786#true} is VALID [2022-02-20 19:59:22,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {3786#true} havoc ~__retres1~2; {3786#true} is VALID [2022-02-20 19:59:22,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {3786#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3786#true} is VALID [2022-02-20 19:59:22,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {3786#true} #res := ~__retres1~2; {3786#true} is VALID [2022-02-20 19:59:22,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {3786#true} assume true; {3786#true} is VALID [2022-02-20 19:59:22,550 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3786#true} {3787#false} #1781#return; {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {3787#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; {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {3787#false} assume 0 != eval1_~tmp___1~0#1; {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {3787#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; {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {3787#false} assume !(0 != eval1_~tmp~2#1); {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L272 TraceCheckUtils]: 57: Hoare triple {3787#false} call error1(); {3787#false} is VALID [2022-02-20 19:59:22,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:22,552 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:22,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:22,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632088490] [2022-02-20 19:59:22,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632088490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:22,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:22,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:22,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260083032] [2022-02-20 19:59:22,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:22,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:22,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,585 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:22,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:22,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:22,586 INFO L87 Difference]: Start difference. First operand 545 states and 819 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,891 INFO L93 Difference]: Finished difference Result 894 states and 1298 transitions. [2022-02-20 19:59:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1027 transitions. [2022-02-20 19:59:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1027 transitions. [2022-02-20 19:59:25,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1027 transitions. [2022-02-20 19:59:26,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1027 edges. 1027 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,582 INFO L225 Difference]: With dead ends: 894 [2022-02-20 19:59:26,582 INFO L226 Difference]: Without dead ends: 716 [2022-02-20 19:59:26,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:26,588 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 1353 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:26,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1383 Valid, 2554 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-02-20 19:59:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 641. [2022-02-20 19:59:26,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:26,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 716 states. Second operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:59:26,632 INFO L74 IsIncluded]: Start isIncluded. First operand 716 states. Second operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:59:26,634 INFO L87 Difference]: Start difference. First operand 716 states. Second operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:59:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,657 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2022-02-20 19:59:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1057 transitions. [2022-02-20 19:59:26,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 716 states. [2022-02-20 19:59:26,663 INFO L87 Difference]: Start difference. First operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 716 states. [2022-02-20 19:59:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,686 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2022-02-20 19:59:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1057 transitions. [2022-02-20 19:59:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 19:59:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2022-02-20 19:59:26,732 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 59 [2022-02-20 19:59:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,734 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2022-02-20 19:59:26,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2022-02-20 19:59:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:26,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:26,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:26,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1024415920, now seen corresponding path program 1 times [2022-02-20 19:59:26,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:26,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128306398] [2022-02-20 19:59:26,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {7382#(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); {7343#true} is VALID [2022-02-20 19:59:26,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7343#true} {7343#true} #1773#return; {7343#true} is VALID [2022-02-20 19:59:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {7383#(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); {7343#true} is VALID [2022-02-20 19:59:26,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume !(0 == ~q_write_ev~0); {7343#true} is VALID [2022-02-20 19:59:26,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7343#true} {7343#true} #1775#return; {7343#true} is VALID [2022-02-20 19:59:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {7343#true} havoc ~__retres1~0; {7343#true} is VALID [2022-02-20 19:59:26,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume !(1 == ~p_dw_pc~0); {7343#true} is VALID [2022-02-20 19:59:26,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} ~__retres1~0 := 0; {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:26,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,883 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7343#true} #1769#return; {7391#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {7343#true} havoc ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume 1 == ~c_dr_pc~0; {7343#true} is VALID [2022-02-20 19:59:26,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7343#true} is VALID [2022-02-20 19:59:26,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {7343#true} #res := ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,888 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7343#true} {7344#false} #1771#return; {7344#false} is VALID [2022-02-20 19:59:26,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {7384#(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; {7343#true} is VALID [2022-02-20 19:59:26,889 INFO L272 TraceCheckUtils]: 1: Hoare triple {7343#true} call #t~ret8 := is_do_write_p_triggered(); {7343#true} is VALID [2022-02-20 19:59:26,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} havoc ~__retres1~0; {7343#true} is VALID [2022-02-20 19:59:26,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {7343#true} assume !(1 == ~p_dw_pc~0); {7343#true} is VALID [2022-02-20 19:59:26,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {7343#true} ~__retres1~0 := 0; {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:26,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,891 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7343#true} #1769#return; {7391#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:26,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {7391#(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; {7392#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:26,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {7392#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7344#false} is VALID [2022-02-20 19:59:26,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {7344#false} call #t~ret9 := is_do_read_c_triggered(); {7343#true} is VALID [2022-02-20 19:59:26,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {7343#true} havoc ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {7343#true} assume 1 == ~c_dr_pc~0; {7343#true} is VALID [2022-02-20 19:59:26,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {7343#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7343#true} is VALID [2022-02-20 19:59:26,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {7343#true} #res := ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,898 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7343#true} {7344#false} #1771#return; {7344#false} is VALID [2022-02-20 19:59:26,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {7344#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7344#false} is VALID [2022-02-20 19:59:26,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {7344#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7344#false} is VALID [2022-02-20 19:59:26,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {7344#false} assume true; {7344#false} is VALID [2022-02-20 19:59:26,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7344#false} {7343#true} #1777#return; {7344#false} is VALID [2022-02-20 19:59:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {7383#(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); {7343#true} is VALID [2022-02-20 19:59:26,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7343#true} is VALID [2022-02-20 19:59:26,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7343#true} {7344#false} #1779#return; {7344#false} is VALID [2022-02-20 19:59:26,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {7343#true} havoc ~__retres1~2; {7343#true} is VALID [2022-02-20 19:59:26,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7343#true} is VALID [2022-02-20 19:59:26,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} #res := ~__retres1~2; {7343#true} is VALID [2022-02-20 19:59:26,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,907 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7343#true} {7344#false} #1781#return; {7344#false} is VALID [2022-02-20 19:59:26,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {7343#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {7343#true} is VALID [2022-02-20 19:59:26,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {7343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {7343#true} is VALID [2022-02-20 19:59:26,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {7343#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {7343#true} is VALID [2022-02-20 19:59:26,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {7343#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; {7343#true} is VALID [2022-02-20 19:59:26,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {7343#true} call update_channels1(); {7382#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:26,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {7382#(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); {7343#true} is VALID [2022-02-20 19:59:26,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,909 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7343#true} {7343#true} #1773#return; {7343#true} is VALID [2022-02-20 19:59:26,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {7343#true} assume { :begin_inline_init_threads1 } true; {7343#true} is VALID [2022-02-20 19:59:26,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {7343#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7343#true} is VALID [2022-02-20 19:59:26,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {7343#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7343#true} is VALID [2022-02-20 19:59:26,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {7343#true} assume { :end_inline_init_threads1 } true; {7343#true} is VALID [2022-02-20 19:59:26,910 INFO L272 TraceCheckUtils]: 12: Hoare triple {7343#true} call fire_delta_events1(); {7383#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {7383#(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); {7343#true} is VALID [2022-02-20 19:59:26,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {7343#true} assume !(0 == ~q_write_ev~0); {7343#true} is VALID [2022-02-20 19:59:26,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,911 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7343#true} {7343#true} #1775#return; {7343#true} is VALID [2022-02-20 19:59:26,911 INFO L272 TraceCheckUtils]: 17: Hoare triple {7343#true} call activate_threads1(); {7384#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:26,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {7384#(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; {7343#true} is VALID [2022-02-20 19:59:26,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {7343#true} call #t~ret8 := is_do_write_p_triggered(); {7343#true} is VALID [2022-02-20 19:59:26,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {7343#true} havoc ~__retres1~0; {7343#true} is VALID [2022-02-20 19:59:26,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {7343#true} assume !(1 == ~p_dw_pc~0); {7343#true} is VALID [2022-02-20 19:59:26,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {7343#true} ~__retres1~0 := 0; {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:26,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {7399#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:26,914 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7400#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7343#true} #1769#return; {7391#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:26,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {7391#(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; {7392#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:26,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {7392#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7344#false} is VALID [2022-02-20 19:59:26,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {7344#false} call #t~ret9 := is_do_read_c_triggered(); {7343#true} is VALID [2022-02-20 19:59:26,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {7343#true} havoc ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {7343#true} assume 1 == ~c_dr_pc~0; {7343#true} is VALID [2022-02-20 19:59:26,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {7343#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7343#true} is VALID [2022-02-20 19:59:26,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {7343#true} #res := ~__retres1~1; {7343#true} is VALID [2022-02-20 19:59:26,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,916 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7343#true} {7344#false} #1771#return; {7344#false} is VALID [2022-02-20 19:59:26,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {7344#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7344#false} is VALID [2022-02-20 19:59:26,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {7344#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7344#false} is VALID [2022-02-20 19:59:26,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {7344#false} assume true; {7344#false} is VALID [2022-02-20 19:59:26,917 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7344#false} {7343#true} #1777#return; {7344#false} is VALID [2022-02-20 19:59:26,917 INFO L272 TraceCheckUtils]: 39: Hoare triple {7344#false} call reset_delta_events1(); {7383#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:26,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {7383#(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); {7343#true} is VALID [2022-02-20 19:59:26,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {7343#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7343#true} is VALID [2022-02-20 19:59:26,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,917 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7343#true} {7344#false} #1779#return; {7344#false} is VALID [2022-02-20 19:59:26,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {7344#false} assume !false; {7344#false} is VALID [2022-02-20 19:59:26,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {7344#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; {7344#false} is VALID [2022-02-20 19:59:26,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {7344#false} assume !false; {7344#false} is VALID [2022-02-20 19:59:26,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {7344#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7343#true} is VALID [2022-02-20 19:59:26,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {7343#true} havoc ~__retres1~2; {7343#true} is VALID [2022-02-20 19:59:26,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {7343#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7343#true} is VALID [2022-02-20 19:59:26,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {7343#true} #res := ~__retres1~2; {7343#true} is VALID [2022-02-20 19:59:26,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {7343#true} assume true; {7343#true} is VALID [2022-02-20 19:59:26,919 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7343#true} {7344#false} #1781#return; {7344#false} is VALID [2022-02-20 19:59:26,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {7344#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; {7344#false} is VALID [2022-02-20 19:59:26,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {7344#false} assume 0 != eval1_~tmp___1~0#1; {7344#false} is VALID [2022-02-20 19:59:26,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {7344#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; {7344#false} is VALID [2022-02-20 19:59:26,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {7344#false} assume !(0 != eval1_~tmp~2#1); {7344#false} is VALID [2022-02-20 19:59:26,920 INFO L272 TraceCheckUtils]: 57: Hoare triple {7344#false} call error1(); {7344#false} is VALID [2022-02-20 19:59:26,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {7344#false} assume !false; {7344#false} is VALID [2022-02-20 19:59:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:26,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:26,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128306398] [2022-02-20 19:59:26,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128306398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:26,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:26,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:26,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429350493] [2022-02-20 19:59:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:26,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:26,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:26,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:26,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:26,957 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,394 INFO L93 Difference]: Finished difference Result 943 states and 1368 transitions. [2022-02-20 19:59:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:30,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 844 transitions. [2022-02-20 19:59:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 844 transitions. [2022-02-20 19:59:30,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 844 transitions. [2022-02-20 19:59:30,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 844 edges. 844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:30,971 INFO L225 Difference]: With dead ends: 943 [2022-02-20 19:59:30,971 INFO L226 Difference]: Without dead ends: 675 [2022-02-20 19:59:30,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:30,977 INFO L933 BasicCegarLoop]: 675 mSDtfsCounter, 908 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:30,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 2674 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:59:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-02-20 19:59:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 646. [2022-02-20 19:59:31,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:31,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 675 states. Second operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:59:31,025 INFO L74 IsIncluded]: Start isIncluded. First operand 675 states. Second operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:59:31,026 INFO L87 Difference]: Start difference. First operand 675 states. Second operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:59:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,044 INFO L93 Difference]: Finished difference Result 675 states and 997 transitions. [2022-02-20 19:59:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 997 transitions. [2022-02-20 19:59:31,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 675 states. [2022-02-20 19:59:31,049 INFO L87 Difference]: Start difference. First operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) Second operand 675 states. [2022-02-20 19:59:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,067 INFO L93 Difference]: Finished difference Result 675 states and 997 transitions. [2022-02-20 19:59:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 997 transitions. [2022-02-20 19:59:31,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:31,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-02-20 19:59:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 956 transitions. [2022-02-20 19:59:31,090 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 956 transitions. Word has length 59 [2022-02-20 19:59:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:31,090 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 956 transitions. [2022-02-20 19:59:31,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 956 transitions. [2022-02-20 19:59:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:31,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:31,093 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:31,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:31,093 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -749656306, now seen corresponding path program 1 times [2022-02-20 19:59:31,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:31,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181488598] [2022-02-20 19:59:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {10923#(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); {10924#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {10924#(not (= |old(~q_req_up~0)| 1))} assume true; {10924#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10924#(not (= |old(~q_req_up~0)| 1))} {10884#(= ~c_dr_pc~0 ~q_req_up~0)} #1773#return; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {10925#(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); {10881#true} is VALID [2022-02-20 19:59:31,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {10881#true} assume !(0 == ~q_write_ev~0); {10881#true} is VALID [2022-02-20 19:59:31,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10881#true} {10888#(not (= ~c_dr_pc~0 1))} #1775#return; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {10881#true} havoc ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {10881#true} assume !(1 == ~p_dw_pc~0); {10881#true} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {10881#true} ~__retres1~0 := 0; {10881#true} is VALID [2022-02-20 19:59:31,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {10881#true} #res := ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,228 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10881#true} {10881#true} #1769#return; {10881#true} is VALID [2022-02-20 19:59:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {10881#true} havoc ~__retres1~1; {10881#true} is VALID [2022-02-20 19:59:31,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {10881#true} assume 1 == ~c_dr_pc~0; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,234 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} {10881#true} #1771#return; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {10926#(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; {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L272 TraceCheckUtils]: 1: Hoare triple {10881#true} call #t~ret8 := is_do_write_p_triggered(); {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {10881#true} havoc ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {10881#true} assume !(1 == ~p_dw_pc~0); {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {10881#true} ~__retres1~0 := 0; {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {10881#true} #res := ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10881#true} {10881#true} #1769#return; {10881#true} is VALID [2022-02-20 19:59:31,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {10881#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10881#true} is VALID [2022-02-20 19:59:31,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {10881#true} assume !(0 != ~tmp~1); {10881#true} is VALID [2022-02-20 19:59:31,236 INFO L272 TraceCheckUtils]: 10: Hoare triple {10881#true} call #t~ret9 := is_do_read_c_triggered(); {10881#true} is VALID [2022-02-20 19:59:31,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {10881#true} havoc ~__retres1~1; {10881#true} is VALID [2022-02-20 19:59:31,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {10881#true} assume 1 == ~c_dr_pc~0; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,238 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} {10881#true} #1771#return; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,239 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} {10888#(not (= ~c_dr_pc~0 1))} #1777#return; {10882#false} is VALID [2022-02-20 19:59:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {10925#(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); {10881#true} is VALID [2022-02-20 19:59:31,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {10881#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10881#true} is VALID [2022-02-20 19:59:31,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10881#true} {10882#false} #1779#return; {10882#false} is VALID [2022-02-20 19:59:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {10881#true} havoc ~__retres1~2; {10881#true} is VALID [2022-02-20 19:59:31,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {10881#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10881#true} is VALID [2022-02-20 19:59:31,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {10881#true} #res := ~__retres1~2; {10881#true} is VALID [2022-02-20 19:59:31,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,246 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10881#true} {10882#false} #1781#return; {10882#false} is VALID [2022-02-20 19:59:31,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {10881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {10883#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:31,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {10883#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {10883#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:31,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {10883#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {10884#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:31,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {10884#(= ~c_dr_pc~0 ~q_req_up~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; {10884#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:31,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {10884#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {10923#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:31,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {10923#(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); {10924#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {10924#(not (= |old(~q_req_up~0)| 1))} assume true; {10924#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,249 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10924#(not (= |old(~q_req_up~0)| 1))} {10884#(= ~c_dr_pc~0 ~q_req_up~0)} #1773#return; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {10925#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:31,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {10925#(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); {10881#true} is VALID [2022-02-20 19:59:31,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {10881#true} assume !(0 == ~q_write_ev~0); {10881#true} is VALID [2022-02-20 19:59:31,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,252 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10881#true} {10888#(not (= ~c_dr_pc~0 1))} #1775#return; {10888#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,252 INFO L272 TraceCheckUtils]: 17: Hoare triple {10888#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {10926#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:31,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {10926#(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; {10881#true} is VALID [2022-02-20 19:59:31,252 INFO L272 TraceCheckUtils]: 19: Hoare triple {10881#true} call #t~ret8 := is_do_write_p_triggered(); {10881#true} is VALID [2022-02-20 19:59:31,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {10881#true} havoc ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {10881#true} assume !(1 == ~p_dw_pc~0); {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {10881#true} ~__retres1~0 := 0; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {10881#true} #res := ~__retres1~0; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10881#true} {10881#true} #1769#return; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {10881#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10881#true} is VALID [2022-02-20 19:59:31,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {10881#true} assume !(0 != ~tmp~1); {10881#true} is VALID [2022-02-20 19:59:31,254 INFO L272 TraceCheckUtils]: 28: Hoare triple {10881#true} call #t~ret9 := is_do_read_c_triggered(); {10881#true} is VALID [2022-02-20 19:59:31,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {10881#true} havoc ~__retres1~1; {10881#true} is VALID [2022-02-20 19:59:31,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {10881#true} assume 1 == ~c_dr_pc~0; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,255 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} {10881#true} #1771#return; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,257 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10939#(= (+ (- 1) ~c_dr_pc~0) 0)} {10888#(not (= ~c_dr_pc~0 1))} #1777#return; {10882#false} is VALID [2022-02-20 19:59:31,257 INFO L272 TraceCheckUtils]: 39: Hoare triple {10882#false} call reset_delta_events1(); {10925#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:31,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {10925#(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); {10881#true} is VALID [2022-02-20 19:59:31,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {10881#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10881#true} is VALID [2022-02-20 19:59:31,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,257 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10881#true} {10882#false} #1779#return; {10882#false} is VALID [2022-02-20 19:59:31,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {10882#false} assume !false; {10882#false} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {10882#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; {10882#false} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {10882#false} assume !false; {10882#false} is VALID [2022-02-20 19:59:31,258 INFO L272 TraceCheckUtils]: 47: Hoare triple {10882#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10881#true} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {10881#true} havoc ~__retres1~2; {10881#true} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {10881#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10881#true} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {10881#true} #res := ~__retres1~2; {10881#true} is VALID [2022-02-20 19:59:31,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {10881#true} assume true; {10881#true} is VALID [2022-02-20 19:59:31,259 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10881#true} {10882#false} #1781#return; {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {10882#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; {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {10882#false} assume 0 != eval1_~tmp___1~0#1; {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {10882#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; {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {10882#false} assume !(0 != eval1_~tmp~2#1); {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L272 TraceCheckUtils]: 57: Hoare triple {10882#false} call error1(); {10882#false} is VALID [2022-02-20 19:59:31,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {10882#false} assume !false; {10882#false} is VALID [2022-02-20 19:59:31,260 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:31,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:31,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181488598] [2022-02-20 19:59:31,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181488598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:31,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122721945] [2022-02-20 19:59:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:59:31,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:31,296 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:31,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:31,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:31,297 INFO L87 Difference]: Start difference. First operand 646 states and 956 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,812 INFO L93 Difference]: Finished difference Result 1982 states and 2762 transitions. [2022-02-20 19:59:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:36,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:59:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1371 transitions. [2022-02-20 19:59:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1371 transitions. [2022-02-20 19:59:36,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1371 transitions. [2022-02-20 19:59:37,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1371 edges. 1371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:37,723 INFO L225 Difference]: With dead ends: 1982 [2022-02-20 19:59:37,724 INFO L226 Difference]: Without dead ends: 1691 [2022-02-20 19:59:37,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:37,730 INFO L933 BasicCegarLoop]: 781 mSDtfsCounter, 3863 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:37,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3877 Valid, 2467 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:59:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-02-20 19:59:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1547. [2022-02-20 19:59:37,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:37,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:59:37,809 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:59:37,811 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:59:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,913 INFO L93 Difference]: Finished difference Result 1691 states and 2255 transitions. [2022-02-20 19:59:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2255 transitions. [2022-02-20 19:59:37,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:37,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:37,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1691 states. [2022-02-20 19:59:37,923 INFO L87 Difference]: Start difference. First operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) Second operand 1691 states. [2022-02-20 19:59:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:38,018 INFO L93 Difference]: Finished difference Result 1691 states and 2255 transitions. [2022-02-20 19:59:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2255 transitions. [2022-02-20 19:59:38,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:38,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:38,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:38,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-02-20 19:59:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2097 transitions. [2022-02-20 19:59:38,159 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2097 transitions. Word has length 59 [2022-02-20 19:59:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:38,159 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 2097 transitions. [2022-02-20 19:59:38,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2097 transitions. [2022-02-20 19:59:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:38,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:38,162 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:38,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:38,163 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1721330993, now seen corresponding path program 1 times [2022-02-20 19:59:38,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:38,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072657624] [2022-02-20 19:59:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {19160#(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); {19121#true} is VALID [2022-02-20 19:59:38,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19121#true} {19121#true} #1773#return; {19121#true} is VALID [2022-02-20 19:59:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {19161#(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); {19121#true} is VALID [2022-02-20 19:59:38,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume !(0 == ~q_write_ev~0); {19121#true} is VALID [2022-02-20 19:59:38,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19121#true} {19121#true} #1775#return; {19121#true} is VALID [2022-02-20 19:59:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {19121#true} havoc ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume !(1 == ~p_dw_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} ~__retres1~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {19121#true} #res := ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,259 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19121#true} {19121#true} #1769#return; {19121#true} is VALID [2022-02-20 19:59:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {19121#true} havoc ~__retres1~1; {19121#true} is VALID [2022-02-20 19:59:38,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume !(1 == ~c_dr_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} ~__retres1~1 := 0; {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:38,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,287 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19121#true} #1771#return; {19175#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:38,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {19162#(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; {19121#true} is VALID [2022-02-20 19:59:38,287 INFO L272 TraceCheckUtils]: 1: Hoare triple {19121#true} call #t~ret8 := is_do_write_p_triggered(); {19121#true} is VALID [2022-02-20 19:59:38,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} havoc ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {19121#true} assume !(1 == ~p_dw_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {19121#true} ~__retres1~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {19121#true} #res := ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,289 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19121#true} {19121#true} #1769#return; {19121#true} is VALID [2022-02-20 19:59:38,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {19121#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19121#true} is VALID [2022-02-20 19:59:38,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {19121#true} assume !(0 != ~tmp~1); {19121#true} is VALID [2022-02-20 19:59:38,289 INFO L272 TraceCheckUtils]: 10: Hoare triple {19121#true} call #t~ret9 := is_do_read_c_triggered(); {19121#true} is VALID [2022-02-20 19:59:38,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {19121#true} havoc ~__retres1~1; {19121#true} is VALID [2022-02-20 19:59:38,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {19121#true} assume !(1 == ~c_dr_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {19121#true} ~__retres1~1 := 0; {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:38,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19121#true} #1771#return; {19175#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:38,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {19175#(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; {19176#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:38,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {19176#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19122#false} is VALID [2022-02-20 19:59:38,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {19122#false} assume true; {19122#false} is VALID [2022-02-20 19:59:38,292 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19122#false} {19121#true} #1777#return; {19122#false} is VALID [2022-02-20 19:59:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {19161#(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); {19121#true} is VALID [2022-02-20 19:59:38,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19121#true} is VALID [2022-02-20 19:59:38,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19121#true} {19122#false} #1779#return; {19122#false} is VALID [2022-02-20 19:59:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {19121#true} havoc ~__retres1~2; {19121#true} is VALID [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19121#true} is VALID [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} #res := ~__retres1~2; {19121#true} is VALID [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,301 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19121#true} {19122#false} #1781#return; {19122#false} is VALID [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {19121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {19121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {19121#true} is VALID [2022-02-20 19:59:38,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {19121#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {19121#true} is VALID [2022-02-20 19:59:38,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {19121#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; {19121#true} is VALID [2022-02-20 19:59:38,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {19121#true} call update_channels1(); {19160#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:38,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {19160#(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); {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19121#true} {19121#true} #1773#return; {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {19121#true} assume { :begin_inline_init_threads1 } true; {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {19121#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {19121#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {19121#true} assume { :end_inline_init_threads1 } true; {19121#true} is VALID [2022-02-20 19:59:38,304 INFO L272 TraceCheckUtils]: 12: Hoare triple {19121#true} call fire_delta_events1(); {19161#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:38,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {19161#(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); {19121#true} is VALID [2022-02-20 19:59:38,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {19121#true} assume !(0 == ~q_write_ev~0); {19121#true} is VALID [2022-02-20 19:59:38,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19121#true} {19121#true} #1775#return; {19121#true} is VALID [2022-02-20 19:59:38,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {19121#true} call activate_threads1(); {19162#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:38,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {19162#(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; {19121#true} is VALID [2022-02-20 19:59:38,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {19121#true} call #t~ret8 := is_do_write_p_triggered(); {19121#true} is VALID [2022-02-20 19:59:38,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {19121#true} havoc ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {19121#true} assume !(1 == ~p_dw_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {19121#true} ~__retres1~0 := 0; {19121#true} is VALID [2022-02-20 19:59:38,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {19121#true} #res := ~__retres1~0; {19121#true} is VALID [2022-02-20 19:59:38,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,310 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19121#true} {19121#true} #1769#return; {19121#true} is VALID [2022-02-20 19:59:38,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {19121#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19121#true} is VALID [2022-02-20 19:59:38,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {19121#true} assume !(0 != ~tmp~1); {19121#true} is VALID [2022-02-20 19:59:38,311 INFO L272 TraceCheckUtils]: 28: Hoare triple {19121#true} call #t~ret9 := is_do_read_c_triggered(); {19121#true} is VALID [2022-02-20 19:59:38,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {19121#true} havoc ~__retres1~1; {19121#true} is VALID [2022-02-20 19:59:38,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {19121#true} assume !(1 == ~c_dr_pc~0); {19121#true} is VALID [2022-02-20 19:59:38,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {19121#true} ~__retres1~1 := 0; {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:38,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {19177#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:38,316 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19178#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19121#true} #1771#return; {19175#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:38,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {19175#(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; {19176#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:38,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {19176#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19122#false} is VALID [2022-02-20 19:59:38,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {19122#false} assume true; {19122#false} is VALID [2022-02-20 19:59:38,317 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19122#false} {19121#true} #1777#return; {19122#false} is VALID [2022-02-20 19:59:38,317 INFO L272 TraceCheckUtils]: 39: Hoare triple {19122#false} call reset_delta_events1(); {19161#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:38,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {19161#(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); {19121#true} is VALID [2022-02-20 19:59:38,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {19121#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19121#true} is VALID [2022-02-20 19:59:38,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,318 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19121#true} {19122#false} #1779#return; {19122#false} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {19122#false} assume !false; {19122#false} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {19122#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; {19122#false} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {19122#false} assume !false; {19122#false} is VALID [2022-02-20 19:59:38,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {19122#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19121#true} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {19121#true} havoc ~__retres1~2; {19121#true} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {19121#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19121#true} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {19121#true} #res := ~__retres1~2; {19121#true} is VALID [2022-02-20 19:59:38,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {19121#true} assume true; {19121#true} is VALID [2022-02-20 19:59:38,319 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19121#true} {19122#false} #1781#return; {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {19122#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; {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {19122#false} assume 0 != eval1_~tmp___1~0#1; {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {19122#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; {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {19122#false} assume !(0 != eval1_~tmp~2#1); {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L272 TraceCheckUtils]: 57: Hoare triple {19122#false} call error1(); {19122#false} is VALID [2022-02-20 19:59:38,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {19122#false} assume !false; {19122#false} is VALID [2022-02-20 19:59:38,320 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:38,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:38,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072657624] [2022-02-20 19:59:38,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072657624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:38,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:38,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:38,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299328114] [2022-02-20 19:59:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:38,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:38,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:38,359 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:38,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:38,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:38,361 INFO L87 Difference]: Start difference. First operand 1547 states and 2097 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:41,762 INFO L93 Difference]: Finished difference Result 2839 states and 3771 transitions. [2022-02-20 19:59:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:41,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 843 transitions. [2022-02-20 19:59:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 843 transitions. [2022-02-20 19:59:41,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 843 transitions. [2022-02-20 19:59:42,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 843 edges. 843 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:42,452 INFO L225 Difference]: With dead ends: 2839 [2022-02-20 19:59:42,452 INFO L226 Difference]: Without dead ends: 1653 [2022-02-20 19:59:42,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:42,455 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 610 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:42,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 2976 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-02-20 19:59:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1577. [2022-02-20 19:59:42,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:42,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1653 states. Second operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:59:42,535 INFO L74 IsIncluded]: Start isIncluded. First operand 1653 states. Second operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:59:42,537 INFO L87 Difference]: Start difference. First operand 1653 states. Second operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:59:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,625 INFO L93 Difference]: Finished difference Result 1653 states and 2210 transitions. [2022-02-20 19:59:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2210 transitions. [2022-02-20 19:59:42,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1653 states. [2022-02-20 19:59:42,633 INFO L87 Difference]: Start difference. First operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) Second operand 1653 states. [2022-02-20 19:59:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:42,719 INFO L93 Difference]: Finished difference Result 1653 states and 2210 transitions. [2022-02-20 19:59:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2210 transitions. [2022-02-20 19:59:42,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:42,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:42,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:42,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-02-20 19:59:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2119 transitions. [2022-02-20 19:59:42,829 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2119 transitions. Word has length 59 [2022-02-20 19:59:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:42,829 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 2119 transitions. [2022-02-20 19:59:42,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2119 transitions. [2022-02-20 19:59:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:42,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:42,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:42,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:42,830 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash 768197969, now seen corresponding path program 1 times [2022-02-20 19:59:42,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:42,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501986944] [2022-02-20 19:59:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {28458#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1773#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {28459#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {28459#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1775#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {28418#true} havoc ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {28418#true} assume !(1 == ~p_dw_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {28418#true} ~__retres1~0 := 0; {28418#true} is VALID [2022-02-20 19:59:42,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {28418#true} #res := ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,916 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28418#true} {28418#true} #1769#return; {28418#true} is VALID [2022-02-20 19:59:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {28418#true} havoc ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {28418#true} assume !(1 == ~c_dr_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {28418#true} ~__retres1~1 := 0; {28418#true} is VALID [2022-02-20 19:59:42,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {28418#true} #res := ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,921 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28418#true} {28418#true} #1771#return; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {28460#(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; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L272 TraceCheckUtils]: 1: Hoare triple {28418#true} call #t~ret8 := is_do_write_p_triggered(); {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {28418#true} havoc ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {28418#true} assume !(1 == ~p_dw_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {28418#true} ~__retres1~0 := 0; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {28418#true} #res := ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28418#true} {28418#true} #1769#return; {28418#true} is VALID [2022-02-20 19:59:42,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {28418#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {28418#true} assume !(0 != ~tmp~1); {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L272 TraceCheckUtils]: 10: Hoare triple {28418#true} call #t~ret9 := is_do_read_c_triggered(); {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {28418#true} havoc ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {28418#true} assume !(1 == ~c_dr_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {28418#true} ~__retres1~1 := 0; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {28418#true} #res := ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28418#true} {28418#true} #1771#return; {28418#true} is VALID [2022-02-20 19:59:42,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {28418#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28418#true} is VALID [2022-02-20 19:59:42,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {28418#true} assume !(0 != ~tmp___0~1); {28418#true} is VALID [2022-02-20 19:59:42,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,924 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28418#true} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1777#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {28459#(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); {28473#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:42,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {28473#(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; {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1779#return; {28419#false} is VALID [2022-02-20 19:59:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:42,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {28418#true} havoc ~__retres1~2; {28418#true} is VALID [2022-02-20 19:59:42,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {28418#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28418#true} is VALID [2022-02-20 19:59:42,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {28418#true} #res := ~__retres1~2; {28418#true} is VALID [2022-02-20 19:59:42,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,947 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28418#true} {28419#false} #1781#return; {28419#false} is VALID [2022-02-20 19:59:42,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {28418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~token~0 := 0;~local~0 := 0; {28418#true} is VALID [2022-02-20 19:59:42,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {28418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {28418#true} is VALID [2022-02-20 19:59:42,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {28418#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {28420#(= ~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; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {28458#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:42,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {28458#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,953 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1773#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,954 INFO L272 TraceCheckUtils]: 12: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {28459#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {28459#(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); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1775#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,956 INFO L272 TraceCheckUtils]: 17: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {28460#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {28460#(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; {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {28418#true} call #t~ret8 := is_do_write_p_triggered(); {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {28418#true} havoc ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {28418#true} assume !(1 == ~p_dw_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {28418#true} ~__retres1~0 := 0; {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {28418#true} #res := ~__retres1~0; {28418#true} is VALID [2022-02-20 19:59:42,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28418#true} {28418#true} #1769#return; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {28418#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {28418#true} assume !(0 != ~tmp~1); {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L272 TraceCheckUtils]: 28: Hoare triple {28418#true} call #t~ret9 := is_do_read_c_triggered(); {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {28418#true} havoc ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {28418#true} assume !(1 == ~c_dr_pc~0); {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {28418#true} ~__retres1~1 := 0; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {28418#true} #res := ~__retres1~1; {28418#true} is VALID [2022-02-20 19:59:42,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,958 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28418#true} {28418#true} #1771#return; {28418#true} is VALID [2022-02-20 19:59:42,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {28418#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28418#true} is VALID [2022-02-20 19:59:42,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {28418#true} assume !(0 != ~tmp___0~1); {28418#true} is VALID [2022-02-20 19:59:42,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,958 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28418#true} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1777#return; {28420#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:42,959 INFO L272 TraceCheckUtils]: 39: Hoare triple {28420#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {28459#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:42,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {28459#(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); {28473#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:42,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {28473#(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; {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:42,962 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {28474#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28420#(= ~q_write_ev~0 ~q_read_ev~0)} #1779#return; {28419#false} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {28419#false} assume !false; {28419#false} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {28419#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; {28419#false} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {28419#false} assume !false; {28419#false} is VALID [2022-02-20 19:59:42,962 INFO L272 TraceCheckUtils]: 47: Hoare triple {28419#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28418#true} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {28418#true} havoc ~__retres1~2; {28418#true} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {28418#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28418#true} is VALID [2022-02-20 19:59:42,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {28418#true} #res := ~__retres1~2; {28418#true} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {28418#true} assume true; {28418#true} is VALID [2022-02-20 19:59:42,963 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28418#true} {28419#false} #1781#return; {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {28419#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; {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {28419#false} assume 0 != eval1_~tmp___1~0#1; {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {28419#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; {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {28419#false} assume !(0 != eval1_~tmp~2#1); {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L272 TraceCheckUtils]: 57: Hoare triple {28419#false} call error1(); {28419#false} is VALID [2022-02-20 19:59:42,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {28419#false} assume !false; {28419#false} is VALID [2022-02-20 19:59:42,964 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:42,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:42,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501986944] [2022-02-20 19:59:42,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501986944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:42,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:42,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:42,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787461233] [2022-02-20 19:59:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:42,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:42,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:42,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:42,994 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:42,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:42,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:42,995 INFO L87 Difference]: Start difference. First operand 1577 states and 2119 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,813 INFO L93 Difference]: Finished difference Result 2834 states and 3668 transitions. [2022-02-20 19:59:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1002 transitions. [2022-02-20 19:59:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1002 transitions. [2022-02-20 19:59:45,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1002 transitions. [2022-02-20 19:59:46,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1002 edges. 1002 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,649 INFO L225 Difference]: With dead ends: 2834 [2022-02-20 19:59:46,650 INFO L226 Difference]: Without dead ends: 1841 [2022-02-20 19:59:46,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:46,652 INFO L933 BasicCegarLoop]: 681 mSDtfsCounter, 1673 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:46,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1701 Valid, 1987 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-02-20 19:59:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1519. [2022-02-20 19:59:46,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:46,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1841 states. Second operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:59:46,745 INFO L74 IsIncluded]: Start isIncluded. First operand 1841 states. Second operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:59:46,747 INFO L87 Difference]: Start difference. First operand 1841 states. Second operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:59:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,844 INFO L93 Difference]: Finished difference Result 1841 states and 2382 transitions. [2022-02-20 19:59:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2382 transitions. [2022-02-20 19:59:46,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) Second operand 1841 states. [2022-02-20 19:59:46,851 INFO L87 Difference]: Start difference. First operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) Second operand 1841 states. [2022-02-20 19:59:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,952 INFO L93 Difference]: Finished difference Result 1841 states and 2382 transitions. [2022-02-20 19:59:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2382 transitions. [2022-02-20 19:59:46,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:46,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-02-20 19:59:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2037 transitions. [2022-02-20 19:59:47,043 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2037 transitions. Word has length 59 [2022-02-20 19:59:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:47,043 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 2037 transitions. [2022-02-20 19:59:47,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2037 transitions. [2022-02-20 19:59:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:47,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:47,044 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:47,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:47,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1225946737, now seen corresponding path program 1 times [2022-02-20 19:59:47,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:47,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208487636] [2022-02-20 19:59:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:47,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:47,117 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:47,117 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:47,118 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:47,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:47,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:47,125 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:47,128 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:47,183 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:47,187 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:47,194 INFO L158 Benchmark]: Toolchain (without parser) took 30816.34ms. Allocated memory was 107.0MB in the beginning and 448.8MB in the end (delta: 341.8MB). Free memory was 76.4MB in the beginning and 305.3MB in the end (delta: -228.9MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,194 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:47,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.80ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.84ms. Allocated memory is still 107.0MB. Free memory was 64.1MB in the beginning and 58.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,195 INFO L158 Benchmark]: Boogie Preprocessor took 102.03ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 58.2MB in the beginning and 122.2MB in the end (delta: -64.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,195 INFO L158 Benchmark]: RCFGBuilder took 709.65ms. Allocated memory is still 148.9MB. Free memory was 122.1MB in the beginning and 106.0MB in the end (delta: 16.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,195 INFO L158 Benchmark]: TraceAbstraction took 29458.24ms. Allocated memory was 148.9MB in the beginning and 448.8MB in the end (delta: 299.9MB). Free memory was 105.8MB in the beginning and 305.3MB in the end (delta: -199.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:47,197 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.17ms. Allocated memory is still 107.0MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.80ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.84ms. Allocated memory is still 107.0MB. Free memory was 64.1MB in the beginning and 58.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.03ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 58.2MB in the beginning and 122.2MB in the end (delta: -64.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.65ms. Allocated memory is still 148.9MB. Free memory was 122.1MB in the beginning and 106.0MB in the end (delta: 16.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29458.24ms. Allocated memory was 148.9MB in the beginning and 448.8MB in the end (delta: 299.9MB). Free memory was 105.8MB in the beginning and 305.3MB in the end (delta: -199.5MB). Peak memory consumption was 100.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:47,225 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.11.cil-2.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 d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:49,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:49,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:49,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:49,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:49,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:49,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:49,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:49,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:49,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:49,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:49,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:49,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:49,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:49,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:49,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:49,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:49,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:49,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:49,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:49,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:49,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:49,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:49,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:49,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:49,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:49,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:49,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:49,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:49,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:49,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:49,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:49,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:49,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:49,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:49,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:49,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:49,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:49,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:49,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:49,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:49,144 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:49,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:49,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:49,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:49,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:49,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:49,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:49,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:49,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:49,176 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:49,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:49,177 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:49,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:49,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:49,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:49,179 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:49,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:49,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:49,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:49,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:49,180 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 -> d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 [2022-02-20 19:59:49,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:49,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:49,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:49,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:49,404 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:49,405 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.11.cil-2.c [2022-02-20 19:59:49,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fe0d0ae/0be507504745496b84a64c30bbd0ae8a/FLAGd0830696e [2022-02-20 19:59:49,899 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:49,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-02-20 19:59:49,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fe0d0ae/0be507504745496b84a64c30bbd0ae8a/FLAGd0830696e [2022-02-20 19:59:49,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fe0d0ae/0be507504745496b84a64c30bbd0ae8a [2022-02-20 19:59:49,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:49,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:49,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:49,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:49,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:49,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:49" (1/1) ... [2022-02-20 19:59:49,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625a27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:49, skipping insertion in model container [2022-02-20 19:59:49,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:49" (1/1) ... [2022-02-20 19:59:49,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:49,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:50,116 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.11.cil-2.c[914,927] [2022-02-20 19:59:50,204 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.11.cil-2.c[7125,7138] [2022-02-20 19:59:50,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:50,294 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:50,309 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.11.cil-2.c[914,927] [2022-02-20 19:59:50,323 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.11.cil-2.c[7125,7138] [2022-02-20 19:59:50,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:50,439 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:50,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:50 WrapperNode [2022-02-20 19:59:50,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:50,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:50,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:50,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:50,445 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:50" (1/1) ... [2022-02-20 19:59:50,458 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:50" (1/1) ... [2022-02-20 19:59:50,507 INFO L137 Inliner]: procedures = 76, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 946 [2022-02-20 19:59:50,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:50,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:50,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:50,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:50,518 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:50" (1/1) ... [2022-02-20 19:59:50,519 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:50" (1/1) ... [2022-02-20 19:59:50,523 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:50" (1/1) ... [2022-02-20 19:59:50,528 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:50" (1/1) ... [2022-02-20 19:59:50,540 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:50" (1/1) ... [2022-02-20 19:59:50,560 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:50" (1/1) ... [2022-02-20 19:59:50,563 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:50" (1/1) ... [2022-02-20 19:59:50,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:50,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:50,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:50,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:50,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:50" (1/1) ... [2022-02-20 19:59:50,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:50,595 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:50,628 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:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:50,643 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:50,643 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:50,647 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:50,797 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:50,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:51,591 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:51,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:51,601 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 19:59:51,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:51 BoogieIcfgContainer [2022-02-20 19:59:51,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:51,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:51,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:51,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:51,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:49" (1/3) ... [2022-02-20 19:59:51,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa5ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:51, skipping insertion in model container [2022-02-20 19:59:51,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:50" (2/3) ... [2022-02-20 19:59:51,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa5ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:51, skipping insertion in model container [2022-02-20 19:59:51,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:51" (3/3) ... [2022-02-20 19:59:51,608 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-02-20 19:59:51,611 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:51,611 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:51,641 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:51,646 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:51,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 19:59:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:51,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2137736078, now seen corresponding path program 1 times [2022-02-20 19:59:51,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:51,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262874656] [2022-02-20 19:59:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:51,715 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:51,724 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:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:52,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {462#true} is VALID [2022-02-20 19:59:52,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1; {462#true} is VALID [2022-02-20 19:59:52,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume 0bv32 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {473#(= (_ 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; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,157 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {473#(= (_ bv2 32) ~q_read_ev~0)} #1773#return; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {473#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,160 INFO L272 TraceCheckUtils]: 12: Hoare triple {473#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:52,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {508#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:52,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {508#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:52,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {508#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:52,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#(= |old(~q_read_ev~0)| (_ bv0 32))} {473#(= (_ bv2 32) ~q_read_ev~0)} #1775#return; {463#false} is VALID [2022-02-20 19:59:52,162 INFO L272 TraceCheckUtils]: 17: Hoare triple {463#false} call activate_threads1(); {463#false} is VALID [2022-02-20 19:59:52,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {463#false} havoc ~tmp~1;havoc ~tmp___0~1; {463#false} is VALID [2022-02-20 19:59:52,163 INFO L272 TraceCheckUtils]: 19: Hoare triple {463#false} call #t~ret8 := is_do_write_p_triggered(); {463#false} is VALID [2022-02-20 19:59:52,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {463#false} havoc ~__retres1~0; {463#false} is VALID [2022-02-20 19:59:52,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {463#false} assume !(1bv32 == ~p_dw_pc~0); {463#false} is VALID [2022-02-20 19:59:52,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {463#false} ~__retres1~0 := 0bv32; {463#false} is VALID [2022-02-20 19:59:52,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {463#false} #res := ~__retres1~0; {463#false} is VALID [2022-02-20 19:59:52,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {463#false} assume true; {463#false} is VALID [2022-02-20 19:59:52,165 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {463#false} {463#false} #1769#return; {463#false} is VALID [2022-02-20 19:59:52,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {463#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {463#false} is VALID [2022-02-20 19:59:52,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {463#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {463#false} is VALID [2022-02-20 19:59:52,166 INFO L272 TraceCheckUtils]: 28: Hoare triple {463#false} call #t~ret9 := is_do_read_c_triggered(); {463#false} is VALID [2022-02-20 19:59:52,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {463#false} havoc ~__retres1~1; {463#false} is VALID [2022-02-20 19:59:52,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {463#false} assume 1bv32 == ~c_dr_pc~0; {463#false} is VALID [2022-02-20 19:59:52,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {463#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {463#false} is VALID [2022-02-20 19:59:52,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {463#false} #res := ~__retres1~1; {463#false} is VALID [2022-02-20 19:59:52,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {463#false} assume true; {463#false} is VALID [2022-02-20 19:59:52,168 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {463#false} {463#false} #1771#return; {463#false} is VALID [2022-02-20 19:59:52,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {463#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {463#false} is VALID [2022-02-20 19:59:52,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {463#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {463#false} is VALID [2022-02-20 19:59:52,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {463#false} assume true; {463#false} is VALID [2022-02-20 19:59:52,169 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {463#false} {463#false} #1777#return; {463#false} is VALID [2022-02-20 19:59:52,169 INFO L272 TraceCheckUtils]: 39: Hoare triple {463#false} call reset_delta_events1(); {463#false} is VALID [2022-02-20 19:59:52,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {463#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {463#false} is VALID [2022-02-20 19:59:52,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {463#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {463#false} is VALID [2022-02-20 19:59:52,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {463#false} assume true; {463#false} is VALID [2022-02-20 19:59:52,172 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {463#false} {463#false} #1779#return; {463#false} is VALID [2022-02-20 19:59:52,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:52,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {463#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; {463#false} is VALID [2022-02-20 19:59:52,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:52,173 INFO L272 TraceCheckUtils]: 47: Hoare triple {463#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {463#false} is VALID [2022-02-20 19:59:52,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {463#false} havoc ~__retres1~2; {463#false} is VALID [2022-02-20 19:59:52,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {463#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {463#false} is VALID [2022-02-20 19:59:52,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {463#false} #res := ~__retres1~2; {463#false} is VALID [2022-02-20 19:59:52,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {463#false} assume true; {463#false} is VALID [2022-02-20 19:59:52,181 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {463#false} {463#false} #1781#return; {463#false} is VALID [2022-02-20 19:59:52,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {463#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {463#false} is VALID [2022-02-20 19:59:52,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {463#false} assume 0bv32 != eval1_~tmp___1~0#1; {463#false} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {463#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {463#false} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {463#false} assume !(0bv32 != eval1_~tmp~2#1); {463#false} is VALID [2022-02-20 19:59:52,184 INFO L272 TraceCheckUtils]: 57: Hoare triple {463#false} call error1(); {463#false} is VALID [2022-02-20 19:59:52,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 19:59:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:52,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:52,186 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:52,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262874656] [2022-02-20 19:59:52,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262874656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:52,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:52,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:52,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074883122] [2022-02-20 19:59:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:52,193 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:52,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:52,196 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:52,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:52,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:52,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:52,266 INFO L87 Difference]: Start difference. First operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) 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:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,474 INFO L93 Difference]: Finished difference Result 995 states and 1592 transitions. [2022-02-20 19:59:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:54,474 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:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:54,475 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:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1592 transitions. [2022-02-20 19:59:54,498 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:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1592 transitions. [2022-02-20 19:59:54,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1592 transitions. [2022-02-20 19:59:55,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1592 edges. 1592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,447 INFO L225 Difference]: With dead ends: 995 [2022-02-20 19:59:55,448 INFO L226 Difference]: Without dead ends: 553 [2022-02-20 19:59:55,452 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:55,454 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 458 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:55,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 1749 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-02-20 19:59:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 545. [2022-02-20 19:59:55,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:55,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:55,501 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:55,502 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,523 INFO L93 Difference]: Finished difference Result 553 states and 828 transitions. [2022-02-20 19:59:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 828 transitions. [2022-02-20 19:59:55,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 553 states. [2022-02-20 19:59:55,530 INFO L87 Difference]: Start difference. First operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) Second operand 553 states. [2022-02-20 19:59:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,549 INFO L93 Difference]: Finished difference Result 553 states and 828 transitions. [2022-02-20 19:59:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 828 transitions. [2022-02-20 19:59:55,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:55,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-02-20 19:59:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 819 transitions. [2022-02-20 19:59:55,575 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 819 transitions. Word has length 59 [2022-02-20 19:59:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:55,575 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 819 transitions. [2022-02-20 19:59:55,576 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:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 819 transitions. [2022-02-20 19:59:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:55,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:55,577 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:55,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 19:59:55,785 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:55,786 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1917902258, now seen corresponding path program 1 times [2022-02-20 19:59:55,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:55,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215077093] [2022-02-20 19:59:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:55,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:55,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:55,788 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:55,801 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:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:56,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {3786#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3786#true} is VALID [2022-02-20 19:59:56,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {3786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1; {3786#true} is VALID [2022-02-20 19:59:56,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {3786#true} assume 0bv32 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {3797#(= (_ 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; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,012 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {3797#(= (_ bv2 32) ~q_write_ev~0)} #1773#return; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {3797#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,014 INFO L272 TraceCheckUtils]: 12: Hoare triple {3797#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:56,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {3804#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {3835#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:56,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {3835#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {3835#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:56,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3835#(= |old(~q_write_ev~0)| (_ bv0 32))} {3797#(= (_ bv2 32) ~q_write_ev~0)} #1775#return; {3787#false} is VALID [2022-02-20 19:59:56,015 INFO L272 TraceCheckUtils]: 17: Hoare triple {3787#false} call activate_threads1(); {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {3787#false} havoc ~tmp~1;havoc ~tmp___0~1; {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {3787#false} call #t~ret8 := is_do_write_p_triggered(); {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {3787#false} havoc ~__retres1~0; {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {3787#false} assume !(1bv32 == ~p_dw_pc~0); {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {3787#false} ~__retres1~0 := 0bv32; {3787#false} is VALID [2022-02-20 19:59:56,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {3787#false} #res := ~__retres1~0; {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {3787#false} assume true; {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3787#false} {3787#false} #1769#return; {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {3787#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L272 TraceCheckUtils]: 28: Hoare triple {3787#false} call #t~ret9 := is_do_read_c_triggered(); {3787#false} is VALID [2022-02-20 19:59:56,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {3787#false} havoc ~__retres1~1; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {3787#false} assume 1bv32 == ~c_dr_pc~0; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {3787#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {3787#false} #res := ~__retres1~1; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3787#false} assume true; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3787#false} {3787#false} #1771#return; {3787#false} is VALID [2022-02-20 19:59:56,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {3787#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {3787#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {3787#false} assume true; {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3787#false} {3787#false} #1777#return; {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L272 TraceCheckUtils]: 39: Hoare triple {3787#false} call reset_delta_events1(); {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {3787#false} assume !(1bv32 == ~q_read_ev~0); {3787#false} is VALID [2022-02-20 19:59:56,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {3787#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {3787#false} assume true; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3787#false} {3787#false} #1779#return; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {3787#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; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:56,020 INFO L272 TraceCheckUtils]: 47: Hoare triple {3787#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {3787#false} havoc ~__retres1~2; {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {3787#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {3787#false} #res := ~__retres1~2; {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {3787#false} assume true; {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3787#false} {3787#false} #1781#return; {3787#false} is VALID [2022-02-20 19:59:56,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {3787#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3787#false} is VALID [2022-02-20 19:59:56,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {3787#false} assume 0bv32 != eval1_~tmp___1~0#1; {3787#false} is VALID [2022-02-20 19:59:56,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {3787#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3787#false} is VALID [2022-02-20 19:59:56,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {3787#false} assume !(0bv32 != eval1_~tmp~2#1); {3787#false} is VALID [2022-02-20 19:59:56,022 INFO L272 TraceCheckUtils]: 57: Hoare triple {3787#false} call error1(); {3787#false} is VALID [2022-02-20 19:59:56,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2022-02-20 19:59:56,023 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:56,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:56,023 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:56,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215077093] [2022-02-20 19:59:56,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215077093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:56,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:56,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:56,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249807605] [2022-02-20 19:59:56,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:56,025 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:56,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:56,026 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:56,066 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:56,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:56,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:56,067 INFO L87 Difference]: Start difference. First operand 545 states and 819 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:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,149 INFO L93 Difference]: Finished difference Result 939 states and 1375 transitions. [2022-02-20 19:59:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:58,150 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:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:58,150 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:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2022-02-20 19:59:58,163 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:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2022-02-20 19:59:58,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 956 transitions. [2022-02-20 19:59:58,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 956 edges. 956 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:58,868 INFO L225 Difference]: With dead ends: 939 [2022-02-20 19:59:58,869 INFO L226 Difference]: Without dead ends: 759 [2022-02-20 19:59:58,870 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:58,870 INFO L933 BasicCegarLoop]: 693 mSDtfsCounter, 445 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:58,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 1722 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-02-20 19:59:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 750. [2022-02-20 19:59:58,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:58,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 759 states. Second operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) [2022-02-20 19:59:58,894 INFO L74 IsIncluded]: Start isIncluded. First operand 759 states. Second operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) [2022-02-20 19:59:58,896 INFO L87 Difference]: Start difference. First operand 759 states. Second operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) [2022-02-20 19:59:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,923 INFO L93 Difference]: Finished difference Result 759 states and 1109 transitions. [2022-02-20 19:59:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1109 transitions. [2022-02-20 19:59:58,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:58,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:58,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) Second operand 759 states. [2022-02-20 19:59:58,928 INFO L87 Difference]: Start difference. First operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) Second operand 759 states. [2022-02-20 19:59:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,954 INFO L93 Difference]: Finished difference Result 759 states and 1109 transitions. [2022-02-20 19:59:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1109 transitions. [2022-02-20 19:59:58,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:58,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:58,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:58,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 631 states have (on average 1.4754358161648178) internal successors, (931), 646 states have internal predecessors, (931), 73 states have call successors, (73), 35 states have call predecessors, (73), 44 states have return successors, (95), 73 states have call predecessors, (95), 70 states have call successors, (95) [2022-02-20 19:59:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1099 transitions. [2022-02-20 19:59:58,987 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1099 transitions. Word has length 59 [2022-02-20 19:59:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:58,987 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1099 transitions. [2022-02-20 19:59:58,988 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:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1099 transitions. [2022-02-20 19:59:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:58,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:58,989 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:59,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 19:59:59,197 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:59,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash 304731983, now seen corresponding path program 1 times [2022-02-20 19:59:59,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:59,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847648623] [2022-02-20 19:59:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:59,204 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:59,205 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:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:59,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {7743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {7743#true} is VALID [2022-02-20 19:59:59,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {7743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1; {7743#true} is VALID [2022-02-20 19:59:59,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {7743#true} assume 0bv32 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {7743#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; {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {7743#true} call update_channels1(); {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {7743#true} assume !(1bv32 == ~q_req_up~0); {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {7743#true} assume true; {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7743#true} {7743#true} #1773#return; {7743#true} is VALID [2022-02-20 19:59:59,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {7743#true} assume { :begin_inline_init_threads1 } true; {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {7743#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {7743#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {7743#true} assume { :end_inline_init_threads1 } true; {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L272 TraceCheckUtils]: 12: Hoare triple {7743#true} call fire_delta_events1(); {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {7743#true} assume !(0bv32 == ~q_read_ev~0); {7743#true} is VALID [2022-02-20 19:59:59,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {7743#true} assume !(0bv32 == ~q_write_ev~0); {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {7743#true} assume true; {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7743#true} {7743#true} #1775#return; {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {7743#true} call activate_threads1(); {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {7743#true} havoc ~tmp~1;havoc ~tmp___0~1; {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {7743#true} call #t~ret8 := is_do_write_p_triggered(); {7743#true} is VALID [2022-02-20 19:59:59,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {7743#true} havoc ~__retres1~0; {7743#true} is VALID [2022-02-20 19:59:59,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {7743#true} assume !(1bv32 == ~p_dw_pc~0); {7743#true} is VALID [2022-02-20 19:59:59,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {7743#true} ~__retres1~0 := 0bv32; {7814#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:59,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {7814#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {7818#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:59,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {7818#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {7818#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:59,408 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7818#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {7743#true} #1769#return; {7825#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:59,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {7825#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {7829#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:59,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {7829#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {7744#false} is VALID [2022-02-20 19:59:59,409 INFO L272 TraceCheckUtils]: 28: Hoare triple {7744#false} call #t~ret9 := is_do_read_c_triggered(); {7744#false} is VALID [2022-02-20 19:59:59,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {7744#false} havoc ~__retres1~1; {7744#false} is VALID [2022-02-20 19:59:59,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {7744#false} assume !(1bv32 == ~c_dr_pc~0); {7744#false} is VALID [2022-02-20 19:59:59,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {7744#false} ~__retres1~1 := 0bv32; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {7744#false} #res := ~__retres1~1; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {7744#false} assume true; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7744#false} {7744#false} #1771#return; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {7744#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {7744#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {7744#false} assume true; {7744#false} is VALID [2022-02-20 19:59:59,410 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7744#false} {7743#true} #1777#return; {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L272 TraceCheckUtils]: 39: Hoare triple {7744#false} call reset_delta_events1(); {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {7744#false} assume !(1bv32 == ~q_read_ev~0); {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {7744#false} assume !(1bv32 == ~q_write_ev~0); {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {7744#false} assume true; {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7744#false} {7744#false} #1779#return; {7744#false} is VALID [2022-02-20 19:59:59,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {7744#false} assume !false; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {7744#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; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {7744#false} assume !false; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L272 TraceCheckUtils]: 47: Hoare triple {7744#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {7744#false} havoc ~__retres1~2; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {7744#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {7744#false} #res := ~__retres1~2; {7744#false} is VALID [2022-02-20 19:59:59,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {7744#false} assume true; {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7744#false} {7744#false} #1781#return; {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {7744#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {7744#false} assume 0bv32 != eval1_~tmp___1~0#1; {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {7744#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {7744#false} assume !(0bv32 != eval1_~tmp~2#1); {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L272 TraceCheckUtils]: 57: Hoare triple {7744#false} call error1(); {7744#false} is VALID [2022-02-20 19:59:59,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {7744#false} assume !false; {7744#false} is VALID [2022-02-20 19:59:59,414 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:59,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:59,414 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:59,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847648623] [2022-02-20 19:59:59,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847648623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:59,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:59,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:59,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867336437] [2022-02-20 19:59:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:59,416 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:59,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:59,416 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:59,464 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:59,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:59,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:59,466 INFO L87 Difference]: Start difference. First operand 750 states and 1099 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 20:00:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,906 INFO L93 Difference]: Finished difference Result 1141 states and 1632 transitions. [2022-02-20 20:00:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:00,907 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 20:00:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:00,907 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 20:00:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2022-02-20 20:00:00,912 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 20:00:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2022-02-20 20:00:00,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 821 transitions. [2022-02-20 20:00:01,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,481 INFO L225 Difference]: With dead ends: 1141 [2022-02-20 20:00:01,481 INFO L226 Difference]: Without dead ends: 770 [2022-02-20 20:00:01,482 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 20:00:01,483 INFO L933 BasicCegarLoop]: 685 mSDtfsCounter, 7 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3419 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 20:00:01,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3419 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 20:00:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-02-20 20:00:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 760. [2022-02-20 20:00:01,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:01,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-20 20:00:01,504 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-20 20:00:01,505 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-20 20:00:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,533 INFO L93 Difference]: Finished difference Result 770 states and 1123 transitions. [2022-02-20 20:00:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1123 transitions. [2022-02-20 20:00:01,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) Second operand 770 states. [2022-02-20 20:00:01,538 INFO L87 Difference]: Start difference. First operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) Second operand 770 states. [2022-02-20 20:00:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,566 INFO L93 Difference]: Finished difference Result 770 states and 1123 transitions. [2022-02-20 20:00:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1123 transitions. [2022-02-20 20:00:01,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:01,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 639 states have (on average 1.4663536776212833) internal successors, (937), 654 states have internal predecessors, (937), 73 states have call successors, (73), 35 states have call predecessors, (73), 46 states have return successors, (97), 75 states have call predecessors, (97), 70 states have call successors, (97) [2022-02-20 20:00:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1107 transitions. [2022-02-20 20:00:01,600 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1107 transitions. Word has length 59 [2022-02-20 20:00:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:01,600 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1107 transitions. [2022-02-20 20:00:01,600 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 20:00:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1107 transitions. [2022-02-20 20:00:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:01,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:01,602 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 20:00:01,624 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 20:00:01,812 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 20:00:01,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 579491597, now seen corresponding path program 1 times [2022-02-20 20:00:01,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:01,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988276651] [2022-02-20 20:00:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:01,815 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 20:00:01,817 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 20:00:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 20:00:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:02,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {12001#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {12001#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1; {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {12001#true} assume 0bv32 != main_#t~nondet48#1;havoc main_#t~nondet48#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; {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {12001#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; {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {12001#true} call update_channels1(); {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {12001#true} assume !(1bv32 == ~q_req_up~0); {12001#true} is VALID [2022-02-20 20:00:02,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {12001#true} assume true; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12001#true} {12001#true} #1773#return; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {12001#true} assume { :begin_inline_init_threads1 } true; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {12001#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {12001#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {12001#true} assume { :end_inline_init_threads1 } true; {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L272 TraceCheckUtils]: 12: Hoare triple {12001#true} call fire_delta_events1(); {12001#true} is VALID [2022-02-20 20:00:02,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {12001#true} assume !(0bv32 == ~q_read_ev~0); {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {12001#true} assume !(0bv32 == ~q_write_ev~0); {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {12001#true} assume true; {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12001#true} {12001#true} #1775#return; {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L272 TraceCheckUtils]: 17: Hoare triple {12001#true} call activate_threads1(); {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {12001#true} havoc ~tmp~1;havoc ~tmp___0~1; {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {12001#true} call #t~ret8 := is_do_write_p_triggered(); {12001#true} is VALID [2022-02-20 20:00:02,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {12001#true} havoc ~__retres1~0; {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {12001#true} assume !(1bv32 == ~p_dw_pc~0); {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {12001#true} ~__retres1~0 := 0bv32; {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {12001#true} #res := ~__retres1~0; {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {12001#true} assume true; {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12001#true} {12001#true} #1769#return; {12001#true} is VALID [2022-02-20 20:00:02,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {12001#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {12001#true} is VALID [2022-02-20 20:00:02,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {12001#true} assume !(0bv32 != ~tmp~1); {12001#true} is VALID [2022-02-20 20:00:02,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {12001#true} call #t~ret9 := is_do_read_c_triggered(); {12001#true} is VALID [2022-02-20 20:00:02,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {12001#true} havoc ~__retres1~1; {12001#true} is VALID [2022-02-20 20:00:02,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {12001#true} assume !(1bv32 == ~c_dr_pc~0); {12001#true} is VALID [2022-02-20 20:00:02,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#true} ~__retres1~1 := 0bv32; {12099#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 20:00:02,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {12099#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {12103#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:02,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {12103#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {12103#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:02,050 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12103#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {12001#true} #1771#return; {12110#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 20:00:02,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {12110#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {12114#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 20:00:02,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {12114#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {12002#false} is VALID [2022-02-20 20:00:02,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {12002#false} assume true; {12002#false} is VALID [2022-02-20 20:00:02,051 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12002#false} {12001#true} #1777#return; {12002#false} is VALID [2022-02-20 20:00:02,051 INFO L272 TraceCheckUtils]: 39: Hoare triple {12002#false} call reset_delta_events1(); {12002#false} is VALID [2022-02-20 20:00:02,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {12002#false} assume !(1bv32 == ~q_read_ev~0); {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {12002#false} assume !(1bv32 == ~q_write_ev~0); {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {12002#false} assume true; {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12002#false} {12002#false} #1779#return; {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {12002#false} assume !false; {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {12002#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; {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {12002#false} assume !false; {12002#false} is VALID [2022-02-20 20:00:02,052 INFO L272 TraceCheckUtils]: 47: Hoare triple {12002#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {12002#false} havoc ~__retres1~2; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {12002#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {12002#false} #res := ~__retres1~2; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {12002#false} assume true; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12002#false} {12002#false} #1781#return; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {12002#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {12002#false} is VALID [2022-02-20 20:00:02,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {12002#false} assume 0bv32 != eval1_~tmp___1~0#1; {12002#false} is VALID [2022-02-20 20:00:02,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {12002#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {12002#false} is VALID [2022-02-20 20:00:02,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {12002#false} assume !(0bv32 != eval1_~tmp~2#1); {12002#false} is VALID [2022-02-20 20:00:02,054 INFO L272 TraceCheckUtils]: 57: Hoare triple {12002#false} call error1(); {12002#false} is VALID [2022-02-20 20:00:02,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {12002#false} assume !false; {12002#false} is VALID [2022-02-20 20:00:02,054 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 20:00:02,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:02,055 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:02,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988276651] [2022-02-20 20:00:02,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988276651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:02,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:02,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:02,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620799394] [2022-02-20 20:00:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:02,056 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 20:00:02,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:02,056 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 20:00:02,092 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 20:00:02,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:02,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:02,094 INFO L87 Difference]: Start difference. First operand 760 states and 1107 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 20:00:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,516 INFO L93 Difference]: Finished difference Result 1155 states and 1638 transitions. [2022-02-20 20:00:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:03,517 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 20:00:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:03,517 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 20:00:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2022-02-20 20:00:03,522 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 20:00:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2022-02-20 20:00:03,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 816 transitions. [2022-02-20 20:00:04,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 816 edges. 816 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:04,047 INFO L225 Difference]: With dead ends: 1155 [2022-02-20 20:00:04,047 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 20:00:04,050 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 20:00:04,052 INFO L933 BasicCegarLoop]: 685 mSDtfsCounter, 4 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3420 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 20:00:04,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3420 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 20:00:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 20:00:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 770. [2022-02-20 20:00:04,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:04,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) [2022-02-20 20:00:04,079 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) [2022-02-20 20:00:04,081 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) [2022-02-20 20:00:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,106 INFO L93 Difference]: Finished difference Result 774 states and 1121 transitions. [2022-02-20 20:00:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1121 transitions. [2022-02-20 20:00:04,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) Second operand 774 states. [2022-02-20 20:00:04,113 INFO L87 Difference]: Start difference. First operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) Second operand 774 states. [2022-02-20 20:00:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,140 INFO L93 Difference]: Finished difference Result 774 states and 1121 transitions. [2022-02-20 20:00:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1121 transitions. [2022-02-20 20:00:04,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:04,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 647 states have (on average 1.4574961360123648) internal successors, (943), 662 states have internal predecessors, (943), 73 states have call successors, (73), 35 states have call predecessors, (73), 48 states have return successors, (99), 77 states have call predecessors, (99), 70 states have call successors, (99) [2022-02-20 20:00:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1115 transitions. [2022-02-20 20:00:04,181 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1115 transitions. Word has length 59 [2022-02-20 20:00:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:04,181 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1115 transitions. [2022-02-20 20:00:04,181 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 20:00:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1115 transitions. [2022-02-20 20:00:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:04,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:04,183 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 20:00:04,203 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 20:00:04,391 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 20:00:04,391 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1225946737, now seen corresponding path program 1 times [2022-02-20 20:00:04,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:04,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514599280] [2022-02-20 20:00:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:04,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:04,395 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 20:00:04,397 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 20:00:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:00:04,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:00:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:00:04,631 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 20:00:04,632 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:00:04,632 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:00:04,633 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:00:04,656 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 20:00:04,841 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 20:00:04,846 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 20:00:04,848 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:00:04,904 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 20:00:04,905 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 20:00:04,919 INFO L158 Benchmark]: Toolchain (without parser) took 14990.36ms. Allocated memory was 65.0MB in the beginning and 157.3MB in the end (delta: 92.3MB). Free memory was 39.3MB in the beginning and 69.0MB in the end (delta: -29.7MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,920 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:00:04,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.15ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 45.8MB in the end (delta: -6.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.16ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 40.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,921 INFO L158 Benchmark]: Boogie Preprocessor took 61.20ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 35.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,921 INFO L158 Benchmark]: RCFGBuilder took 1033.01ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 37.3MB in the end (delta: -2.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,921 INFO L158 Benchmark]: TraceAbstraction took 13303.66ms. Allocated memory was 79.7MB in the beginning and 157.3MB in the end (delta: 77.6MB). Free memory was 36.5MB in the beginning and 69.0MB in the end (delta: -32.5MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-02-20 20:00:04,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.15ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 45.8MB in the end (delta: -6.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.16ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 40.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.20ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 35.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1033.01ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 37.3MB in the end (delta: -2.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13303.66ms. Allocated memory was 79.7MB in the beginning and 157.3MB in the end (delta: 77.6MB). Free memory was 36.5MB in the beginning and 69.0MB in the end (delta: -32.5MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 20:00:04,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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