./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.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.06.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 e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:50,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:50,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:51,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:51,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:51,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:51,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:51,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:51,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:51,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:51,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:51,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:51,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:51,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:51,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:51,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:51,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:51,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:51,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:51,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:51,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:51,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:51,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:51,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:51,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:51,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:51,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:51,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:51,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:51,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:51,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:51,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:51,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:51,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:51,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:51,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:51,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:51,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:51,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:51,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:51,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:51,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:58:51,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:51,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:51,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:51,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:51,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:51,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:51,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:51,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:51,090 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:51,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:51,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:51,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:51,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:51,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:51,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:51,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:51,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:51,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:51,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:51,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:51,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:51,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:51,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:51,094 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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2022-02-20 19:58:51,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:51,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:51,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:51,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:51,310 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:51,311 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.06.cil-2.c [2022-02-20 19:58:51,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf2bb222/9f7f15862856471fb1d9cc807a54b4be/FLAGc8c4fb8f9 [2022-02-20 19:58:51,762 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:51,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-02-20 19:58:51,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf2bb222/9f7f15862856471fb1d9cc807a54b4be/FLAGc8c4fb8f9 [2022-02-20 19:58:51,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf2bb222/9f7f15862856471fb1d9cc807a54b4be [2022-02-20 19:58:51,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:51,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:51,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:51,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:51,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:51,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:51" (1/1) ... [2022-02-20 19:58:51,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5732937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:51, skipping insertion in model container [2022-02-20 19:58:51,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:51" (1/1) ... [2022-02-20 19:58:51,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:51,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:51,988 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.06.cil-2.c[914,927] [2022-02-20 19:58:52,025 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.06.cil-2.c[7125,7138] [2022-02-20 19:58:52,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:52,105 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:52,117 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.06.cil-2.c[914,927] [2022-02-20 19:58:52,137 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.06.cil-2.c[7125,7138] [2022-02-20 19:58:52,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:52,183 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:52,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52 WrapperNode [2022-02-20 19:58:52,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:52,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:52,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:52,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:52,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,250 INFO L137 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 693 [2022-02-20 19:58:52,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:52,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:52,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:52,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:52,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:52,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:52,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:52,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:52,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (1/1) ... [2022-02-20 19:58:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:52,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:58:52,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:58:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:52,357 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:52,357 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:52,452 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:52,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:53,017 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:53,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:53,034 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-02-20 19:58:53,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:53 BoogieIcfgContainer [2022-02-20 19:58:53,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:53,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:53,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:53,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:51" (1/3) ... [2022-02-20 19:58:53,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6927b780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:53, skipping insertion in model container [2022-02-20 19:58:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:52" (2/3) ... [2022-02-20 19:58:53,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6927b780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:53, skipping insertion in model container [2022-02-20 19:58:53,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:53" (3/3) ... [2022-02-20 19:58:53,042 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-02-20 19:58:53,045 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:53,045 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:53,090 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:53,095 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:58:53,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 19:58:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:53,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:53,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:53,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1975408481, now seen corresponding path program 1 times [2022-02-20 19:58:53,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:53,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121681978] [2022-02-20 19:58:53,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(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); {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {339#(= ~q_read_ev~0 2)} #1213#return; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(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; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {380#(= |old(~q_read_ev~0)| 0)} assume true; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {380#(= |old(~q_read_ev~0)| 0)} {339#(= ~q_read_ev~0 2)} #1215#return; {338#false} is VALID [2022-02-20 19:58:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} havoc ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !(1 == ~p_dw_pc~0); {337#true} is VALID [2022-02-20 19:58:53,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} ~__retres1~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} #res := ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,429 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {337#true} {337#true} #1209#return; {337#true} is VALID [2022-02-20 19:58:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} havoc ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume 1 == ~c_dr_pc~0; {337#true} is VALID [2022-02-20 19:58:53,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {337#true} is VALID [2022-02-20 19:58:53,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} #res := ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,434 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {337#true} {337#true} #1211#return; {337#true} is VALID [2022-02-20 19:58:53,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#(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; {337#true} is VALID [2022-02-20 19:58:53,434 INFO L272 TraceCheckUtils]: 1: Hoare triple {337#true} call #t~ret8 := is_do_write_p_triggered(); {337#true} is VALID [2022-02-20 19:58:53,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} havoc ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} assume !(1 == ~p_dw_pc~0); {337#true} is VALID [2022-02-20 19:58:53,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {337#true} ~__retres1~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#true} #res := ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,435 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {337#true} {337#true} #1209#return; {337#true} is VALID [2022-02-20 19:58:53,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {337#true} is VALID [2022-02-20 19:58:53,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#true} assume !(0 != ~tmp~1); {337#true} is VALID [2022-02-20 19:58:53,436 INFO L272 TraceCheckUtils]: 10: Hoare triple {337#true} call #t~ret9 := is_do_read_c_triggered(); {337#true} is VALID [2022-02-20 19:58:53,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#true} havoc ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#true} assume 1 == ~c_dr_pc~0; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#true} #res := ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {337#true} {337#true} #1211#return; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {337#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {337#true} is VALID [2022-02-20 19:58:53,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {337#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,438 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {337#true} {338#false} #1217#return; {338#false} is VALID [2022-02-20 19:58:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(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; {337#true} is VALID [2022-02-20 19:58:53,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {337#true} is VALID [2022-02-20 19:58:53,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#true} {338#false} #1219#return; {338#false} is VALID [2022-02-20 19:58:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} havoc ~__retres1~2; {337#true} is VALID [2022-02-20 19:58:53,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {337#true} is VALID [2022-02-20 19:58:53,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} #res := ~__retres1~2; {337#true} is VALID [2022-02-20 19:58:53,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,449 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {337#true} {338#false} #1221#return; {338#false} is VALID [2022-02-20 19:58:53,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {337#true} is VALID [2022-02-20 19:58:53,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(= ~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; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#(= ~q_read_ev~0 2)} call update_channels1(); {377#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:53,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(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); {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:53,456 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {378#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {339#(= ~q_read_ev~0 2)} #1213#return; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {339#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {339#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:53,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {339#(= ~q_read_ev~0 2)} call fire_delta_events1(); {379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:53,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(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; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {380#(= |old(~q_read_ev~0)| 0)} assume true; {380#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:53,461 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {380#(= |old(~q_read_ev~0)| 0)} {339#(= ~q_read_ev~0 2)} #1215#return; {338#false} is VALID [2022-02-20 19:58:53,461 INFO L272 TraceCheckUtils]: 17: Hoare triple {338#false} call activate_threads1(); {381#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:53,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {381#(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; {337#true} is VALID [2022-02-20 19:58:53,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {337#true} call #t~ret8 := is_do_write_p_triggered(); {337#true} is VALID [2022-02-20 19:58:53,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#true} havoc ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {337#true} assume !(1 == ~p_dw_pc~0); {337#true} is VALID [2022-02-20 19:58:53,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {337#true} ~__retres1~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {337#true} #res := ~__retres1~0; {337#true} is VALID [2022-02-20 19:58:53,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,463 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {337#true} {337#true} #1209#return; {337#true} is VALID [2022-02-20 19:58:53,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {337#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {337#true} is VALID [2022-02-20 19:58:53,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {337#true} assume !(0 != ~tmp~1); {337#true} is VALID [2022-02-20 19:58:53,463 INFO L272 TraceCheckUtils]: 28: Hoare triple {337#true} call #t~ret9 := is_do_read_c_triggered(); {337#true} is VALID [2022-02-20 19:58:53,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {337#true} havoc ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {337#true} assume 1 == ~c_dr_pc~0; {337#true} is VALID [2022-02-20 19:58:53,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {337#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {337#true} is VALID [2022-02-20 19:58:53,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {337#true} #res := ~__retres1~1; {337#true} is VALID [2022-02-20 19:58:53,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,465 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {337#true} {337#true} #1211#return; {337#true} is VALID [2022-02-20 19:58:53,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {337#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {337#true} is VALID [2022-02-20 19:58:53,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {337#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {337#true} is VALID [2022-02-20 19:58:53,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,465 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {337#true} {338#false} #1217#return; {338#false} is VALID [2022-02-20 19:58:53,465 INFO L272 TraceCheckUtils]: 39: Hoare triple {338#false} call reset_delta_events1(); {379#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:53,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {379#(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; {337#true} is VALID [2022-02-20 19:58:53,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {337#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {337#true} is VALID [2022-02-20 19:58:53,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,466 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {337#true} {338#false} #1219#return; {338#false} is VALID [2022-02-20 19:58:53,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:58:53,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {338#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; {338#false} is VALID [2022-02-20 19:58:53,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:58:53,467 INFO L272 TraceCheckUtils]: 47: Hoare triple {338#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {337#true} is VALID [2022-02-20 19:58:53,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {337#true} havoc ~__retres1~2; {337#true} is VALID [2022-02-20 19:58:53,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {337#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {337#true} is VALID [2022-02-20 19:58:53,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {337#true} #res := ~__retres1~2; {337#true} is VALID [2022-02-20 19:58:53,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 19:58:53,469 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {337#true} {338#false} #1221#return; {338#false} is VALID [2022-02-20 19:58:53,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {338#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; {338#false} is VALID [2022-02-20 19:58:53,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {338#false} assume 0 != eval1_~tmp___1~0#1; {338#false} is VALID [2022-02-20 19:58:53,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {338#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; {338#false} is VALID [2022-02-20 19:58:53,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {338#false} assume !(0 != eval1_~tmp~2#1); {338#false} is VALID [2022-02-20 19:58:53,470 INFO L272 TraceCheckUtils]: 57: Hoare triple {338#false} call error1(); {338#false} is VALID [2022-02-20 19:58:53,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:58:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:53,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:53,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121681978] [2022-02-20 19:58:53,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121681978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:53,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:53,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:53,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570898590] [2022-02-20 19:58:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:53,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:53,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:53,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:53,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:53,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:53,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:53,539 INFO L87 Difference]: Start difference. First operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,815 INFO L93 Difference]: Finished difference Result 782 states and 1218 transitions. [2022-02-20 19:58:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1218 transitions. [2022-02-20 19:58:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1218 transitions. [2022-02-20 19:58:55,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1218 transitions. [2022-02-20 19:58:56,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1218 edges. 1218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:56,676 INFO L225 Difference]: With dead ends: 782 [2022-02-20 19:58:56,676 INFO L226 Difference]: Without dead ends: 460 [2022-02-20 19:58:56,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:56,696 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 837 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:56,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [842 Valid, 1409 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-02-20 19:58:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2022-02-20 19:58:56,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:56,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 460 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:58:56,775 INFO L74 IsIncluded]: Start isIncluded. First operand 460 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:58:56,777 INFO L87 Difference]: Start difference. First operand 460 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:58:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,795 INFO L93 Difference]: Finished difference Result 460 states and 669 transitions. [2022-02-20 19:58:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 669 transitions. [2022-02-20 19:58:56,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 460 states. [2022-02-20 19:58:56,806 INFO L87 Difference]: Start difference. First operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 460 states. [2022-02-20 19:58:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,822 INFO L93 Difference]: Finished difference Result 460 states and 669 transitions. [2022-02-20 19:58:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 669 transitions. [2022-02-20 19:58:56,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:56,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:58:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 614 transitions. [2022-02-20 19:58:56,854 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 614 transitions. Word has length 59 [2022-02-20 19:58:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,856 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 614 transitions. [2022-02-20 19:58:56,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 614 transitions. [2022-02-20 19:58:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:56,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:56,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:56,861 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2080229855, now seen corresponding path program 1 times [2022-02-20 19:58:56,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395983344] [2022-02-20 19:58:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {2991#(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); {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:56,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:56,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2953#(= ~q_write_ev~0 ~q_read_ev~0)} #1213#return; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {2992#(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); {2993#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#(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; {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2953#(= ~q_write_ev~0 ~q_read_ev~0)} #1215#return; {2952#false} is VALID [2022-02-20 19:58:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#true} havoc ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume !(1 == ~p_dw_pc~0); {2951#true} is VALID [2022-02-20 19:58:56,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} ~__retres1~0 := 0; {2951#true} is VALID [2022-02-20 19:58:56,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#true} #res := ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:56,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:56,991 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2951#true} {2951#true} #1209#return; {2951#true} is VALID [2022-02-20 19:58:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#true} havoc ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:56,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume 1 == ~c_dr_pc~0; {2951#true} is VALID [2022-02-20 19:58:56,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2951#true} is VALID [2022-02-20 19:58:56,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#true} #res := ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:56,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2951#true} {2951#true} #1211#return; {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {2995#(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; {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L272 TraceCheckUtils]: 1: Hoare triple {2951#true} call #t~ret8 := is_do_write_p_triggered(); {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} havoc ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#true} assume !(1 == ~p_dw_pc~0); {2951#true} is VALID [2022-02-20 19:58:56,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {2951#true} ~__retres1~0 := 0; {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {2951#true} #res := ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2951#true} {2951#true} #1209#return; {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {2951#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {2951#true} assume !(0 != ~tmp~1); {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L272 TraceCheckUtils]: 10: Hoare triple {2951#true} call #t~ret9 := is_do_read_c_triggered(); {2951#true} is VALID [2022-02-20 19:58:56,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {2951#true} havoc ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {2951#true} assume 1 == ~c_dr_pc~0; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {2951#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {2951#true} #res := ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2951#true} {2951#true} #1211#return; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {2951#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2951#true} is VALID [2022-02-20 19:58:56,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {2951#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2951#true} is VALID [2022-02-20 19:58:56,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:56,999 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2951#true} {2952#false} #1217#return; {2952#false} is VALID [2022-02-20 19:58:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {2992#(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); {2951#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2951#true} is VALID [2022-02-20 19:58:57,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2951#true} {2952#false} #1219#return; {2952#false} is VALID [2022-02-20 19:58:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:57,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#true} havoc ~__retres1~2; {2951#true} is VALID [2022-02-20 19:58:57,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2951#true} is VALID [2022-02-20 19:58:57,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} #res := ~__retres1~2; {2951#true} is VALID [2022-02-20 19:58:57,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,009 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2951#true} {2952#false} #1221#return; {2952#false} is VALID [2022-02-20 19:58:57,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {2951#true} is VALID [2022-02-20 19:58:57,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {2951#true} is VALID [2022-02-20 19:58:57,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {2953#(= ~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; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2991#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:57,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#(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); {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,012 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2953#(= ~q_write_ev~0 ~q_read_ev~0)} #1213#return; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2953#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:57,014 INFO L272 TraceCheckUtils]: 12: Hoare triple {2953#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(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); {2993#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {2993#(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; {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:57,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2994#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2953#(= ~q_write_ev~0 ~q_read_ev~0)} #1215#return; {2952#false} is VALID [2022-02-20 19:58:57,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {2952#false} call activate_threads1(); {2995#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {2995#(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; {2951#true} is VALID [2022-02-20 19:58:57,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {2951#true} call #t~ret8 := is_do_write_p_triggered(); {2951#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {2951#true} havoc ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {2951#true} assume !(1 == ~p_dw_pc~0); {2951#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {2951#true} ~__retres1~0 := 0; {2951#true} is VALID [2022-02-20 19:58:57,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {2951#true} #res := ~__retres1~0; {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2951#true} {2951#true} #1209#return; {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {2951#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {2951#true} assume !(0 != ~tmp~1); {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L272 TraceCheckUtils]: 28: Hoare triple {2951#true} call #t~ret9 := is_do_read_c_triggered(); {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {2951#true} havoc ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:57,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {2951#true} assume 1 == ~c_dr_pc~0; {2951#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {2951#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2951#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#true} #res := ~__retres1~1; {2951#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2951#true} {2951#true} #1211#return; {2951#true} is VALID [2022-02-20 19:58:57,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {2951#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2951#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {2951#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2951#true} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,019 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2951#true} {2952#false} #1217#return; {2952#false} is VALID [2022-02-20 19:58:57,019 INFO L272 TraceCheckUtils]: 39: Hoare triple {2952#false} call reset_delta_events1(); {2992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:57,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(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); {2951#true} is VALID [2022-02-20 19:58:57,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2951#true} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,022 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2951#true} {2952#false} #1219#return; {2952#false} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {2952#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; {2952#false} is VALID [2022-02-20 19:58:57,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:58:57,023 INFO L272 TraceCheckUtils]: 47: Hoare triple {2952#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2951#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {2951#true} havoc ~__retres1~2; {2951#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {2951#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2951#true} is VALID [2022-02-20 19:58:57,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {2951#true} #res := ~__retres1~2; {2951#true} is VALID [2022-02-20 19:58:57,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {2951#true} assume true; {2951#true} is VALID [2022-02-20 19:58:57,025 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2951#true} {2952#false} #1221#return; {2952#false} is VALID [2022-02-20 19:58:57,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#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; {2952#false} is VALID [2022-02-20 19:58:57,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {2952#false} assume 0 != eval1_~tmp___1~0#1; {2952#false} is VALID [2022-02-20 19:58:57,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {2952#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; {2952#false} is VALID [2022-02-20 19:58:57,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {2952#false} assume !(0 != eval1_~tmp~2#1); {2952#false} is VALID [2022-02-20 19:58:57,026 INFO L272 TraceCheckUtils]: 57: Hoare triple {2952#false} call error1(); {2952#false} is VALID [2022-02-20 19:58:57,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:58:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:57,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:57,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395983344] [2022-02-20 19:58:57,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395983344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:57,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:57,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:57,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129075023] [2022-02-20 19:58:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:57,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:57,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:57,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:57,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:57,062 INFO L87 Difference]: Start difference. First operand 420 states and 614 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:59,775 INFO L93 Difference]: Finished difference Result 769 states and 1093 transitions. [2022-02-20 19:58:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 822 transitions. [2022-02-20 19:58:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 822 transitions. [2022-02-20 19:58:59,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 822 transitions. [2022-02-20 19:59:00,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:00,362 INFO L225 Difference]: With dead ends: 769 [2022-02-20 19:59:00,362 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 19:59:00,363 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:00,364 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 1168 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:00,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 1624 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 19:59:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 516. [2022-02-20 19:59:00,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:00,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:59:00,384 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:59:00,385 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:59:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,402 INFO L93 Difference]: Finished difference Result 591 states and 852 transitions. [2022-02-20 19:59:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 852 transitions. [2022-02-20 19:59:00,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 591 states. [2022-02-20 19:59:00,405 INFO L87 Difference]: Start difference. First operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) Second operand 591 states. [2022-02-20 19:59:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,421 INFO L93 Difference]: Finished difference Result 591 states and 852 transitions. [2022-02-20 19:59:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 852 transitions. [2022-02-20 19:59:00,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:00,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-02-20 19:59:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 748 transitions. [2022-02-20 19:59:00,439 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 748 transitions. Word has length 59 [2022-02-20 19:59:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:00,439 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 748 transitions. [2022-02-20 19:59:00,439 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:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 748 transitions. [2022-02-20 19:59:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:00,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:00,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:00,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:00,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1186743517, now seen corresponding path program 1 times [2022-02-20 19:59:00,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:00,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499713986] [2022-02-20 19:59:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {5990#(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); {5991#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:00,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {5991#(not (= |old(~q_req_up~0)| 1))} assume true; {5991#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:00,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5991#(not (= |old(~q_req_up~0)| 1))} {5951#(= ~c_dr_pc~0 ~q_req_up~0)} #1213#return; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {5992#(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); {5948#true} is VALID [2022-02-20 19:59:00,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume !(0 == ~q_write_ev~0); {5948#true} is VALID [2022-02-20 19:59:00,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5955#(not (= ~c_dr_pc~0 1))} #1215#return; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {5948#true} havoc ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume !(1 == ~p_dw_pc~0); {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} ~__retres1~0 := 0; {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {5948#true} #res := ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5948#true} {5948#true} #1209#return; {5948#true} is VALID [2022-02-20 19:59:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {5948#true} havoc ~__retres1~1; {5948#true} is VALID [2022-02-20 19:59:00,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume 1 == ~c_dr_pc~0; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,553 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} {5948#true} #1211#return; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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; {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L272 TraceCheckUtils]: 1: Hoare triple {5948#true} call #t~ret8 := is_do_write_p_triggered(); {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} havoc ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {5948#true} assume !(1 == ~p_dw_pc~0); {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {5948#true} ~__retres1~0 := 0; {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} #res := ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,558 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5948#true} {5948#true} #1209#return; {5948#true} is VALID [2022-02-20 19:59:00,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {5948#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5948#true} is VALID [2022-02-20 19:59:00,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {5948#true} assume !(0 != ~tmp~1); {5948#true} is VALID [2022-02-20 19:59:00,559 INFO L272 TraceCheckUtils]: 10: Hoare triple {5948#true} call #t~ret9 := is_do_read_c_triggered(); {5948#true} is VALID [2022-02-20 19:59:00,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#true} havoc ~__retres1~1; {5948#true} is VALID [2022-02-20 19:59:00,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#true} assume 1 == ~c_dr_pc~0; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,564 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} {5948#true} #1211#return; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,568 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} {5955#(not (= ~c_dr_pc~0 1))} #1217#return; {5949#false} is VALID [2022-02-20 19:59:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {5992#(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); {5948#true} is VALID [2022-02-20 19:59:00,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5948#true} is VALID [2022-02-20 19:59:00,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5949#false} #1219#return; {5949#false} is VALID [2022-02-20 19:59:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {5948#true} havoc ~__retres1~2; {5948#true} is VALID [2022-02-20 19:59:00,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5948#true} is VALID [2022-02-20 19:59:00,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} #res := ~__retres1~2; {5948#true} is VALID [2022-02-20 19:59:00,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,582 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5948#true} {5949#false} #1221#return; {5949#false} is VALID [2022-02-20 19:59:00,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {5948#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {5950#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:00,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {5950#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {5950#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:00,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {5950#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {5951#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:00,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {5951#(= ~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; {5951#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:00,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {5951#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {5990#(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:00,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {5990#(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); {5991#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:00,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {5991#(not (= |old(~q_req_up~0)| 1))} assume true; {5991#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:00,585 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5991#(not (= |old(~q_req_up~0)| 1))} {5951#(= ~c_dr_pc~0 ~q_req_up~0)} #1213#return; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,586 INFO L272 TraceCheckUtils]: 12: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {5992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:00,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {5992#(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); {5948#true} is VALID [2022-02-20 19:59:00,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {5948#true} assume !(0 == ~q_write_ev~0); {5948#true} is VALID [2022-02-20 19:59:00,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,587 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5948#true} {5955#(not (= ~c_dr_pc~0 1))} #1215#return; {5955#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:00,587 INFO L272 TraceCheckUtils]: 17: Hoare triple {5955#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {5993#(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:00,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {5993#(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; {5948#true} is VALID [2022-02-20 19:59:00,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {5948#true} call #t~ret8 := is_do_write_p_triggered(); {5948#true} is VALID [2022-02-20 19:59:00,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {5948#true} havoc ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {5948#true} assume !(1 == ~p_dw_pc~0); {5948#true} is VALID [2022-02-20 19:59:00,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {5948#true} ~__retres1~0 := 0; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {5948#true} #res := ~__retres1~0; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5948#true} {5948#true} #1209#return; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {5948#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {5948#true} assume !(0 != ~tmp~1); {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L272 TraceCheckUtils]: 28: Hoare triple {5948#true} call #t~ret9 := is_do_read_c_triggered(); {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {5948#true} havoc ~__retres1~1; {5948#true} is VALID [2022-02-20 19:59:00,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {5948#true} assume 1 == ~c_dr_pc~0; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,590 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} {5948#true} #1211#return; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:00,591 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6006#(= (+ (- 1) ~c_dr_pc~0) 0)} {5955#(not (= ~c_dr_pc~0 1))} #1217#return; {5949#false} is VALID [2022-02-20 19:59:00,591 INFO L272 TraceCheckUtils]: 39: Hoare triple {5949#false} call reset_delta_events1(); {5992#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:00,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {5992#(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); {5948#true} is VALID [2022-02-20 19:59:00,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {5948#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5948#true} is VALID [2022-02-20 19:59:00,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,591 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5948#true} {5949#false} #1219#return; {5949#false} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {5949#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; {5949#false} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-02-20 19:59:00,592 INFO L272 TraceCheckUtils]: 47: Hoare triple {5949#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5948#true} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {5948#true} havoc ~__retres1~2; {5948#true} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {5948#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5948#true} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {5948#true} #res := ~__retres1~2; {5948#true} is VALID [2022-02-20 19:59:00,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-02-20 19:59:00,592 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5948#true} {5949#false} #1221#return; {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {5949#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; {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {5949#false} assume 0 != eval1_~tmp___1~0#1; {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {5949#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; {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {5949#false} assume !(0 != eval1_~tmp~2#1); {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L272 TraceCheckUtils]: 57: Hoare triple {5949#false} call error1(); {5949#false} is VALID [2022-02-20 19:59:00,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-02-20 19:59:00,593 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:00,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:00,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499713986] [2022-02-20 19:59:00,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499713986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:00,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:00,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:00,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089731110] [2022-02-20 19:59:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:00,594 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:00,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:00,595 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:00,626 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:00,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:00,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:00,627 INFO L87 Difference]: Start difference. First operand 516 states and 748 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:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,480 INFO L93 Difference]: Finished difference Result 1862 states and 2604 transitions. [2022-02-20 19:59:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:05,481 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:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:05,481 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:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1173 transitions. [2022-02-20 19:59:05,490 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:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1173 transitions. [2022-02-20 19:59:05,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1173 transitions. [2022-02-20 19:59:06,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1173 edges. 1173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,510 INFO L225 Difference]: With dead ends: 1862 [2022-02-20 19:59:06,510 INFO L226 Difference]: Without dead ends: 1576 [2022-02-20 19:59:06,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:06,517 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2541 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:06,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2555 Valid, 2168 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-02-20 19:59:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1402. [2022-02-20 19:59:06,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:06,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1576 states. Second operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:59:06,575 INFO L74 IsIncluded]: Start isIncluded. First operand 1576 states. Second operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:59:06,577 INFO L87 Difference]: Start difference. First operand 1576 states. Second operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:59:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,656 INFO L93 Difference]: Finished difference Result 1576 states and 2090 transitions. [2022-02-20 19:59:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2090 transitions. [2022-02-20 19:59:06,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1576 states. [2022-02-20 19:59:06,665 INFO L87 Difference]: Start difference. First operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) Second operand 1576 states. [2022-02-20 19:59:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,748 INFO L93 Difference]: Finished difference Result 1576 states and 2090 transitions. [2022-02-20 19:59:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2090 transitions. [2022-02-20 19:59:06,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:06,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-02-20 19:59:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1882 transitions. [2022-02-20 19:59:06,831 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1882 transitions. Word has length 59 [2022-02-20 19:59:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,832 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 1882 transitions. [2022-02-20 19:59:06,832 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:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1882 transitions. [2022-02-20 19:59:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:06,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:06,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:06,833 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2136549092, now seen corresponding path program 1 times [2022-02-20 19:59:06,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:06,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021103552] [2022-02-20 19:59:06,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {13673#(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); {13634#true} is VALID [2022-02-20 19:59:06,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13634#true} {13634#true} #1213#return; {13634#true} is VALID [2022-02-20 19:59:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {13674#(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); {13634#true} is VALID [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume !(0 == ~q_write_ev~0); {13634#true} is VALID [2022-02-20 19:59:06,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13634#true} {13634#true} #1215#return; {13634#true} is VALID [2022-02-20 19:59:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {13634#true} havoc ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume !(1 == ~p_dw_pc~0); {13634#true} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} ~__retres1~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {13634#true} #res := ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,939 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13634#true} {13634#true} #1209#return; {13634#true} is VALID [2022-02-20 19:59:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {13634#true} havoc ~__retres1~1; {13634#true} is VALID [2022-02-20 19:59:06,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume !(1 == ~c_dr_pc~0); {13634#true} is VALID [2022-02-20 19:59:06,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} ~__retres1~1 := 0; {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:06,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:06,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:06,977 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13634#true} #1211#return; {13688#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:06,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {13675#(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; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L272 TraceCheckUtils]: 1: Hoare triple {13634#true} call #t~ret8 := is_do_write_p_triggered(); {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} havoc ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {13634#true} assume !(1 == ~p_dw_pc~0); {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {13634#true} ~__retres1~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {13634#true} #res := ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13634#true} {13634#true} #1209#return; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {13634#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13634#true} is VALID [2022-02-20 19:59:06,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {13634#true} assume !(0 != ~tmp~1); {13634#true} is VALID [2022-02-20 19:59:06,979 INFO L272 TraceCheckUtils]: 10: Hoare triple {13634#true} call #t~ret9 := is_do_read_c_triggered(); {13634#true} is VALID [2022-02-20 19:59:06,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {13634#true} havoc ~__retres1~1; {13634#true} is VALID [2022-02-20 19:59:06,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {13634#true} assume !(1 == ~c_dr_pc~0); {13634#true} is VALID [2022-02-20 19:59:06,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {13634#true} ~__retres1~1 := 0; {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:06,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:06,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:06,980 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13634#true} #1211#return; {13688#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:06,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {13688#(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; {13689#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:06,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {13689#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13635#false} is VALID [2022-02-20 19:59:06,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {13635#false} assume true; {13635#false} is VALID [2022-02-20 19:59:06,981 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13635#false} {13634#true} #1217#return; {13635#false} is VALID [2022-02-20 19:59:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {13674#(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); {13634#true} is VALID [2022-02-20 19:59:06,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13634#true} is VALID [2022-02-20 19:59:06,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13634#true} {13635#false} #1219#return; {13635#false} is VALID [2022-02-20 19:59:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {13634#true} havoc ~__retres1~2; {13634#true} is VALID [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13634#true} is VALID [2022-02-20 19:59:06,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} #res := ~__retres1~2; {13634#true} is VALID [2022-02-20 19:59:06,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,994 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13634#true} {13635#false} #1221#return; {13635#false} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {13634#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {13634#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {13634#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {13634#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {13634#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {13634#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; {13634#true} is VALID [2022-02-20 19:59:06,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {13634#true} call update_channels1(); {13673#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {13673#(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); {13634#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13634#true} {13634#true} #1213#return; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {13634#true} assume { :begin_inline_init_threads1 } true; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {13634#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {13634#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {13634#true} assume { :end_inline_init_threads1 } true; {13634#true} is VALID [2022-02-20 19:59:06,997 INFO L272 TraceCheckUtils]: 12: Hoare triple {13634#true} call fire_delta_events1(); {13674#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {13674#(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); {13634#true} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {13634#true} assume !(0 == ~q_write_ev~0); {13634#true} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13634#true} {13634#true} #1215#return; {13634#true} is VALID [2022-02-20 19:59:06,998 INFO L272 TraceCheckUtils]: 17: Hoare triple {13634#true} call activate_threads1(); {13675#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {13675#(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; {13634#true} is VALID [2022-02-20 19:59:06,998 INFO L272 TraceCheckUtils]: 19: Hoare triple {13634#true} call #t~ret8 := is_do_write_p_triggered(); {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {13634#true} havoc ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {13634#true} assume !(1 == ~p_dw_pc~0); {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {13634#true} ~__retres1~0 := 0; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {13634#true} #res := ~__retres1~0; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13634#true} {13634#true} #1209#return; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {13634#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {13634#true} assume !(0 != ~tmp~1); {13634#true} is VALID [2022-02-20 19:59:06,999 INFO L272 TraceCheckUtils]: 28: Hoare triple {13634#true} call #t~ret9 := is_do_read_c_triggered(); {13634#true} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {13634#true} havoc ~__retres1~1; {13634#true} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {13634#true} assume !(1 == ~c_dr_pc~0); {13634#true} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {13634#true} ~__retres1~1 := 0; {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {13690#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:07,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:07,001 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13691#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13634#true} #1211#return; {13688#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:07,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {13688#(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; {13689#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:07,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {13689#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13635#false} is VALID [2022-02-20 19:59:07,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {13635#false} assume true; {13635#false} is VALID [2022-02-20 19:59:07,002 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13635#false} {13634#true} #1217#return; {13635#false} is VALID [2022-02-20 19:59:07,002 INFO L272 TraceCheckUtils]: 39: Hoare triple {13635#false} call reset_delta_events1(); {13674#(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:07,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {13674#(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); {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {13634#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13634#true} {13635#false} #1219#return; {13635#false} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {13635#false} assume !false; {13635#false} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {13635#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; {13635#false} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {13635#false} assume !false; {13635#false} is VALID [2022-02-20 19:59:07,003 INFO L272 TraceCheckUtils]: 47: Hoare triple {13635#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {13634#true} havoc ~__retres1~2; {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {13634#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13634#true} is VALID [2022-02-20 19:59:07,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {13634#true} #res := ~__retres1~2; {13634#true} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {13634#true} assume true; {13634#true} is VALID [2022-02-20 19:59:07,004 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13634#true} {13635#false} #1221#return; {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 53: Hoare triple {13635#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; {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {13635#false} assume 0 != eval1_~tmp___1~0#1; {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {13635#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; {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {13635#false} assume !(0 != eval1_~tmp~2#1); {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L272 TraceCheckUtils]: 57: Hoare triple {13635#false} call error1(); {13635#false} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {13635#false} assume !false; {13635#false} is VALID [2022-02-20 19:59:07,005 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:07,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:07,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021103552] [2022-02-20 19:59:07,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021103552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:07,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:07,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:07,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990046913] [2022-02-20 19:59:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:07,006 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:07,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:07,007 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:07,046 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:07,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:07,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:07,047 INFO L87 Difference]: Start difference. First operand 1402 states and 1882 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:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,758 INFO L93 Difference]: Finished difference Result 2732 states and 3633 transitions. [2022-02-20 19:59:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:09,759 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:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:09,759 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:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 639 transitions. [2022-02-20 19:59:09,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:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 639 transitions. [2022-02-20 19:59:09,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 639 transitions. [2022-02-20 19:59:10,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 639 edges. 639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,292 INFO L225 Difference]: With dead ends: 2732 [2022-02-20 19:59:10,292 INFO L226 Difference]: Without dead ends: 1566 [2022-02-20 19:59:10,294 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:10,297 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 611 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:10,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 1874 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-02-20 19:59:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1432. [2022-02-20 19:59:10,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:10,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1566 states. Second operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:59:10,350 INFO L74 IsIncluded]: Start isIncluded. First operand 1566 states. Second operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:59:10,352 INFO L87 Difference]: Start difference. First operand 1566 states. Second operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:59:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,431 INFO L93 Difference]: Finished difference Result 1566 states and 2072 transitions. [2022-02-20 19:59:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2072 transitions. [2022-02-20 19:59:10,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1566 states. [2022-02-20 19:59:10,450 INFO L87 Difference]: Start difference. First operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) Second operand 1566 states. [2022-02-20 19:59:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,532 INFO L93 Difference]: Finished difference Result 1566 states and 2072 transitions. [2022-02-20 19:59:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2072 transitions. [2022-02-20 19:59:10,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-02-20 19:59:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1904 transitions. [2022-02-20 19:59:10,619 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1904 transitions. Word has length 59 [2022-02-20 19:59:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,619 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 1904 transitions. [2022-02-20 19:59:10,619 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:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1904 transitions. [2022-02-20 19:59:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:10,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:10,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 331110758, now seen corresponding path program 1 times [2022-02-20 19:59:10,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:10,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049965918] [2022-02-20 19:59:10,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {22483#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1213#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {22484#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {22484#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1215#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {22443#true} havoc ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {22443#true} assume !(1 == ~p_dw_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {22443#true} ~__retres1~0 := 0; {22443#true} is VALID [2022-02-20 19:59:10,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {22443#true} #res := ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,689 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22443#true} {22443#true} #1209#return; {22443#true} is VALID [2022-02-20 19:59:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {22443#true} havoc ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {22443#true} assume !(1 == ~c_dr_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {22443#true} ~__retres1~1 := 0; {22443#true} is VALID [2022-02-20 19:59:10,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {22443#true} #res := ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22443#true} {22443#true} #1211#return; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {22485#(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; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L272 TraceCheckUtils]: 1: Hoare triple {22443#true} call #t~ret8 := is_do_write_p_triggered(); {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {22443#true} havoc ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {22443#true} assume !(1 == ~p_dw_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {22443#true} ~__retres1~0 := 0; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {22443#true} #res := ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,696 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22443#true} {22443#true} #1209#return; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {22443#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {22443#true} assume !(0 != ~tmp~1); {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {22443#true} call #t~ret9 := is_do_read_c_triggered(); {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {22443#true} havoc ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {22443#true} assume !(1 == ~c_dr_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {22443#true} ~__retres1~1 := 0; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {22443#true} #res := ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22443#true} {22443#true} #1211#return; {22443#true} is VALID [2022-02-20 19:59:10,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {22443#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22443#true} is VALID [2022-02-20 19:59:10,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {22443#true} assume !(0 != ~tmp___0~1); {22443#true} is VALID [2022-02-20 19:59:10,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,698 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22443#true} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1217#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {22484#(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); {22498#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:10,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {22498#(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; {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1219#return; {22444#false} is VALID [2022-02-20 19:59:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {22443#true} havoc ~__retres1~2; {22443#true} is VALID [2022-02-20 19:59:10,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {22443#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22443#true} is VALID [2022-02-20 19:59:10,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {22443#true} #res := ~__retres1~2; {22443#true} is VALID [2022-02-20 19:59:10,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,718 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22443#true} {22444#false} #1221#return; {22444#false} is VALID [2022-02-20 19:59:10,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {22443#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22443#true} is VALID [2022-02-20 19:59:10,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {22443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {22443#true} is VALID [2022-02-20 19:59:10,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {22443#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {22445#(= ~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; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22483#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:10,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {22483#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,720 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1213#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,721 INFO L272 TraceCheckUtils]: 12: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {22484#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {22484#(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); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,723 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1215#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,723 INFO L272 TraceCheckUtils]: 17: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {22485#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:10,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {22485#(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; {22443#true} is VALID [2022-02-20 19:59:10,723 INFO L272 TraceCheckUtils]: 19: Hoare triple {22443#true} call #t~ret8 := is_do_write_p_triggered(); {22443#true} is VALID [2022-02-20 19:59:10,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {22443#true} havoc ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {22443#true} assume !(1 == ~p_dw_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {22443#true} ~__retres1~0 := 0; {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {22443#true} #res := ~__retres1~0; {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22443#true} {22443#true} #1209#return; {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {22443#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22443#true} is VALID [2022-02-20 19:59:10,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {22443#true} assume !(0 != ~tmp~1); {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L272 TraceCheckUtils]: 28: Hoare triple {22443#true} call #t~ret9 := is_do_read_c_triggered(); {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {22443#true} havoc ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {22443#true} assume !(1 == ~c_dr_pc~0); {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {22443#true} ~__retres1~1 := 0; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {22443#true} #res := ~__retres1~1; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22443#true} {22443#true} #1211#return; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {22443#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {22443#true} assume !(0 != ~tmp___0~1); {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,726 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22443#true} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1217#return; {22445#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:10,727 INFO L272 TraceCheckUtils]: 39: Hoare triple {22445#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {22484#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:10,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {22484#(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); {22498#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:10,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {22498#(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; {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:10,728 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22499#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22445#(= ~q_write_ev~0 ~q_read_ev~0)} #1219#return; {22444#false} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {22444#false} assume !false; {22444#false} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {22444#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; {22444#false} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {22444#false} assume !false; {22444#false} is VALID [2022-02-20 19:59:10,728 INFO L272 TraceCheckUtils]: 47: Hoare triple {22444#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22443#true} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {22443#true} havoc ~__retres1~2; {22443#true} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {22443#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22443#true} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {22443#true} #res := ~__retres1~2; {22443#true} is VALID [2022-02-20 19:59:10,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {22443#true} assume true; {22443#true} is VALID [2022-02-20 19:59:10,728 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22443#true} {22444#false} #1221#return; {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {22444#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; {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {22444#false} assume 0 != eval1_~tmp___1~0#1; {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {22444#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; {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {22444#false} assume !(0 != eval1_~tmp~2#1); {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L272 TraceCheckUtils]: 57: Hoare triple {22444#false} call error1(); {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {22444#false} assume !false; {22444#false} is VALID [2022-02-20 19:59:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:10,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:10,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049965918] [2022-02-20 19:59:10,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049965918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:10,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:10,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:10,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687773191] [2022-02-20 19:59:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:10,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:10,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:10,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:10,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:10,764 INFO L87 Difference]: Start difference. First operand 1432 states and 1904 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:13,420 INFO L93 Difference]: Finished difference Result 2783 states and 3608 transitions. [2022-02-20 19:59:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 19:59:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 825 transitions. [2022-02-20 19:59:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 825 transitions. [2022-02-20 19:59:13,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 825 transitions. [2022-02-20 19:59:13,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 825 edges. 825 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,097 INFO L225 Difference]: With dead ends: 2783 [2022-02-20 19:59:14,098 INFO L226 Difference]: Without dead ends: 1810 [2022-02-20 19:59:14,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:59:14,100 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 1187 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:14,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 1412 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-02-20 19:59:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1374. [2022-02-20 19:59:14,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:14,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1810 states. Second operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:59:14,155 INFO L74 IsIncluded]: Start isIncluded. First operand 1810 states. Second operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:59:14,156 INFO L87 Difference]: Start difference. First operand 1810 states. Second operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:59:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,258 INFO L93 Difference]: Finished difference Result 1810 states and 2333 transitions. [2022-02-20 19:59:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2333 transitions. [2022-02-20 19:59:14,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1810 states. [2022-02-20 19:59:14,265 INFO L87 Difference]: Start difference. First operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) Second operand 1810 states. [2022-02-20 19:59:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:14,363 INFO L93 Difference]: Finished difference Result 1810 states and 2333 transitions. [2022-02-20 19:59:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2333 transitions. [2022-02-20 19:59:14,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:14,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:14,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:14,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-02-20 19:59:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1823 transitions. [2022-02-20 19:59:14,446 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1823 transitions. Word has length 59 [2022-02-20 19:59:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:14,446 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 1823 transitions. [2022-02-20 19:59:14,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1823 transitions. [2022-02-20 19:59:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:14,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:14,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:14,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:14,448 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1663033948, now seen corresponding path program 1 times [2022-02-20 19:59:14,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:14,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951584100] [2022-02-20 19:59:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:14,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:14,498 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:14,499 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:14,499 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:14,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:14,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:14,504 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:14,507 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:14,553 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:14,554 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:14,557 INFO L158 Benchmark]: Toolchain (without parser) took 22757.84ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 75.1MB in the beginning and 114.0MB in the end (delta: -38.9MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,557 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 52.1MB in the beginning and 52.1MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:14,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.84ms. Allocated memory is still 107.0MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.74ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 66.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,559 INFO L158 Benchmark]: Boogie Preprocessor took 49.22ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 63.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,560 INFO L158 Benchmark]: RCFGBuilder took 736.11ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 59.3MB in the end (delta: 3.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,560 INFO L158 Benchmark]: TraceAbstraction took 21518.81ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 59.3MB in the beginning and 114.0MB in the end (delta: -54.7MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:14,561 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 81.8MB. Free memory was 52.1MB in the beginning and 52.1MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.84ms. Allocated memory is still 107.0MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.74ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 66.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.22ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 63.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 736.11ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 59.3MB in the end (delta: 3.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21518.81ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 59.3MB in the beginning and 114.0MB in the end (delta: -54.7MB). Peak memory consumption was 74.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:14,599 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 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.06.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 e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:16,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:16,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:16,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:16,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:16,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:16,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:16,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:16,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:16,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:16,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:16,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:16,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:16,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:16,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:16,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:16,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:16,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:16,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:16,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:16,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:16,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:16,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:16,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:16,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:16,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:16,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:16,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:16,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:16,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:16,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:16,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:16,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:16,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:16,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:16,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:16,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:16,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:16,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:16,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:16,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:16,194 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:16,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:16,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:16,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:16,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:16,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:16,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:16,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:16,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:16,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:16,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:16,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:16,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:16,211 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:16,211 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:16,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:16,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:16,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:16,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:16,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:16,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:16,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:16,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:16,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:16,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:16,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:16,219 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:16,220 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:16,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:16,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:16,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:16,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:16,220 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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2022-02-20 19:59:16,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:16,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:16,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:16,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:16,477 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:16,478 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.06.cil-2.c [2022-02-20 19:59:16,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f124fb87b/0df10b39fe304f7c8beebd0110ccebc5/FLAG4bacd8b77 [2022-02-20 19:59:16,937 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:16,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-02-20 19:59:16,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f124fb87b/0df10b39fe304f7c8beebd0110ccebc5/FLAG4bacd8b77 [2022-02-20 19:59:17,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f124fb87b/0df10b39fe304f7c8beebd0110ccebc5 [2022-02-20 19:59:17,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:17,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:17,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:17,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:17,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6f00db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17, skipping insertion in model container [2022-02-20 19:59:17,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:17,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:17,473 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.06.cil-2.c[914,927] [2022-02-20 19:59:17,529 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.06.cil-2.c[7125,7138] [2022-02-20 19:59:17,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,648 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:17,658 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.06.cil-2.c[914,927] [2022-02-20 19:59:17,681 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.06.cil-2.c[7125,7138] [2022-02-20 19:59:17,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,731 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17 WrapperNode [2022-02-20 19:59:17,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:17,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:17,737 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:17" (1/1) ... [2022-02-20 19:59:17,756 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:17" (1/1) ... [2022-02-20 19:59:17,806 INFO L137 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 666 [2022-02-20 19:59:17,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:17,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:17,816 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:17" (1/1) ... [2022-02-20 19:59:17,816 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:17" (1/1) ... [2022-02-20 19:59:17,826 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:17" (1/1) ... [2022-02-20 19:59:17,832 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:17" (1/1) ... [2022-02-20 19:59:17,840 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:17" (1/1) ... [2022-02-20 19:59:17,866 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:17" (1/1) ... [2022-02-20 19:59:17,868 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:17" (1/1) ... [2022-02-20 19:59:17,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:17,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:17,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:17,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:17,894 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,895 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,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:17,935 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:17,935 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:17,935 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:18,046 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:18,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:18,570 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:18,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:18,585 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-02-20 19:59:18,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18 BoogieIcfgContainer [2022-02-20 19:59:18,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:18,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:18,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:18,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:18,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:17" (1/3) ... [2022-02-20 19:59:18,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505d029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17" (2/3) ... [2022-02-20 19:59:18,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505d029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:18, skipping insertion in model container [2022-02-20 19:59:18,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:18" (3/3) ... [2022-02-20 19:59:18,592 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-02-20 19:59:18,595 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:18,595 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:18,641 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:18,653 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:18,653 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 19:59:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:18,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:18,692 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1975408481, now seen corresponding path program 1 times [2022-02-20 19:59:18,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:18,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087116694] [2022-02-20 19:59:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:18,709 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:18,710 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:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:19,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {337#true} is VALID [2022-02-20 19:59:19,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1; {337#true} is VALID [2022-02-20 19:59:19,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume 0bv32 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(= (_ 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; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,116 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {348#(= (_ bv2 32) ~q_read_ev~0)} #1213#return; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {348#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,119 INFO L272 TraceCheckUtils]: 12: Hoare triple {348#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {355#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {383#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:19,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {383#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {383#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:19,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {383#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {383#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:19,121 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {383#(= |old(~q_read_ev~0)| (_ bv0 32))} {348#(= (_ bv2 32) ~q_read_ev~0)} #1215#return; {338#false} is VALID [2022-02-20 19:59:19,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {338#false} call activate_threads1(); {338#false} is VALID [2022-02-20 19:59:19,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {338#false} havoc ~tmp~1;havoc ~tmp___0~1; {338#false} is VALID [2022-02-20 19:59:19,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {338#false} call #t~ret8 := is_do_write_p_triggered(); {338#false} is VALID [2022-02-20 19:59:19,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {338#false} havoc ~__retres1~0; {338#false} is VALID [2022-02-20 19:59:19,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {338#false} assume !(1bv32 == ~p_dw_pc~0); {338#false} is VALID [2022-02-20 19:59:19,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {338#false} ~__retres1~0 := 0bv32; {338#false} is VALID [2022-02-20 19:59:19,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {338#false} #res := ~__retres1~0; {338#false} is VALID [2022-02-20 19:59:19,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {338#false} assume true; {338#false} is VALID [2022-02-20 19:59:19,124 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {338#false} {338#false} #1209#return; {338#false} is VALID [2022-02-20 19:59:19,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {338#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {338#false} is VALID [2022-02-20 19:59:19,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {338#false} assume !(0bv32 != ~tmp~1); {338#false} is VALID [2022-02-20 19:59:19,125 INFO L272 TraceCheckUtils]: 28: Hoare triple {338#false} call #t~ret9 := is_do_read_c_triggered(); {338#false} is VALID [2022-02-20 19:59:19,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {338#false} havoc ~__retres1~1; {338#false} is VALID [2022-02-20 19:59:19,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {338#false} assume 1bv32 == ~c_dr_pc~0; {338#false} is VALID [2022-02-20 19:59:19,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {338#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {338#false} is VALID [2022-02-20 19:59:19,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {338#false} #res := ~__retres1~1; {338#false} is VALID [2022-02-20 19:59:19,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {338#false} assume true; {338#false} is VALID [2022-02-20 19:59:19,127 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {338#false} {338#false} #1211#return; {338#false} is VALID [2022-02-20 19:59:19,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {338#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {338#false} is VALID [2022-02-20 19:59:19,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {338#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {338#false} is VALID [2022-02-20 19:59:19,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {338#false} assume true; {338#false} is VALID [2022-02-20 19:59:19,128 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {338#false} {338#false} #1217#return; {338#false} is VALID [2022-02-20 19:59:19,129 INFO L272 TraceCheckUtils]: 39: Hoare triple {338#false} call reset_delta_events1(); {338#false} is VALID [2022-02-20 19:59:19,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {338#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {338#false} is VALID [2022-02-20 19:59:19,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {338#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {338#false} is VALID [2022-02-20 19:59:19,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {338#false} assume true; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {338#false} {338#false} #1219#return; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {338#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; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L272 TraceCheckUtils]: 47: Hoare triple {338#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {338#false} is VALID [2022-02-20 19:59:19,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {338#false} havoc ~__retres1~2; {338#false} is VALID [2022-02-20 19:59:19,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {338#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {338#false} #res := ~__retres1~2; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {338#false} assume true; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {338#false} {338#false} #1221#return; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {338#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {338#false} assume 0bv32 != eval1_~tmp___1~0#1; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {338#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {338#false} is VALID [2022-02-20 19:59:19,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {338#false} assume !(0bv32 != eval1_~tmp~2#1); {338#false} is VALID [2022-02-20 19:59:19,134 INFO L272 TraceCheckUtils]: 57: Hoare triple {338#false} call error1(); {338#false} is VALID [2022-02-20 19:59:19,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 19:59:19,135 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:19,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:19,136 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:19,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087116694] [2022-02-20 19:59:19,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087116694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:19,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:19,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:19,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603149140] [2022-02-20 19:59:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:19,142 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:19,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:19,145 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:19,190 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:19,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:19,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:19,206 INFO L87 Difference]: Start difference. First operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) 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:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:20,959 INFO L93 Difference]: Finished difference Result 750 states and 1172 transitions. [2022-02-20 19:59:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:20,960 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:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:20,961 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:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1172 transitions. [2022-02-20 19:59:20,980 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:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1172 transitions. [2022-02-20 19:59:20,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1172 transitions. [2022-02-20 19:59:21,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1172 edges. 1172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:21,840 INFO L225 Difference]: With dead ends: 750 [2022-02-20 19:59:21,840 INFO L226 Difference]: Without dead ends: 428 [2022-02-20 19:59:21,846 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:21,849 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 358 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:21,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 1254 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-20 19:59:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2022-02-20 19:59:21,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:21,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:21,911 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:21,913 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,931 INFO L93 Difference]: Finished difference Result 428 states and 623 transitions. [2022-02-20 19:59:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2022-02-20 19:59:21,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:21,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:21,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 428 states. [2022-02-20 19:59:21,941 INFO L87 Difference]: Start difference. First operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 428 states. [2022-02-20 19:59:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,959 INFO L93 Difference]: Finished difference Result 428 states and 623 transitions. [2022-02-20 19:59:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 623 transitions. [2022-02-20 19:59:21,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:21,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:21,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:21,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 614 transitions. [2022-02-20 19:59:21,976 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 614 transitions. Word has length 59 [2022-02-20 19:59:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:21,977 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 614 transitions. [2022-02-20 19:59:21,977 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:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 614 transitions. [2022-02-20 19:59:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:21,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:21,978 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:21,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:22,187 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:22,187 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2080229855, now seen corresponding path program 1 times [2022-02-20 19:59:22,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:22,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061886520] [2022-02-20 19:59:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:22,200 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:22,202 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:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:22,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {2951#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {2951#true} is VALID [2022-02-20 19:59:22,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1; {2951#true} is VALID [2022-02-20 19:59:22,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2951#true} assume 0bv32 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {2962#(= (_ 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; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,444 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {2962#(= (_ bv2 32) ~q_write_ev~0)} #1213#return; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {2962#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {2962#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:22,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2969#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {3000#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:22,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {3000#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {3000#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:22,452 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3000#(= |old(~q_write_ev~0)| (_ bv0 32))} {2962#(= (_ bv2 32) ~q_write_ev~0)} #1215#return; {2952#false} is VALID [2022-02-20 19:59:22,452 INFO L272 TraceCheckUtils]: 17: Hoare triple {2952#false} call activate_threads1(); {2952#false} is VALID [2022-02-20 19:59:22,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {2952#false} havoc ~tmp~1;havoc ~tmp___0~1; {2952#false} is VALID [2022-02-20 19:59:22,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {2952#false} call #t~ret8 := is_do_write_p_triggered(); {2952#false} is VALID [2022-02-20 19:59:22,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {2952#false} havoc ~__retres1~0; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {2952#false} assume !(1bv32 == ~p_dw_pc~0); {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {2952#false} ~__retres1~0 := 0bv32; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {2952#false} #res := ~__retres1~0; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {2952#false} assume true; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2952#false} {2952#false} #1209#return; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {2952#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2952#false} is VALID [2022-02-20 19:59:22,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {2952#false} assume !(0bv32 != ~tmp~1); {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L272 TraceCheckUtils]: 28: Hoare triple {2952#false} call #t~ret9 := is_do_read_c_triggered(); {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {2952#false} havoc ~__retres1~1; {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {2952#false} assume 1bv32 == ~c_dr_pc~0; {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2952#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2952#false} #res := ~__retres1~1; {2952#false} is VALID [2022-02-20 19:59:22,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2952#false} assume true; {2952#false} is VALID [2022-02-20 19:59:22,455 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2952#false} {2952#false} #1211#return; {2952#false} is VALID [2022-02-20 19:59:22,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {2952#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2952#false} is VALID [2022-02-20 19:59:22,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {2952#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2952#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {2952#false} assume true; {2952#false} is VALID [2022-02-20 19:59:22,459 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2952#false} {2952#false} #1217#return; {2952#false} is VALID [2022-02-20 19:59:22,462 INFO L272 TraceCheckUtils]: 39: Hoare triple {2952#false} call reset_delta_events1(); {2952#false} is VALID [2022-02-20 19:59:22,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {2952#false} assume !(1bv32 == ~q_read_ev~0); {2952#false} is VALID [2022-02-20 19:59:22,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {2952#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2952#false} is VALID [2022-02-20 19:59:22,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {2952#false} assume true; {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2952#false} {2952#false} #1219#return; {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {2952#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; {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L272 TraceCheckUtils]: 47: Hoare triple {2952#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2952#false} is VALID [2022-02-20 19:59:22,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {2952#false} havoc ~__retres1~2; {2952#false} is VALID [2022-02-20 19:59:22,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {2952#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2952#false} is VALID [2022-02-20 19:59:22,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {2952#false} #res := ~__retres1~2; {2952#false} is VALID [2022-02-20 19:59:22,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {2952#false} assume true; {2952#false} is VALID [2022-02-20 19:59:22,467 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2952#false} {2952#false} #1221#return; {2952#false} is VALID [2022-02-20 19:59:22,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {2952#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2952#false} is VALID [2022-02-20 19:59:22,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {2952#false} assume 0bv32 != eval1_~tmp___1~0#1; {2952#false} is VALID [2022-02-20 19:59:22,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {2952#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2952#false} is VALID [2022-02-20 19:59:22,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {2952#false} assume !(0bv32 != eval1_~tmp~2#1); {2952#false} is VALID [2022-02-20 19:59:22,478 INFO L272 TraceCheckUtils]: 57: Hoare triple {2952#false} call error1(); {2952#false} is VALID [2022-02-20 19:59:22,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {2952#false} assume !false; {2952#false} is VALID [2022-02-20 19:59:22,478 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,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:22,479 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:22,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061886520] [2022-02-20 19:59:22,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061886520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:22,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:22,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:22,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867320756] [2022-02-20 19:59:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:22,481 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:22,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:22,481 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:22,520 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,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:22,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:22,522 INFO L87 Difference]: Start difference. First operand 420 states and 614 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:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,008 INFO L93 Difference]: Finished difference Result 814 states and 1170 transitions. [2022-02-20 19:59:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:24,009 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:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:24,009 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:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-02-20 19:59:24,026 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:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-02-20 19:59:24,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 751 transitions. [2022-02-20 19:59:24,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:24,547 INFO L225 Difference]: With dead ends: 814 [2022-02-20 19:59:24,547 INFO L226 Difference]: Without dead ends: 634 [2022-02-20 19:59:24,547 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:24,548 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 345 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:24,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1227 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-02-20 19:59:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2022-02-20 19:59:24,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:24,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) [2022-02-20 19:59:24,582 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) [2022-02-20 19:59:24,583 INFO L87 Difference]: Start difference. First operand 634 states. Second operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) [2022-02-20 19:59:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,599 INFO L93 Difference]: Finished difference Result 634 states and 904 transitions. [2022-02-20 19:59:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 904 transitions. [2022-02-20 19:59:24,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:24,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:24,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) Second operand 634 states. [2022-02-20 19:59:24,603 INFO L87 Difference]: Start difference. First operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) Second operand 634 states. [2022-02-20 19:59:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,619 INFO L93 Difference]: Finished difference Result 634 states and 904 transitions. [2022-02-20 19:59:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 904 transitions. [2022-02-20 19:59:24,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:24,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:24,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:24,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 511 states have (on average 1.4403131115459882) internal successors, (736), 526 states have internal predecessors, (736), 68 states have call successors, (68), 35 states have call predecessors, (68), 44 states have return successors, (90), 68 states have call predecessors, (90), 65 states have call successors, (90) [2022-02-20 19:59:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 894 transitions. [2022-02-20 19:59:24,641 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 894 transitions. Word has length 59 [2022-02-20 19:59:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:24,641 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 894 transitions. [2022-02-20 19:59:24,641 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:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 894 transitions. [2022-02-20 19:59:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:24,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:24,643 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:24,652 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:24,852 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:24,853 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 142404386, now seen corresponding path program 1 times [2022-02-20 19:59:24,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:24,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285459743] [2022-02-20 19:59:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:24,854 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:24,855 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:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:24,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:25,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {6348#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {6348#true} is VALID [2022-02-20 19:59:25,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {6348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1; {6348#true} is VALID [2022-02-20 19:59:25,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {6348#true} assume 0bv32 != main_#t~nondet38#1;havoc main_#t~nondet38#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; {6348#true} is VALID [2022-02-20 19:59:25,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {6348#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; {6348#true} is VALID [2022-02-20 19:59:25,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {6348#true} call update_channels1(); {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {6348#true} assume !(1bv32 == ~q_req_up~0); {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {6348#true} assume true; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6348#true} {6348#true} #1213#return; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {6348#true} assume { :begin_inline_init_threads1 } true; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {6348#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {6348#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {6348#true} assume { :end_inline_init_threads1 } true; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L272 TraceCheckUtils]: 12: Hoare triple {6348#true} call fire_delta_events1(); {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {6348#true} assume !(0bv32 == ~q_read_ev~0); {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {6348#true} assume !(0bv32 == ~q_write_ev~0); {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {6348#true} assume true; {6348#true} is VALID [2022-02-20 19:59:25,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6348#true} {6348#true} #1215#return; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L272 TraceCheckUtils]: 17: Hoare triple {6348#true} call activate_threads1(); {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {6348#true} havoc ~tmp~1;havoc ~tmp___0~1; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L272 TraceCheckUtils]: 19: Hoare triple {6348#true} call #t~ret8 := is_do_write_p_triggered(); {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {6348#true} havoc ~__retres1~0; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {6348#true} assume !(1bv32 == ~p_dw_pc~0); {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {6348#true} ~__retres1~0 := 0bv32; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {6348#true} #res := ~__retres1~0; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {6348#true} assume true; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6348#true} {6348#true} #1209#return; {6348#true} is VALID [2022-02-20 19:59:25,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {6348#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {6348#true} is VALID [2022-02-20 19:59:25,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {6348#true} assume !(0bv32 != ~tmp~1); {6348#true} is VALID [2022-02-20 19:59:25,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {6348#true} call #t~ret9 := is_do_read_c_triggered(); {6348#true} is VALID [2022-02-20 19:59:25,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {6348#true} havoc ~__retres1~1; {6348#true} is VALID [2022-02-20 19:59:25,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {6348#true} assume !(1bv32 == ~c_dr_pc~0); {6348#true} is VALID [2022-02-20 19:59:25,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {6348#true} ~__retres1~1 := 0bv32; {6446#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:25,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {6446#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {6450#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:25,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {6450#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {6450#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:25,085 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6450#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {6348#true} #1211#return; {6457#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:25,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {6457#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {6461#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:25,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {6461#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {6349#false} is VALID [2022-02-20 19:59:25,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {6349#false} assume true; {6349#false} is VALID [2022-02-20 19:59:25,086 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6349#false} {6348#true} #1217#return; {6349#false} is VALID [2022-02-20 19:59:25,086 INFO L272 TraceCheckUtils]: 39: Hoare triple {6349#false} call reset_delta_events1(); {6349#false} is VALID [2022-02-20 19:59:25,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {6349#false} assume !(1bv32 == ~q_read_ev~0); {6349#false} is VALID [2022-02-20 19:59:25,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {6349#false} assume !(1bv32 == ~q_write_ev~0); {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {6349#false} assume true; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6349#false} {6349#false} #1219#return; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {6349#false} assume !false; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {6349#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; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {6349#false} assume !false; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L272 TraceCheckUtils]: 47: Hoare triple {6349#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {6349#false} havoc ~__retres1~2; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {6349#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {6349#false} #res := ~__retres1~2; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {6349#false} assume true; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6349#false} {6349#false} #1221#return; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {6349#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {6349#false} assume 0bv32 != eval1_~tmp___1~0#1; {6349#false} is VALID [2022-02-20 19:59:25,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {6349#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {6349#false} is VALID [2022-02-20 19:59:25,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {6349#false} assume !(0bv32 != eval1_~tmp~2#1); {6349#false} is VALID [2022-02-20 19:59:25,088 INFO L272 TraceCheckUtils]: 57: Hoare triple {6349#false} call error1(); {6349#false} is VALID [2022-02-20 19:59:25,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {6349#false} assume !false; {6349#false} is VALID [2022-02-20 19:59:25,088 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:25,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:25,088 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:25,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285459743] [2022-02-20 19:59:25,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285459743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:25,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:25,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:25,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880823283] [2022-02-20 19:59:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:25,090 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:25,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:25,090 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:25,128 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:25,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:25,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:25,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:25,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:25,129 INFO L87 Difference]: Start difference. First operand 625 states and 894 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,105 INFO L93 Difference]: Finished difference Result 1010 states and 1417 transitions. [2022-02-20 19:59:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:26,105 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:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-02-20 19:59:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-02-20 19:59:26,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 611 transitions. [2022-02-20 19:59:26,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,467 INFO L225 Difference]: With dead ends: 1010 [2022-02-20 19:59:26,467 INFO L226 Difference]: Without dead ends: 639 [2022-02-20 19:59:26,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:26,469 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 4 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:26,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2390 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-02-20 19:59:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 635. [2022-02-20 19:59:26,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:26,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 639 states. Second operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) [2022-02-20 19:59:26,488 INFO L74 IsIncluded]: Start isIncluded. First operand 639 states. Second operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) [2022-02-20 19:59:26,489 INFO L87 Difference]: Start difference. First operand 639 states. Second operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) [2022-02-20 19:59:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,506 INFO L93 Difference]: Finished difference Result 639 states and 908 transitions. [2022-02-20 19:59:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 908 transitions. [2022-02-20 19:59:26,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) Second operand 639 states. [2022-02-20 19:59:26,510 INFO L87 Difference]: Start difference. First operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) Second operand 639 states. [2022-02-20 19:59:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,533 INFO L93 Difference]: Finished difference Result 639 states and 908 transitions. [2022-02-20 19:59:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 908 transitions. [2022-02-20 19:59:26,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 519 states have (on average 1.4296724470134874) internal successors, (742), 534 states have internal predecessors, (742), 68 states have call successors, (68), 35 states have call predecessors, (68), 46 states have return successors, (92), 70 states have call predecessors, (92), 65 states have call successors, (92) [2022-02-20 19:59:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 902 transitions. [2022-02-20 19:59:26,556 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 902 transitions. Word has length 59 [2022-02-20 19:59:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,556 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 902 transitions. [2022-02-20 19:59:26,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 902 transitions. [2022-02-20 19:59:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:26,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,558 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,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 19:59:26,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:26,765 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1663033948, now seen corresponding path program 1 times [2022-02-20 19:59:26,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:26,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369428212] [2022-02-20 19:59:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:26,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:26,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 19:59:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:26,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:26,965 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:26,965 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:26,966 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:26,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:27,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:27,174 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 19:59:27,176 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:27,219 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:27,219 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:27,222 INFO L158 Benchmark]: Toolchain (without parser) took 9896.33ms. Allocated memory was 54.5MB in the beginning and 121.6MB in the end (delta: 67.1MB). Free memory was 32.3MB in the beginning and 47.9MB in the end (delta: -15.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,222 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:27,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.91ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 41.7MB in the end (delta: -9.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.70ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 37.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,223 INFO L158 Benchmark]: Boogie Preprocessor took 61.32ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 50.3MB in the end (delta: -12.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,223 INFO L158 Benchmark]: RCFGBuilder took 715.49ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 47.8MB in the end (delta: 2.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,224 INFO L158 Benchmark]: TraceAbstraction took 8632.88ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 47.4MB in the beginning and 47.9MB in the end (delta: -457.6kB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-02-20 19:59:27,225 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.91ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.2MB in the beginning and 41.7MB in the end (delta: -9.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.70ms. Allocated memory is still 69.2MB. Free memory was 41.7MB in the beginning and 37.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.32ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 50.3MB in the end (delta: -12.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 715.49ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 47.8MB in the end (delta: 2.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8632.88ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 47.4MB in the beginning and 47.9MB in the end (delta: -457.6kB). Peak memory consumption was 52.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:27,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator