./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.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.13.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 e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:16,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:16,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:16,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:16,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:16,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:16,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:16,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:16,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:16,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:16,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:16,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:16,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:16,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:16,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:16,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:16,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:16,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:16,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:16,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:16,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:16,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:16,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:16,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:16,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:16,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:16,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:16,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:16,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:16,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:16,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:16,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:16,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:16,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:16,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:16,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:16,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:16,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:16,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:16,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:16,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:16,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:16,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:16,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:16,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:16,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:16,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:16,153 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:16,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:16,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:16,154 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:16,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:16,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:16,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:16,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:16,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:16,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:16,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:16,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:16,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:16,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:16,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:16,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:16,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:16,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:16,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:16,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:16,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:16,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:16,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:16,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:16,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:16,161 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:16,161 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:16,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:16,162 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 -> e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec [2022-02-20 19:59:16,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:16,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:16,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:16,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:16,412 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:16,414 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.13.cil-2.c [2022-02-20 19:59:16,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f50b754/a1ad6fcdab40429db8d46f5ec055e736/FLAG6dfcdbfb5 [2022-02-20 19:59:16,885 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:16,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2022-02-20 19:59:16,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f50b754/a1ad6fcdab40429db8d46f5ec055e736/FLAG6dfcdbfb5 [2022-02-20 19:59:17,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f50b754/a1ad6fcdab40429db8d46f5ec055e736 [2022-02-20 19:59:17,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:17,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:17,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:17,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:17,268 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,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303c2344 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,269 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,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:17,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:17,466 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.13.cil-2.c[914,927] [2022-02-20 19:59:17,536 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.13.cil-2.c[7125,7138] [2022-02-20 19:59:17,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,719 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:17,729 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.13.cil-2.c[914,927] [2022-02-20 19:59:17,742 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.13.cil-2.c[7125,7138] [2022-02-20 19:59:17,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:17,820 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:17,821 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,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:17,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:17,829 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,853 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,919 INFO L137 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1099 [2022-02-20 19:59:17,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:17,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:17,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:17,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:17,928 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,928 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,935 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,936 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,953 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,970 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,988 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,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:18,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:18,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:18,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:18,003 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:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:18,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:18,036 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:18,051 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:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:18,074 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:18,074 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:18,077 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:18,077 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:18,078 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:18,078 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:18,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:18,079 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:18,253 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:18,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:19,247 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:19,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:19,266 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-02-20 19:59:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:19 BoogieIcfgContainer [2022-02-20 19:59:19,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:19,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:19,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:19,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:19,275 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:19,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4585dc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:19, skipping insertion in model container [2022-02-20 19:59:19,276 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:19,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4585dc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:19, skipping insertion in model container [2022-02-20 19:59:19,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:19" (3/3) ... [2022-02-20 19:59:19,278 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2022-02-20 19:59:19,282 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:19,282 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:19,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:19,344 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:19,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 509 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 457 states have internal predecessors, (740), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:59:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:19,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:19,409 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:19,410 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 964749711, now seen corresponding path program 1 times [2022-02-20 19:59:19,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:19,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252970134] [2022-02-20 19:59:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#(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); {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {514#(= ~q_read_ev~0 2)} #1997#return; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(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; {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#(= |old(~q_read_ev~0)| 0)} assume true; {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {555#(= |old(~q_read_ev~0)| 0)} {514#(= ~q_read_ev~0 2)} #1999#return; {513#false} is VALID [2022-02-20 19:59:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#true} havoc ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume 1 == ~p_dw_pc~0; {512#true} is VALID [2022-02-20 19:59:19,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {512#true} is VALID [2022-02-20 19:59:19,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} #res := ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,826 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {512#true} {512#true} #1993#return; {512#true} is VALID [2022-02-20 19:59:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#true} havoc ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume 1 == ~c_dr_pc~0; {512#true} is VALID [2022-02-20 19:59:19,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {512#true} is VALID [2022-02-20 19:59:19,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} #res := ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,834 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {512#true} {512#true} #1995#return; {512#true} is VALID [2022-02-20 19:59:19,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(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; {512#true} is VALID [2022-02-20 19:59:19,835 INFO L272 TraceCheckUtils]: 1: Hoare triple {512#true} call #t~ret8 := is_do_write_p_triggered(); {512#true} is VALID [2022-02-20 19:59:19,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} havoc ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume 1 == ~p_dw_pc~0; {512#true} is VALID [2022-02-20 19:59:19,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {512#true} is VALID [2022-02-20 19:59:19,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} #res := ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,837 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {512#true} {512#true} #1993#return; {512#true} is VALID [2022-02-20 19:59:19,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {512#true} is VALID [2022-02-20 19:59:19,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {512#true} is VALID [2022-02-20 19:59:19,838 INFO L272 TraceCheckUtils]: 10: Hoare triple {512#true} call #t~ret9 := is_do_read_c_triggered(); {512#true} is VALID [2022-02-20 19:59:19,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#true} havoc ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} assume 1 == ~c_dr_pc~0; {512#true} is VALID [2022-02-20 19:59:19,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {512#true} is VALID [2022-02-20 19:59:19,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} #res := ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,840 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {512#true} {512#true} #1995#return; {512#true} is VALID [2022-02-20 19:59:19,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {512#true} is VALID [2022-02-20 19:59:19,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {512#true} is VALID [2022-02-20 19:59:19,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,841 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {512#true} {513#false} #2001#return; {513#false} is VALID [2022-02-20 19:59:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(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; {512#true} is VALID [2022-02-20 19:59:19,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {512#true} is VALID [2022-02-20 19:59:19,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {513#false} #2003#return; {513#false} is VALID [2022-02-20 19:59:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#true} havoc ~__retres1~2; {512#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {512#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} #res := ~__retres1~2; {512#true} is VALID [2022-02-20 19:59:19,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,872 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {512#true} {513#false} #2005#return; {513#false} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {512#true} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {512#true} is VALID [2022-02-20 19:59:19,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {514#(= ~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; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#(= ~q_read_ev~0 2)} call update_channels1(); {552#(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:19,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {552#(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); {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,883 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {553#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {514#(= ~q_read_ev~0 2)} #1997#return; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {514#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {514#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:19,888 INFO L272 TraceCheckUtils]: 12: Hoare triple {514#(= ~q_read_ev~0 2)} call fire_delta_events1(); {554#(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:19,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(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; {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(= |old(~q_read_ev~0)| 0)} assume true; {555#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:19,890 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {555#(= |old(~q_read_ev~0)| 0)} {514#(= ~q_read_ev~0 2)} #1999#return; {513#false} is VALID [2022-02-20 19:59:19,891 INFO L272 TraceCheckUtils]: 17: Hoare triple {513#false} call activate_threads1(); {556#(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:19,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {556#(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; {512#true} is VALID [2022-02-20 19:59:19,891 INFO L272 TraceCheckUtils]: 19: Hoare triple {512#true} call #t~ret8 := is_do_write_p_triggered(); {512#true} is VALID [2022-02-20 19:59:19,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} havoc ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume 1 == ~p_dw_pc~0; {512#true} is VALID [2022-02-20 19:59:19,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {512#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {512#true} is VALID [2022-02-20 19:59:19,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#true} #res := ~__retres1~0; {512#true} is VALID [2022-02-20 19:59:19,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,893 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {512#true} {512#true} #1993#return; {512#true} is VALID [2022-02-20 19:59:19,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {512#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {512#true} is VALID [2022-02-20 19:59:19,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {512#true} is VALID [2022-02-20 19:59:19,893 INFO L272 TraceCheckUtils]: 28: Hoare triple {512#true} call #t~ret9 := is_do_read_c_triggered(); {512#true} is VALID [2022-02-20 19:59:19,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {512#true} havoc ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#true} assume 1 == ~c_dr_pc~0; {512#true} is VALID [2022-02-20 19:59:19,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {512#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {512#true} is VALID [2022-02-20 19:59:19,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {512#true} #res := ~__retres1~1; {512#true} is VALID [2022-02-20 19:59:19,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,895 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {512#true} {512#true} #1995#return; {512#true} is VALID [2022-02-20 19:59:19,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {512#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {512#true} is VALID [2022-02-20 19:59:19,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {512#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {512#true} is VALID [2022-02-20 19:59:19,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,896 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {512#true} {513#false} #2001#return; {513#false} is VALID [2022-02-20 19:59:19,896 INFO L272 TraceCheckUtils]: 39: Hoare triple {513#false} call reset_delta_events1(); {554#(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:19,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {554#(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; {512#true} is VALID [2022-02-20 19:59:19,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {512#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {512#true} is VALID [2022-02-20 19:59:19,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,897 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {512#true} {513#false} #2003#return; {513#false} is VALID [2022-02-20 19:59:19,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:19,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {513#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; {513#false} is VALID [2022-02-20 19:59:19,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:19,898 INFO L272 TraceCheckUtils]: 47: Hoare triple {513#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {512#true} is VALID [2022-02-20 19:59:19,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {512#true} havoc ~__retres1~2; {512#true} is VALID [2022-02-20 19:59:19,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {512#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {512#true} is VALID [2022-02-20 19:59:19,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {512#true} #res := ~__retres1~2; {512#true} is VALID [2022-02-20 19:59:19,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {512#true} assume true; {512#true} is VALID [2022-02-20 19:59:19,901 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {512#true} {513#false} #2005#return; {513#false} is VALID [2022-02-20 19:59:19,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {513#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; {513#false} is VALID [2022-02-20 19:59:19,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {513#false} assume 0 != eval1_~tmp___1~0#1; {513#false} is VALID [2022-02-20 19:59:19,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {513#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; {513#false} is VALID [2022-02-20 19:59:19,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {513#false} assume !(0 != eval1_~tmp~2#1); {513#false} is VALID [2022-02-20 19:59:19,902 INFO L272 TraceCheckUtils]: 57: Hoare triple {513#false} call error1(); {513#false} is VALID [2022-02-20 19:59:19,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:19,907 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,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:19,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252970134] [2022-02-20 19:59:19,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252970134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:19,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:19,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:19,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471387522] [2022-02-20 19:59:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:19,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:19,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:19,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:19,969 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,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:19,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:20,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:20,006 INFO L87 Difference]: Start difference. First operand has 509 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 457 states have internal predecessors, (740), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,047 INFO L93 Difference]: Finished difference Result 1125 states and 1806 transitions. [2022-02-20 19:59:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1806 transitions. [2022-02-20 19:59:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1806 transitions. [2022-02-20 19:59:24,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1806 transitions. [2022-02-20 19:59:25,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1806 edges. 1806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:25,461 INFO L225 Difference]: With dead ends: 1125 [2022-02-20 19:59:25,462 INFO L226 Difference]: Without dead ends: 635 [2022-02-20 19:59:25,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:25,475 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 1256 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:25,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1261 Valid, 2233 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:59:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-20 19:59:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 595. [2022-02-20 19:59:25,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:25,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:59:25,547 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:59:25,549 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:59:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,620 INFO L93 Difference]: Finished difference Result 635 states and 956 transitions. [2022-02-20 19:59:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 956 transitions. [2022-02-20 19:59:25,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:25,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:25,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 635 states. [2022-02-20 19:59:25,633 INFO L87 Difference]: Start difference. First operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 635 states. [2022-02-20 19:59:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,698 INFO L93 Difference]: Finished difference Result 635 states and 956 transitions. [2022-02-20 19:59:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 956 transitions. [2022-02-20 19:59:25,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:25,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:25,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:25,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 19:59:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 901 transitions. [2022-02-20 19:59:25,745 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 901 transitions. Word has length 59 [2022-02-20 19:59:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:25,746 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 901 transitions. [2022-02-20 19:59:25,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 901 transitions. [2022-02-20 19:59:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:25,750 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:25,751 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:25,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:25,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1727399342, now seen corresponding path program 1 times [2022-02-20 19:59:25,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:25,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207377999] [2022-02-20 19:59:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#(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); {4120#true} is VALID [2022-02-20 19:59:25,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4120#true} {4120#true} #1997#return; {4120#true} is VALID [2022-02-20 19:59:25,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {4160#(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); {4120#true} is VALID [2022-02-20 19:59:25,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume !(0 == ~q_write_ev~0); {4120#true} is VALID [2022-02-20 19:59:25,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4120#true} {4120#true} #1999#return; {4120#true} is VALID [2022-02-20 19:59:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {4120#true} havoc ~__retres1~0; {4120#true} is VALID [2022-02-20 19:59:25,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume !(1 == ~p_dw_pc~0); {4120#true} is VALID [2022-02-20 19:59:25,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} ~__retres1~0 := 0; {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:25,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,918 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4120#true} #1993#return; {4168#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {4120#true} havoc ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume 1 == ~c_dr_pc~0; {4120#true} is VALID [2022-02-20 19:59:25,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4120#true} is VALID [2022-02-20 19:59:25,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {4120#true} #res := ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,924 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4120#true} {4121#false} #1995#return; {4121#false} is VALID [2022-02-20 19:59:25,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {4161#(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; {4120#true} is VALID [2022-02-20 19:59:25,924 INFO L272 TraceCheckUtils]: 1: Hoare triple {4120#true} call #t~ret8 := is_do_write_p_triggered(); {4120#true} is VALID [2022-02-20 19:59:25,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} havoc ~__retres1~0; {4120#true} is VALID [2022-02-20 19:59:25,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {4120#true} assume !(1 == ~p_dw_pc~0); {4120#true} is VALID [2022-02-20 19:59:25,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {4120#true} ~__retres1~0 := 0; {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:25,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,933 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4120#true} #1993#return; {4168#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:25,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {4168#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4169#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:25,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {4169#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4121#false} is VALID [2022-02-20 19:59:25,935 INFO L272 TraceCheckUtils]: 10: Hoare triple {4121#false} call #t~ret9 := is_do_read_c_triggered(); {4120#true} is VALID [2022-02-20 19:59:25,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {4120#true} havoc ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {4120#true} assume 1 == ~c_dr_pc~0; {4120#true} is VALID [2022-02-20 19:59:25,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {4120#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4120#true} is VALID [2022-02-20 19:59:25,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {4120#true} #res := ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,936 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4120#true} {4121#false} #1995#return; {4121#false} is VALID [2022-02-20 19:59:25,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {4121#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4121#false} is VALID [2022-02-20 19:59:25,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {4121#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4121#false} is VALID [2022-02-20 19:59:25,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 19:59:25,937 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4121#false} {4120#true} #2001#return; {4121#false} is VALID [2022-02-20 19:59:25,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {4160#(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); {4120#true} is VALID [2022-02-20 19:59:25,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4120#true} is VALID [2022-02-20 19:59:25,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4120#true} {4121#false} #2003#return; {4121#false} is VALID [2022-02-20 19:59:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {4120#true} havoc ~__retres1~2; {4120#true} is VALID [2022-02-20 19:59:25,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4120#true} is VALID [2022-02-20 19:59:25,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} #res := ~__retres1~2; {4120#true} is VALID [2022-02-20 19:59:25,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,949 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4120#true} {4121#false} #2005#return; {4121#false} is VALID [2022-02-20 19:59:25,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {4120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {4120#true} is VALID [2022-02-20 19:59:25,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {4120#true} is VALID [2022-02-20 19:59:25,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {4120#true} is VALID [2022-02-20 19:59:25,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {4120#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; {4120#true} is VALID [2022-02-20 19:59:25,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {4120#true} call update_channels1(); {4159#(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:25,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {4159#(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); {4120#true} is VALID [2022-02-20 19:59:25,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,951 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4120#true} {4120#true} #1997#return; {4120#true} is VALID [2022-02-20 19:59:25,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {4120#true} assume { :begin_inline_init_threads1 } true; {4120#true} is VALID [2022-02-20 19:59:25,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {4120#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4120#true} is VALID [2022-02-20 19:59:25,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {4120#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4120#true} is VALID [2022-02-20 19:59:25,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {4120#true} assume { :end_inline_init_threads1 } true; {4120#true} is VALID [2022-02-20 19:59:25,952 INFO L272 TraceCheckUtils]: 12: Hoare triple {4120#true} call fire_delta_events1(); {4160#(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:25,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {4160#(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); {4120#true} is VALID [2022-02-20 19:59:25,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {4120#true} assume !(0 == ~q_write_ev~0); {4120#true} is VALID [2022-02-20 19:59:25,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,953 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4120#true} {4120#true} #1999#return; {4120#true} is VALID [2022-02-20 19:59:25,954 INFO L272 TraceCheckUtils]: 17: Hoare triple {4120#true} call activate_threads1(); {4161#(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:25,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {4161#(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; {4120#true} is VALID [2022-02-20 19:59:25,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {4120#true} call #t~ret8 := is_do_write_p_triggered(); {4120#true} is VALID [2022-02-20 19:59:25,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {4120#true} havoc ~__retres1~0; {4120#true} is VALID [2022-02-20 19:59:25,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {4120#true} assume !(1 == ~p_dw_pc~0); {4120#true} is VALID [2022-02-20 19:59:25,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {4120#true} ~__retres1~0 := 0; {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:25,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {4176#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:25,956 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4177#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {4120#true} #1993#return; {4168#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:25,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {4168#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4169#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:25,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {4169#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4121#false} is VALID [2022-02-20 19:59:25,958 INFO L272 TraceCheckUtils]: 28: Hoare triple {4121#false} call #t~ret9 := is_do_read_c_triggered(); {4120#true} is VALID [2022-02-20 19:59:25,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {4120#true} havoc ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {4120#true} assume 1 == ~c_dr_pc~0; {4120#true} is VALID [2022-02-20 19:59:25,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {4120#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4120#true} is VALID [2022-02-20 19:59:25,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {4120#true} #res := ~__retres1~1; {4120#true} is VALID [2022-02-20 19:59:25,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,959 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4120#true} {4121#false} #1995#return; {4121#false} is VALID [2022-02-20 19:59:25,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {4121#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4121#false} is VALID [2022-02-20 19:59:25,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {4121#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4121#false} is VALID [2022-02-20 19:59:25,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 19:59:25,960 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4121#false} {4120#true} #2001#return; {4121#false} is VALID [2022-02-20 19:59:25,960 INFO L272 TraceCheckUtils]: 39: Hoare triple {4121#false} call reset_delta_events1(); {4160#(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:25,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {4160#(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); {4120#true} is VALID [2022-02-20 19:59:25,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {4120#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4120#true} is VALID [2022-02-20 19:59:25,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,961 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4120#true} {4121#false} #2003#return; {4121#false} is VALID [2022-02-20 19:59:25,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 19:59:25,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {4121#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; {4121#false} is VALID [2022-02-20 19:59:25,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 19:59:25,962 INFO L272 TraceCheckUtils]: 47: Hoare triple {4121#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4120#true} is VALID [2022-02-20 19:59:25,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {4120#true} havoc ~__retres1~2; {4120#true} is VALID [2022-02-20 19:59:25,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {4120#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4120#true} is VALID [2022-02-20 19:59:25,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {4120#true} #res := ~__retres1~2; {4120#true} is VALID [2022-02-20 19:59:25,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 19:59:25,963 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4120#true} {4121#false} #2005#return; {4121#false} is VALID [2022-02-20 19:59:25,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {4121#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; {4121#false} is VALID [2022-02-20 19:59:25,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {4121#false} assume 0 != eval1_~tmp___1~0#1; {4121#false} is VALID [2022-02-20 19:59:25,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {4121#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; {4121#false} is VALID [2022-02-20 19:59:25,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {4121#false} assume !(0 != eval1_~tmp~2#1); {4121#false} is VALID [2022-02-20 19:59:25,964 INFO L272 TraceCheckUtils]: 57: Hoare triple {4121#false} call error1(); {4121#false} is VALID [2022-02-20 19:59:25,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 19:59:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:25,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:25,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207377999] [2022-02-20 19:59:25,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207377999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:25,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:25,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:25,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747986847] [2022-02-20 19:59:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:25,967 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:25,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:25,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:26,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:26,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:26,010 INFO L87 Difference]: Start difference. First operand 595 states and 901 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,485 INFO L93 Difference]: Finished difference Result 810 states and 1196 transitions. [2022-02-20 19:59:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 926 transitions. [2022-02-20 19:59:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 926 transitions. [2022-02-20 19:59:30,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 926 transitions. [2022-02-20 19:59:31,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 926 edges. 926 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,280 INFO L225 Difference]: With dead ends: 810 [2022-02-20 19:59:31,280 INFO L226 Difference]: Without dead ends: 632 [2022-02-20 19:59:31,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:31,282 INFO L933 BasicCegarLoop]: 756 mSDtfsCounter, 1028 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:31,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 2991 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-02-20 19:59:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 600. [2022-02-20 19:59:31,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:31,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 632 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:59:31,316 INFO L74 IsIncluded]: Start isIncluded. First operand 632 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:59:31,318 INFO L87 Difference]: Start difference. First operand 632 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:59:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,345 INFO L93 Difference]: Finished difference Result 632 states and 951 transitions. [2022-02-20 19:59:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 951 transitions. [2022-02-20 19:59:31,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 632 states. [2022-02-20 19:59:31,350 INFO L87 Difference]: Start difference. First operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 632 states. [2022-02-20 19:59:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,376 INFO L93 Difference]: Finished difference Result 632 states and 951 transitions. [2022-02-20 19:59:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 951 transitions. [2022-02-20 19:59:31,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:31,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 19:59:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 905 transitions. [2022-02-20 19:59:31,409 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 905 transitions. Word has length 59 [2022-02-20 19:59:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:31,411 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 905 transitions. [2022-02-20 19:59:31,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 905 transitions. [2022-02-20 19:59:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:31,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:31,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:31,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:31,414 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2002158956, now seen corresponding path program 1 times [2022-02-20 19:59:31,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:31,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419734575] [2022-02-20 19:59:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {7358#(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); {7359#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {7359#(not (= |old(~q_req_up~0)| 1))} assume true; {7359#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7359#(not (= |old(~q_req_up~0)| 1))} {7319#(= ~c_dr_pc~0 ~q_req_up~0)} #1997#return; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {7360#(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); {7316#true} is VALID [2022-02-20 19:59:31,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#true} assume !(0 == ~q_write_ev~0); {7316#true} is VALID [2022-02-20 19:59:31,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7316#true} {7323#(not (= ~c_dr_pc~0 1))} #1999#return; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {7316#true} havoc ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#true} assume !(1 == ~p_dw_pc~0); {7316#true} is VALID [2022-02-20 19:59:31,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#true} ~__retres1~0 := 0; {7316#true} is VALID [2022-02-20 19:59:31,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {7316#true} #res := ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,555 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7316#true} {7316#true} #1993#return; {7316#true} is VALID [2022-02-20 19:59:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {7316#true} havoc ~__retres1~1; {7316#true} is VALID [2022-02-20 19:59:31,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#true} assume 1 == ~c_dr_pc~0; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,564 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} {7316#true} #1995#return; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {7361#(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; {7316#true} is VALID [2022-02-20 19:59:31,565 INFO L272 TraceCheckUtils]: 1: Hoare triple {7316#true} call #t~ret8 := is_do_write_p_triggered(); {7316#true} is VALID [2022-02-20 19:59:31,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#true} havoc ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {7316#true} assume !(1 == ~p_dw_pc~0); {7316#true} is VALID [2022-02-20 19:59:31,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {7316#true} ~__retres1~0 := 0; {7316#true} is VALID [2022-02-20 19:59:31,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {7316#true} #res := ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7316#true} {7316#true} #1993#return; {7316#true} is VALID [2022-02-20 19:59:31,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {7316#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7316#true} is VALID [2022-02-20 19:59:31,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {7316#true} assume !(0 != ~tmp~1); {7316#true} is VALID [2022-02-20 19:59:31,567 INFO L272 TraceCheckUtils]: 10: Hoare triple {7316#true} call #t~ret9 := is_do_read_c_triggered(); {7316#true} is VALID [2022-02-20 19:59:31,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {7316#true} havoc ~__retres1~1; {7316#true} is VALID [2022-02-20 19:59:31,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {7316#true} assume 1 == ~c_dr_pc~0; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,572 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} {7316#true} #1995#return; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,579 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} {7323#(not (= ~c_dr_pc~0 1))} #2001#return; {7317#false} is VALID [2022-02-20 19:59:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {7360#(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); {7316#true} is VALID [2022-02-20 19:59:31,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7316#true} is VALID [2022-02-20 19:59:31,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7316#true} {7317#false} #2003#return; {7317#false} is VALID [2022-02-20 19:59:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {7316#true} havoc ~__retres1~2; {7316#true} is VALID [2022-02-20 19:59:31,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {7316#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7316#true} is VALID [2022-02-20 19:59:31,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {7316#true} #res := ~__retres1~2; {7316#true} is VALID [2022-02-20 19:59:31,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,597 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7316#true} {7317#false} #2005#return; {7317#false} is VALID [2022-02-20 19:59:31,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {7316#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {7318#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:31,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {7318#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:31,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {7319#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:31,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {7319#(= ~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; {7319#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:31,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {7319#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {7358#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:31,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {7358#(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); {7359#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {7359#(not (= |old(~q_req_up~0)| 1))} assume true; {7359#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:31,601 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7359#(not (= |old(~q_req_up~0)| 1))} {7319#(= ~c_dr_pc~0 ~q_req_up~0)} #1997#return; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {7360#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:31,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {7360#(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); {7316#true} is VALID [2022-02-20 19:59:31,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {7316#true} assume !(0 == ~q_write_ev~0); {7316#true} is VALID [2022-02-20 19:59:31,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,604 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7316#true} {7323#(not (= ~c_dr_pc~0 1))} #1999#return; {7323#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:31,605 INFO L272 TraceCheckUtils]: 17: Hoare triple {7323#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {7361#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:31,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {7361#(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; {7316#true} is VALID [2022-02-20 19:59:31,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {7316#true} call #t~ret8 := is_do_write_p_triggered(); {7316#true} is VALID [2022-02-20 19:59:31,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#true} havoc ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {7316#true} assume !(1 == ~p_dw_pc~0); {7316#true} is VALID [2022-02-20 19:59:31,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#true} ~__retres1~0 := 0; {7316#true} is VALID [2022-02-20 19:59:31,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#true} #res := ~__retres1~0; {7316#true} is VALID [2022-02-20 19:59:31,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,606 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7316#true} {7316#true} #1993#return; {7316#true} is VALID [2022-02-20 19:59:31,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {7316#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7316#true} is VALID [2022-02-20 19:59:31,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {7316#true} assume !(0 != ~tmp~1); {7316#true} is VALID [2022-02-20 19:59:31,607 INFO L272 TraceCheckUtils]: 28: Hoare triple {7316#true} call #t~ret9 := is_do_read_c_triggered(); {7316#true} is VALID [2022-02-20 19:59:31,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {7316#true} havoc ~__retres1~1; {7316#true} is VALID [2022-02-20 19:59:31,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {7316#true} assume 1 == ~c_dr_pc~0; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,609 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} {7316#true} #1995#return; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:31,611 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7374#(= (+ (- 1) ~c_dr_pc~0) 0)} {7323#(not (= ~c_dr_pc~0 1))} #2001#return; {7317#false} is VALID [2022-02-20 19:59:31,611 INFO L272 TraceCheckUtils]: 39: Hoare triple {7317#false} call reset_delta_events1(); {7360#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:31,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {7360#(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); {7316#true} is VALID [2022-02-20 19:59:31,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {7316#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7316#true} is VALID [2022-02-20 19:59:31,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,612 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7316#true} {7317#false} #2003#return; {7317#false} is VALID [2022-02-20 19:59:31,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {7317#false} assume !false; {7317#false} is VALID [2022-02-20 19:59:31,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {7317#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; {7317#false} is VALID [2022-02-20 19:59:31,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {7317#false} assume !false; {7317#false} is VALID [2022-02-20 19:59:31,612 INFO L272 TraceCheckUtils]: 47: Hoare triple {7317#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7316#true} is VALID [2022-02-20 19:59:31,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {7316#true} havoc ~__retres1~2; {7316#true} is VALID [2022-02-20 19:59:31,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {7316#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7316#true} is VALID [2022-02-20 19:59:31,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {7316#true} #res := ~__retres1~2; {7316#true} is VALID [2022-02-20 19:59:31,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {7316#true} assume true; {7316#true} is VALID [2022-02-20 19:59:31,613 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7316#true} {7317#false} #2005#return; {7317#false} is VALID [2022-02-20 19:59:31,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {7317#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; {7317#false} is VALID [2022-02-20 19:59:31,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {7317#false} assume 0 != eval1_~tmp___1~0#1; {7317#false} is VALID [2022-02-20 19:59:31,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {7317#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; {7317#false} is VALID [2022-02-20 19:59:31,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {7317#false} assume !(0 != eval1_~tmp~2#1); {7317#false} is VALID [2022-02-20 19:59:31,614 INFO L272 TraceCheckUtils]: 57: Hoare triple {7317#false} call error1(); {7317#false} is VALID [2022-02-20 19:59:31,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {7317#false} assume !false; {7317#false} is VALID [2022-02-20 19:59:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:31,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:31,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419734575] [2022-02-20 19:59:31,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419734575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:31,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108362838] [2022-02-20 19:59:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:59:31,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:31,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:31,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:31,655 INFO L87 Difference]: Start difference. First operand 600 states and 905 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:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:38,109 INFO L93 Difference]: Finished difference Result 1514 states and 2134 transitions. [2022-02-20 19:59:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:38,109 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:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:38,110 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:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1454 transitions. [2022-02-20 19:59:38,126 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:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1454 transitions. [2022-02-20 19:59:38,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1454 transitions. [2022-02-20 19:59:39,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1454 edges. 1454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:39,352 INFO L225 Difference]: With dead ends: 1514 [2022-02-20 19:59:39,352 INFO L226 Difference]: Without dead ends: 1319 [2022-02-20 19:59:39,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:39,355 INFO L933 BasicCegarLoop]: 870 mSDtfsCounter, 4255 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4271 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:39,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4271 Valid, 2724 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:59:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-02-20 19:59:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1181. [2022-02-20 19:59:39,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:39,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1319 states. Second operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:59:39,428 INFO L74 IsIncluded]: Start isIncluded. First operand 1319 states. Second operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:59:39,431 INFO L87 Difference]: Start difference. First operand 1319 states. Second operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:59:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,521 INFO L93 Difference]: Finished difference Result 1319 states and 1801 transitions. [2022-02-20 19:59:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1801 transitions. [2022-02-20 19:59:39,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:39,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:39,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1319 states. [2022-02-20 19:59:39,532 INFO L87 Difference]: Start difference. First operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) Second operand 1319 states. [2022-02-20 19:59:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,621 INFO L93 Difference]: Finished difference Result 1319 states and 1801 transitions. [2022-02-20 19:59:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1801 transitions. [2022-02-20 19:59:39,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:39,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:39,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:39,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 984 states have (on average 1.4329268292682926) internal successors, (1410), 999 states have internal predecessors, (1410), 110 states have call successors, (110), 74 states have call predecessors, (110), 85 states have return successors, (125), 109 states have call predecessors, (125), 107 states have call successors, (125) [2022-02-20 19:59:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1645 transitions. [2022-02-20 19:59:39,727 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1645 transitions. Word has length 59 [2022-02-20 19:59:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:39,728 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 1645 transitions. [2022-02-20 19:59:39,728 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:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1645 transitions. [2022-02-20 19:59:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:39,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:39,729 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:39,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:39,730 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1030484269, now seen corresponding path program 1 times [2022-02-20 19:59:39,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:39,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327007959] [2022-02-20 19:59:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {13707#(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); {13668#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13668#true} {13668#true} #1997#return; {13668#true} is VALID [2022-02-20 19:59:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#(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); {13668#true} is VALID [2022-02-20 19:59:39,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume !(0 == ~q_write_ev~0); {13668#true} is VALID [2022-02-20 19:59:39,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13668#true} {13668#true} #1999#return; {13668#true} is VALID [2022-02-20 19:59:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {13668#true} havoc ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume !(1 == ~p_dw_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} ~__retres1~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {13668#true} #res := ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,886 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13668#true} {13668#true} #1993#return; {13668#true} is VALID [2022-02-20 19:59:39,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {13668#true} havoc ~__retres1~1; {13668#true} is VALID [2022-02-20 19:59:39,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume !(1 == ~c_dr_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} ~__retres1~1 := 0; {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:39,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,936 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13668#true} #1995#return; {13722#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:39,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {13709#(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; {13668#true} is VALID [2022-02-20 19:59:39,937 INFO L272 TraceCheckUtils]: 1: Hoare triple {13668#true} call #t~ret8 := is_do_write_p_triggered(); {13668#true} is VALID [2022-02-20 19:59:39,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} havoc ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {13668#true} assume !(1 == ~p_dw_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {13668#true} ~__retres1~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {13668#true} #res := ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,938 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13668#true} {13668#true} #1993#return; {13668#true} is VALID [2022-02-20 19:59:39,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {13668#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13668#true} is VALID [2022-02-20 19:59:39,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {13668#true} assume !(0 != ~tmp~1); {13668#true} is VALID [2022-02-20 19:59:39,939 INFO L272 TraceCheckUtils]: 10: Hoare triple {13668#true} call #t~ret9 := is_do_read_c_triggered(); {13668#true} is VALID [2022-02-20 19:59:39,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {13668#true} havoc ~__retres1~1; {13668#true} is VALID [2022-02-20 19:59:39,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {13668#true} assume !(1 == ~c_dr_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {13668#true} ~__retres1~1 := 0; {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:39,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,941 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13668#true} #1995#return; {13722#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:39,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {13722#(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; {13723#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:39,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {13723#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13669#false} is VALID [2022-02-20 19:59:39,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {13669#false} assume true; {13669#false} is VALID [2022-02-20 19:59:39,942 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13669#false} {13668#true} #2001#return; {13669#false} is VALID [2022-02-20 19:59:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#(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); {13668#true} is VALID [2022-02-20 19:59:39,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13668#true} is VALID [2022-02-20 19:59:39,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13668#true} {13669#false} #2003#return; {13669#false} is VALID [2022-02-20 19:59:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {13668#true} havoc ~__retres1~2; {13668#true} is VALID [2022-02-20 19:59:39,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13668#true} is VALID [2022-02-20 19:59:39,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} #res := ~__retres1~2; {13668#true} is VALID [2022-02-20 19:59:39,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,954 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13668#true} {13669#false} #2005#return; {13669#false} is VALID [2022-02-20 19:59:39,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {13668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {13668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {13668#true} is VALID [2022-02-20 19:59:39,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {13668#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {13668#true} is VALID [2022-02-20 19:59:39,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {13668#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; {13668#true} is VALID [2022-02-20 19:59:39,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {13668#true} call update_channels1(); {13707#(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:39,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {13707#(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); {13668#true} is VALID [2022-02-20 19:59:39,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,964 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13668#true} {13668#true} #1997#return; {13668#true} is VALID [2022-02-20 19:59:39,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {13668#true} assume { :begin_inline_init_threads1 } true; {13668#true} is VALID [2022-02-20 19:59:39,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {13668#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {13668#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {13668#true} assume { :end_inline_init_threads1 } true; {13668#true} is VALID [2022-02-20 19:59:39,966 INFO L272 TraceCheckUtils]: 12: Hoare triple {13668#true} call fire_delta_events1(); {13708#(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:39,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {13708#(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); {13668#true} is VALID [2022-02-20 19:59:39,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {13668#true} assume !(0 == ~q_write_ev~0); {13668#true} is VALID [2022-02-20 19:59:39,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,968 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13668#true} {13668#true} #1999#return; {13668#true} is VALID [2022-02-20 19:59:39,969 INFO L272 TraceCheckUtils]: 17: Hoare triple {13668#true} call activate_threads1(); {13709#(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:39,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {13709#(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; {13668#true} is VALID [2022-02-20 19:59:39,969 INFO L272 TraceCheckUtils]: 19: Hoare triple {13668#true} call #t~ret8 := is_do_write_p_triggered(); {13668#true} is VALID [2022-02-20 19:59:39,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {13668#true} havoc ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {13668#true} assume !(1 == ~p_dw_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {13668#true} ~__retres1~0 := 0; {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {13668#true} #res := ~__retres1~0; {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13668#true} {13668#true} #1993#return; {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {13668#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13668#true} is VALID [2022-02-20 19:59:39,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {13668#true} assume !(0 != ~tmp~1); {13668#true} is VALID [2022-02-20 19:59:39,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {13668#true} call #t~ret9 := is_do_read_c_triggered(); {13668#true} is VALID [2022-02-20 19:59:39,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {13668#true} havoc ~__retres1~1; {13668#true} is VALID [2022-02-20 19:59:39,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {13668#true} assume !(1 == ~c_dr_pc~0); {13668#true} is VALID [2022-02-20 19:59:39,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {13668#true} ~__retres1~1 := 0; {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:39,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {13724#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:39,973 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13725#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {13668#true} #1995#return; {13722#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:39,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {13722#(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; {13723#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:39,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {13723#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13669#false} is VALID [2022-02-20 19:59:39,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {13669#false} assume true; {13669#false} is VALID [2022-02-20 19:59:39,974 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13669#false} {13668#true} #2001#return; {13669#false} is VALID [2022-02-20 19:59:39,974 INFO L272 TraceCheckUtils]: 39: Hoare triple {13669#false} call reset_delta_events1(); {13708#(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:39,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {13708#(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); {13668#true} is VALID [2022-02-20 19:59:39,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {13668#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13668#true} is VALID [2022-02-20 19:59:39,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,975 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13668#true} {13669#false} #2003#return; {13669#false} is VALID [2022-02-20 19:59:39,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {13669#false} assume !false; {13669#false} is VALID [2022-02-20 19:59:39,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {13669#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; {13669#false} is VALID [2022-02-20 19:59:39,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {13669#false} assume !false; {13669#false} is VALID [2022-02-20 19:59:39,976 INFO L272 TraceCheckUtils]: 47: Hoare triple {13669#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13668#true} is VALID [2022-02-20 19:59:39,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {13668#true} havoc ~__retres1~2; {13668#true} is VALID [2022-02-20 19:59:39,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {13668#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13668#true} is VALID [2022-02-20 19:59:39,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {13668#true} #res := ~__retres1~2; {13668#true} is VALID [2022-02-20 19:59:39,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {13668#true} assume true; {13668#true} is VALID [2022-02-20 19:59:39,976 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13668#true} {13669#false} #2005#return; {13669#false} is VALID [2022-02-20 19:59:39,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {13669#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; {13669#false} is VALID [2022-02-20 19:59:39,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {13669#false} assume 0 != eval1_~tmp___1~0#1; {13669#false} is VALID [2022-02-20 19:59:39,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {13669#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; {13669#false} is VALID [2022-02-20 19:59:39,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {13669#false} assume !(0 != eval1_~tmp~2#1); {13669#false} is VALID [2022-02-20 19:59:39,977 INFO L272 TraceCheckUtils]: 57: Hoare triple {13669#false} call error1(); {13669#false} is VALID [2022-02-20 19:59:39,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {13669#false} assume !false; {13669#false} is VALID [2022-02-20 19:59:39,978 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:39,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:39,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327007959] [2022-02-20 19:59:39,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327007959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:39,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:39,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:39,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683378181] [2022-02-20 19:59:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:39,979 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:39,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:39,981 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:40,017 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:40,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:40,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:40,019 INFO L87 Difference]: Start difference. First operand 1181 states and 1645 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:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,283 INFO L93 Difference]: Finished difference Result 2063 states and 2789 transitions. [2022-02-20 19:59:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:44,284 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:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:44,284 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:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 926 transitions. [2022-02-20 19:59:44,292 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:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 926 transitions. [2022-02-20 19:59:44,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 926 transitions. [2022-02-20 19:59:45,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 926 edges. 926 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,137 INFO L225 Difference]: With dead ends: 2063 [2022-02-20 19:59:45,137 INFO L226 Difference]: Without dead ends: 1293 [2022-02-20 19:59:45,138 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:45,140 INFO L933 BasicCegarLoop]: 753 mSDtfsCounter, 690 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:45,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 3333 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:59:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-02-20 19:59:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1201. [2022-02-20 19:59:45,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:45,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1293 states. Second operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:59:45,210 INFO L74 IsIncluded]: Start isIncluded. First operand 1293 states. Second operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:59:45,212 INFO L87 Difference]: Start difference. First operand 1293 states. Second operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:59:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,298 INFO L93 Difference]: Finished difference Result 1293 states and 1772 transitions. [2022-02-20 19:59:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1772 transitions. [2022-02-20 19:59:45,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1293 states. [2022-02-20 19:59:45,321 INFO L87 Difference]: Start difference. First operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) Second operand 1293 states. [2022-02-20 19:59:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,412 INFO L93 Difference]: Finished difference Result 1293 states and 1772 transitions. [2022-02-20 19:59:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1772 transitions. [2022-02-20 19:59:45,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:45,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1000 states have (on average 1.421) internal successors, (1421), 1015 states have internal predecessors, (1421), 110 states have call successors, (110), 74 states have call predecessors, (110), 89 states have return successors, (129), 113 states have call predecessors, (129), 107 states have call successors, (129) [2022-02-20 19:59:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1660 transitions. [2022-02-20 19:59:45,525 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1660 transitions. Word has length 59 [2022-02-20 19:59:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:45,526 INFO L470 AbstractCegarLoop]: Abstraction has 1201 states and 1660 transitions. [2022-02-20 19:59:45,526 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:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1660 transitions. [2022-02-20 19:59:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:45,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:45,528 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:45,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:45,529 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash -774954065, now seen corresponding path program 1 times [2022-02-20 19:59:45,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:45,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391665610] [2022-02-20 19:59:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {20714#(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); {20715#(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:45,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20715#(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:45,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #1997#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {20715#(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); {20715#(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:45,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {20715#(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); {20715#(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:45,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20715#(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:45,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #1999#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {20674#true} havoc ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {20674#true} assume !(1 == ~p_dw_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {20674#true} ~__retres1~0 := 0; {20674#true} is VALID [2022-02-20 19:59:45,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {20674#true} #res := ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,622 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20674#true} {20674#true} #1993#return; {20674#true} is VALID [2022-02-20 19:59:45,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {20674#true} havoc ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {20674#true} assume !(1 == ~c_dr_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {20674#true} ~__retres1~1 := 0; {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {20674#true} #res := ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20674#true} {20674#true} #1995#return; {20674#true} is VALID [2022-02-20 19:59:45,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {20716#(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; {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L272 TraceCheckUtils]: 1: Hoare triple {20674#true} call #t~ret8 := is_do_write_p_triggered(); {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {20674#true} havoc ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {20674#true} assume !(1 == ~p_dw_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {20674#true} ~__retres1~0 := 0; {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {20674#true} #res := ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,628 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20674#true} {20674#true} #1993#return; {20674#true} is VALID [2022-02-20 19:59:45,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {20674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20674#true} is VALID [2022-02-20 19:59:45,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {20674#true} assume !(0 != ~tmp~1); {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L272 TraceCheckUtils]: 10: Hoare triple {20674#true} call #t~ret9 := is_do_read_c_triggered(); {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {20674#true} havoc ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {20674#true} assume !(1 == ~c_dr_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {20674#true} ~__retres1~1 := 0; {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {20674#true} #res := ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,630 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20674#true} {20674#true} #1995#return; {20674#true} is VALID [2022-02-20 19:59:45,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {20674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20674#true} is VALID [2022-02-20 19:59:45,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {20674#true} assume !(0 != ~tmp___0~1); {20674#true} is VALID [2022-02-20 19:59:45,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,631 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20674#true} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #2001#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {20715#(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); {20729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:45,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {20729#(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; {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #2003#return; {20675#false} is VALID [2022-02-20 19:59:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {20674#true} havoc ~__retres1~2; {20674#true} is VALID [2022-02-20 19:59:45,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {20674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20674#true} is VALID [2022-02-20 19:59:45,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {20674#true} #res := ~__retres1~2; {20674#true} is VALID [2022-02-20 19:59:45,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,659 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20674#true} {20675#false} #2005#return; {20675#false} is VALID [2022-02-20 19:59:45,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {20674#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~t13_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~t13_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~t13_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~T13_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~E_13~0 := 2;~token~0 := 0;~local~0 := 0; {20674#true} is VALID [2022-02-20 19:59:45,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {20674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {20674#true} is VALID [2022-02-20 19:59:45,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {20674#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {20676#(= ~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; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {20714#(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:45,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {20714#(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); {20715#(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:45,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20715#(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:45,663 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #1997#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,665 INFO L272 TraceCheckUtils]: 12: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {20715#(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:45,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {20715#(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); {20715#(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:45,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {20715#(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); {20715#(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:45,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {20715#(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:45,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #1999#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,667 INFO L272 TraceCheckUtils]: 17: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {20716#(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:45,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {20716#(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; {20674#true} is VALID [2022-02-20 19:59:45,667 INFO L272 TraceCheckUtils]: 19: Hoare triple {20674#true} call #t~ret8 := is_do_write_p_triggered(); {20674#true} is VALID [2022-02-20 19:59:45,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {20674#true} havoc ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {20674#true} assume !(1 == ~p_dw_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {20674#true} ~__retres1~0 := 0; {20674#true} is VALID [2022-02-20 19:59:45,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {20674#true} #res := ~__retres1~0; {20674#true} is VALID [2022-02-20 19:59:45,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,671 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20674#true} {20674#true} #1993#return; {20674#true} is VALID [2022-02-20 19:59:45,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {20674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20674#true} is VALID [2022-02-20 19:59:45,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {20674#true} assume !(0 != ~tmp~1); {20674#true} is VALID [2022-02-20 19:59:45,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {20674#true} call #t~ret9 := is_do_read_c_triggered(); {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {20674#true} havoc ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {20674#true} assume !(1 == ~c_dr_pc~0); {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {20674#true} ~__retres1~1 := 0; {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {20674#true} #res := ~__retres1~1; {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20674#true} {20674#true} #1995#return; {20674#true} is VALID [2022-02-20 19:59:45,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {20674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20674#true} is VALID [2022-02-20 19:59:45,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {20674#true} assume !(0 != ~tmp___0~1); {20674#true} is VALID [2022-02-20 19:59:45,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,673 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20674#true} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #2001#return; {20676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,674 INFO L272 TraceCheckUtils]: 39: Hoare triple {20676#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {20715#(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:45,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {20715#(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); {20729#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:45,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {20729#(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; {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,675 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {20730#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {20676#(= ~q_write_ev~0 ~q_read_ev~0)} #2003#return; {20675#false} is VALID [2022-02-20 19:59:45,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {20675#false} assume !false; {20675#false} is VALID [2022-02-20 19:59:45,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {20675#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; {20675#false} is VALID [2022-02-20 19:59:45,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {20675#false} assume !false; {20675#false} is VALID [2022-02-20 19:59:45,676 INFO L272 TraceCheckUtils]: 47: Hoare triple {20675#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20674#true} is VALID [2022-02-20 19:59:45,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {20674#true} havoc ~__retres1~2; {20674#true} is VALID [2022-02-20 19:59:45,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {20674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20674#true} is VALID [2022-02-20 19:59:45,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {20674#true} #res := ~__retres1~2; {20674#true} is VALID [2022-02-20 19:59:45,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {20674#true} assume true; {20674#true} is VALID [2022-02-20 19:59:45,677 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20674#true} {20675#false} #2005#return; {20675#false} is VALID [2022-02-20 19:59:45,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {20675#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; {20675#false} is VALID [2022-02-20 19:59:45,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {20675#false} assume 0 != eval1_~tmp___1~0#1; {20675#false} is VALID [2022-02-20 19:59:45,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {20675#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; {20675#false} is VALID [2022-02-20 19:59:45,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {20675#false} assume !(0 != eval1_~tmp~2#1); {20675#false} is VALID [2022-02-20 19:59:45,678 INFO L272 TraceCheckUtils]: 57: Hoare triple {20675#false} call error1(); {20675#false} is VALID [2022-02-20 19:59:45,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {20675#false} assume !false; {20675#false} is VALID [2022-02-20 19:59:45,678 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:45,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:45,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391665610] [2022-02-20 19:59:45,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391665610] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:45,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:45,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:45,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069367496] [2022-02-20 19:59:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:45,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:45,682 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:45,719 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:45,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:45,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:45,720 INFO L87 Difference]: Start difference. First operand 1201 states and 1660 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:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,930 INFO L93 Difference]: Finished difference Result 2771 states and 3609 transitions. [2022-02-20 19:59:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:49,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1093 transitions. [2022-02-20 19:59:49,947 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:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1093 transitions. [2022-02-20 19:59:49,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1093 transitions. [2022-02-20 19:59:50,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1093 edges. 1093 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,978 INFO L225 Difference]: With dead ends: 2771 [2022-02-20 19:59:50,978 INFO L226 Difference]: Without dead ends: 1982 [2022-02-20 19:59:50,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:50,981 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1518 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:50,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 2580 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:59:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2022-02-20 19:59:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1649. [2022-02-20 19:59:51,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1982 states. Second operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:51,087 INFO L74 IsIncluded]: Start isIncluded. First operand 1982 states. Second operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:51,090 INFO L87 Difference]: Start difference. First operand 1982 states. Second operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,281 INFO L93 Difference]: Finished difference Result 1982 states and 2585 transitions. [2022-02-20 19:59:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2585 transitions. [2022-02-20 19:59:51,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1982 states. [2022-02-20 19:59:51,293 INFO L87 Difference]: Start difference. First operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) Second operand 1982 states. [2022-02-20 19:59:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,493 INFO L93 Difference]: Finished difference Result 1982 states and 2585 transitions. [2022-02-20 19:59:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2585 transitions. [2022-02-20 19:59:51,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1353 states have (on average 1.3821138211382114) internal successors, (1870), 1377 states have internal predecessors, (1870), 156 states have call successors, (156), 113 states have call predecessors, (156), 138 states have return successors, (201), 161 states have call predecessors, (201), 153 states have call successors, (201) [2022-02-20 19:59:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2227 transitions. [2022-02-20 19:59:51,692 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2227 transitions. Word has length 59 [2022-02-20 19:59:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,692 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2227 transitions. [2022-02-20 19:59:51,693 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:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2227 transitions. [2022-02-20 19:59:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:51,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:51,694 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1525868525, now seen corresponding path program 1 times [2022-02-20 19:59:51,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:51,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581829139] [2022-02-20 19:59:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:51,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:51,795 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:51,796 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:51,796 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:51,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:51,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:51,801 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,803 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:51,881 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:51,882 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:51,886 INFO L158 Benchmark]: Toolchain (without parser) took 34627.82ms. Allocated memory was 98.6MB in the beginning and 180.4MB in the end (delta: 81.8MB). Free memory was 63.3MB in the beginning and 50.1MB in the end (delta: 13.2MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,886 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:51,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.54ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 57.6MB in the end (delta: 5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.43ms. Allocated memory is still 98.6MB. Free memory was 57.2MB in the beginning and 50.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,889 INFO L158 Benchmark]: Boogie Preprocessor took 74.52ms. Allocated memory is still 98.6MB. Free memory was 50.9MB in the beginning and 45.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,890 INFO L158 Benchmark]: RCFGBuilder took 1267.84ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 45.7MB in the beginning and 86.9MB in the end (delta: -41.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,890 INFO L158 Benchmark]: TraceAbstraction took 32613.29ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 86.1MB in the beginning and 50.1MB in the end (delta: 36.0MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:51,892 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.21ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.54ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 57.6MB in the end (delta: 5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.43ms. Allocated memory is still 98.6MB. Free memory was 57.2MB in the beginning and 50.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.52ms. Allocated memory is still 98.6MB. Free memory was 50.9MB in the beginning and 45.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1267.84ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 45.7MB in the beginning and 86.9MB in the end (delta: -41.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32613.29ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 86.1MB in the beginning and 50.1MB in the end (delta: 36.0MB). Peak memory consumption was 97.5MB. 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:51,927 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.13.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 e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:53,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:53,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:53,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:53,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:53,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:53,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:53,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:53,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:53,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:53,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:53,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:53,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:53,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:53,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:53,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:53,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:53,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:53,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:53,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:53,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:53,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:53,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:53,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:53,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:53,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:53,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:53,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:53,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:53,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:53,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:53,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:53,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:53,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:53,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:53,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:53,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:53,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:53,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:53,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:53,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:53,908 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:53,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:53,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:53,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:53,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:53,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:53,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:53,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:53,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:53,952 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:53,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:53,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:53,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:53,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:53,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:53,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:53,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:53,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:53,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:53,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:53,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:53,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:53,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:53,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:53,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:53,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:53,956 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:53,956 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:53,957 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:53,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:53,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:53,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:53,957 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 -> e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec [2022-02-20 19:59:54,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:54,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:54,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:54,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:54,245 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:54,246 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.13.cil-2.c [2022-02-20 19:59:54,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f745ffa7/4b689cc8b71f41da834d8c2713590c0a/FLAGb6c5fd92c [2022-02-20 19:59:54,777 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:54,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2022-02-20 19:59:54,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f745ffa7/4b689cc8b71f41da834d8c2713590c0a/FLAGb6c5fd92c [2022-02-20 19:59:55,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f745ffa7/4b689cc8b71f41da834d8c2713590c0a [2022-02-20 19:59:55,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:55,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:55,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:55,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:55,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:55,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:55" (1/1) ... [2022-02-20 19:59:55,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404023ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:55, skipping insertion in model container [2022-02-20 19:59:55,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:55" (1/1) ... [2022-02-20 19:59:55,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:55,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:55,306 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.13.cil-2.c[914,927] [2022-02-20 19:59:55,391 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.13.cil-2.c[7125,7138] [2022-02-20 19:59:55,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:55,555 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:55,567 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.13.cil-2.c[914,927] [2022-02-20 19:59:55,591 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.13.cil-2.c[7125,7138] [2022-02-20 19:59:55,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:55,712 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:55,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:55 WrapperNode [2022-02-20 19:59:55,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:55,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:55,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:55,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:55,725 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:55" (1/1) ... [2022-02-20 19:59:55,745 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:55" (1/1) ... [2022-02-20 19:59:55,826 INFO L137 Inliner]: procedures = 80, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1058 [2022-02-20 19:59:55,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:55,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:55,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:55,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:55,836 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:55" (1/1) ... [2022-02-20 19:59:55,836 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:55" (1/1) ... [2022-02-20 19:59:55,843 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:55" (1/1) ... [2022-02-20 19:59:55,843 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:55" (1/1) ... [2022-02-20 19:59:55,862 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:55" (1/1) ... [2022-02-20 19:59:55,894 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:55" (1/1) ... [2022-02-20 19:59:55,905 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:55" (1/1) ... [2022-02-20 19:59:55,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:55,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:55,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:55,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:55,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:55" (1/1) ... [2022-02-20 19:59:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:55,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:55,985 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:56,007 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:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:56,026 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:56,026 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:56,026 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:56,027 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:56,027 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:56,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:56,027 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:56,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:56,027 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:56,029 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:56,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:56,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:56,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:56,030 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:56,200 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:56,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:57,061 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:57,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:57,073 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-02-20 19:59:57,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:57 BoogieIcfgContainer [2022-02-20 19:59:57,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:57,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:57,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:57,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:57,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:55" (1/3) ... [2022-02-20 19:59:57,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddc2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:57, skipping insertion in model container [2022-02-20 19:59:57,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:55" (2/3) ... [2022-02-20 19:59:57,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddc2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:57, skipping insertion in model container [2022-02-20 19:59:57,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:57" (3/3) ... [2022-02-20 19:59:57,081 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2022-02-20 19:59:57,085 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:57,085 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:57,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:57,131 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:57,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 509 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 457 states have internal predecessors, (740), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:59:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:57,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:57,184 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:57,184 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 964749711, now seen corresponding path program 1 times [2022-02-20 19:59:57,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:57,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541895788] [2022-02-20 19:59:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:57,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:57,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:57,215 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:57,239 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:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:57,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~t13_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~t13_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~t13_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~T13_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~E_13~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {512#true} is VALID [2022-02-20 19:59:57,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1; {512#true} is VALID [2022-02-20 19:59:57,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume 0bv32 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {523#(= (_ 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; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,688 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {523#(= (_ bv2 32) ~q_read_ev~0)} #1997#return; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {523#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,690 INFO L272 TraceCheckUtils]: 12: Hoare triple {523#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {558#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:57,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {558#(= |old(~q_read_ev~0)| (_ bv0 32))} assume !(0bv32 == ~q_write_ev~0); {558#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:57,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {558#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:57,693 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {558#(= |old(~q_read_ev~0)| (_ bv0 32))} {523#(= (_ bv2 32) ~q_read_ev~0)} #1999#return; {513#false} is VALID [2022-02-20 19:59:57,693 INFO L272 TraceCheckUtils]: 17: Hoare triple {513#false} call activate_threads1(); {513#false} is VALID [2022-02-20 19:59:57,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#false} havoc ~tmp~1;havoc ~tmp___0~1; {513#false} is VALID [2022-02-20 19:59:57,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {513#false} call #t~ret8 := is_do_write_p_triggered(); {513#false} is VALID [2022-02-20 19:59:57,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} havoc ~__retres1~0; {513#false} is VALID [2022-02-20 19:59:57,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#false} assume 1bv32 == ~p_dw_pc~0; {513#false} is VALID [2022-02-20 19:59:57,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {513#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {513#false} is VALID [2022-02-20 19:59:57,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {513#false} #res := ~__retres1~0; {513#false} is VALID [2022-02-20 19:59:57,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {513#false} assume true; {513#false} is VALID [2022-02-20 19:59:57,695 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {513#false} {513#false} #1993#return; {513#false} is VALID [2022-02-20 19:59:57,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {513#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {513#false} is VALID [2022-02-20 19:59:57,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {513#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {513#false} is VALID [2022-02-20 19:59:57,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {513#false} call #t~ret9 := is_do_read_c_triggered(); {513#false} is VALID [2022-02-20 19:59:57,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {513#false} havoc ~__retres1~1; {513#false} is VALID [2022-02-20 19:59:57,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {513#false} assume 1bv32 == ~c_dr_pc~0; {513#false} is VALID [2022-02-20 19:59:57,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {513#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {513#false} is VALID [2022-02-20 19:59:57,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {513#false} #res := ~__retres1~1; {513#false} is VALID [2022-02-20 19:59:57,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {513#false} assume true; {513#false} is VALID [2022-02-20 19:59:57,696 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {513#false} {513#false} #1995#return; {513#false} is VALID [2022-02-20 19:59:57,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {513#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {513#false} is VALID [2022-02-20 19:59:57,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {513#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {513#false} is VALID [2022-02-20 19:59:57,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {513#false} assume true; {513#false} is VALID [2022-02-20 19:59:57,697 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {513#false} {513#false} #2001#return; {513#false} is VALID [2022-02-20 19:59:57,697 INFO L272 TraceCheckUtils]: 39: Hoare triple {513#false} call reset_delta_events1(); {513#false} is VALID [2022-02-20 19:59:57,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {513#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {513#false} is VALID [2022-02-20 19:59:57,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {513#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {513#false} is VALID [2022-02-20 19:59:57,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {513#false} assume true; {513#false} is VALID [2022-02-20 19:59:57,698 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {513#false} {513#false} #2003#return; {513#false} is VALID [2022-02-20 19:59:57,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:57,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {513#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; {513#false} is VALID [2022-02-20 19:59:57,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:57,699 INFO L272 TraceCheckUtils]: 47: Hoare triple {513#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {513#false} is VALID [2022-02-20 19:59:57,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {513#false} havoc ~__retres1~2; {513#false} is VALID [2022-02-20 19:59:57,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {513#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {513#false} is VALID [2022-02-20 19:59:57,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {513#false} #res := ~__retres1~2; {513#false} is VALID [2022-02-20 19:59:57,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {513#false} assume true; {513#false} is VALID [2022-02-20 19:59:57,700 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {513#false} {513#false} #2005#return; {513#false} is VALID [2022-02-20 19:59:57,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {513#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {513#false} is VALID [2022-02-20 19:59:57,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {513#false} assume 0bv32 != eval1_~tmp___1~0#1; {513#false} is VALID [2022-02-20 19:59:57,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {513#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {513#false} is VALID [2022-02-20 19:59:57,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {513#false} assume !(0bv32 != eval1_~tmp~2#1); {513#false} is VALID [2022-02-20 19:59:57,701 INFO L272 TraceCheckUtils]: 57: Hoare triple {513#false} call error1(); {513#false} is VALID [2022-02-20 19:59:57,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 19:59:57,702 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:57,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:57,703 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:57,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541895788] [2022-02-20 19:59:57,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541895788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:57,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:57,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:57,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866195873] [2022-02-20 19:59:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:57,711 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:57,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:57,723 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:57,782 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:57,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:57,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:57,806 INFO L87 Difference]: Start difference. First operand has 509 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 457 states have internal predecessors, (740), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) 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 20:00:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,049 INFO L93 Difference]: Finished difference Result 1093 states and 1760 transitions. [2022-02-20 20:00:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:01,050 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 20:00:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:01,051 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 20:00:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2022-02-20 20:00:01,089 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 20:00:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2022-02-20 20:00:01,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1760 transitions. [2022-02-20 20:00:02,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:02,531 INFO L225 Difference]: With dead ends: 1093 [2022-02-20 20:00:02,532 INFO L226 Difference]: Without dead ends: 603 [2022-02-20 20:00:02,537 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 20:00:02,540 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 498 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:02,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 1947 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-02-20 20:00:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 595. [2022-02-20 20:00:02,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:02,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:02,614 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:02,615 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,654 INFO L93 Difference]: Finished difference Result 603 states and 910 transitions. [2022-02-20 20:00:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 910 transitions. [2022-02-20 20:00:02,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 603 states. [2022-02-20 20:00:02,670 INFO L87 Difference]: Start difference. First operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) Second operand 603 states. [2022-02-20 20:00:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,707 INFO L93 Difference]: Finished difference Result 603 states and 910 transitions. [2022-02-20 20:00:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 910 transitions. [2022-02-20 20:00:02,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:02,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 518 states have (on average 1.5308880308880308) internal successors, (793), 525 states have internal predecessors, (793), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-02-20 20:00:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 901 transitions. [2022-02-20 20:00:02,762 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 901 transitions. Word has length 59 [2022-02-20 20:00:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:02,762 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 901 transitions. [2022-02-20 20:00:02,763 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 20:00:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 901 transitions. [2022-02-20 20:00:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:02,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:02,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:02,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 20:00:02,977 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 20:00:02,978 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1727399342, now seen corresponding path program 1 times [2022-02-20 20:00:02,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:02,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086511799] [2022-02-20 20:00:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:02,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:02,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:02,981 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 20:00:02,983 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 20:00:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 20:00:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:03,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:03,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {4120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~t13_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~t13_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~t13_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~T13_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~E_13~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {4120#true} is VALID [2022-02-20 20:00:03,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {4120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1; {4120#true} is VALID [2022-02-20 20:00:03,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {4120#true} assume 0bv32 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {4120#true} is VALID [2022-02-20 20:00:03,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {4120#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; {4120#true} is VALID [2022-02-20 20:00:03,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {4120#true} call update_channels1(); {4120#true} is VALID [2022-02-20 20:00:03,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4120#true} assume !(1bv32 == ~q_req_up~0); {4120#true} is VALID [2022-02-20 20:00:03,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 20:00:03,294 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4120#true} {4120#true} #1997#return; {4120#true} is VALID [2022-02-20 20:00:03,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {4120#true} assume { :begin_inline_init_threads1 } true; {4120#true} is VALID [2022-02-20 20:00:03,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {4120#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {4120#true} is VALID [2022-02-20 20:00:03,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {4120#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {4120#true} is VALID [2022-02-20 20:00:03,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {4120#true} assume { :end_inline_init_threads1 } true; {4120#true} is VALID [2022-02-20 20:00:03,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {4120#true} call fire_delta_events1(); {4120#true} is VALID [2022-02-20 20:00:03,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {4120#true} assume !(0bv32 == ~q_read_ev~0); {4120#true} is VALID [2022-02-20 20:00:03,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {4120#true} assume !(0bv32 == ~q_write_ev~0); {4120#true} is VALID [2022-02-20 20:00:03,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {4120#true} assume true; {4120#true} is VALID [2022-02-20 20:00:03,296 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4120#true} {4120#true} #1999#return; {4120#true} is VALID [2022-02-20 20:00:03,296 INFO L272 TraceCheckUtils]: 17: Hoare triple {4120#true} call activate_threads1(); {4120#true} is VALID [2022-02-20 20:00:03,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {4120#true} havoc ~tmp~1;havoc ~tmp___0~1; {4120#true} is VALID [2022-02-20 20:00:03,296 INFO L272 TraceCheckUtils]: 19: Hoare triple {4120#true} call #t~ret8 := is_do_write_p_triggered(); {4120#true} is VALID [2022-02-20 20:00:03,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {4120#true} havoc ~__retres1~0; {4120#true} is VALID [2022-02-20 20:00:03,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {4120#true} assume !(1bv32 == ~p_dw_pc~0); {4120#true} is VALID [2022-02-20 20:00:03,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {4120#true} ~__retres1~0 := 0bv32; {4191#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 20:00:03,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {4191#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {4195#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:03,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {4195#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {4195#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 20:00:03,299 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4195#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {4120#true} #1993#return; {4202#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 20:00:03,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {4202#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {4206#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 20:00:03,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {4206#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {4121#false} is VALID [2022-02-20 20:00:03,300 INFO L272 TraceCheckUtils]: 28: Hoare triple {4121#false} call #t~ret9 := is_do_read_c_triggered(); {4121#false} is VALID [2022-02-20 20:00:03,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {4121#false} havoc ~__retres1~1; {4121#false} is VALID [2022-02-20 20:00:03,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {4121#false} assume 1bv32 == ~c_dr_pc~0; {4121#false} is VALID [2022-02-20 20:00:03,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {4121#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {4121#false} is VALID [2022-02-20 20:00:03,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {4121#false} #res := ~__retres1~1; {4121#false} is VALID [2022-02-20 20:00:03,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 20:00:03,302 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4121#false} {4121#false} #1995#return; {4121#false} is VALID [2022-02-20 20:00:03,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {4121#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {4121#false} is VALID [2022-02-20 20:00:03,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {4121#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {4121#false} is VALID [2022-02-20 20:00:03,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 20:00:03,303 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4121#false} {4120#true} #2001#return; {4121#false} is VALID [2022-02-20 20:00:03,303 INFO L272 TraceCheckUtils]: 39: Hoare triple {4121#false} call reset_delta_events1(); {4121#false} is VALID [2022-02-20 20:00:03,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {4121#false} assume !(1bv32 == ~q_read_ev~0); {4121#false} is VALID [2022-02-20 20:00:03,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {4121#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {4121#false} is VALID [2022-02-20 20:00:03,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 20:00:03,304 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4121#false} {4121#false} #2003#return; {4121#false} is VALID [2022-02-20 20:00:03,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 20:00:03,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {4121#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; {4121#false} is VALID [2022-02-20 20:00:03,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 20:00:03,305 INFO L272 TraceCheckUtils]: 47: Hoare triple {4121#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4121#false} is VALID [2022-02-20 20:00:03,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {4121#false} havoc ~__retres1~2; {4121#false} is VALID [2022-02-20 20:00:03,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {4121#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {4121#false} is VALID [2022-02-20 20:00:03,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {4121#false} #res := ~__retres1~2; {4121#false} is VALID [2022-02-20 20:00:03,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {4121#false} assume true; {4121#false} is VALID [2022-02-20 20:00:03,306 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4121#false} {4121#false} #2005#return; {4121#false} is VALID [2022-02-20 20:00:03,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {4121#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {4121#false} is VALID [2022-02-20 20:00:03,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {4121#false} assume 0bv32 != eval1_~tmp___1~0#1; {4121#false} is VALID [2022-02-20 20:00:03,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {4121#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {4121#false} is VALID [2022-02-20 20:00:03,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {4121#false} assume !(0bv32 != eval1_~tmp~2#1); {4121#false} is VALID [2022-02-20 20:00:03,307 INFO L272 TraceCheckUtils]: 57: Hoare triple {4121#false} call error1(); {4121#false} is VALID [2022-02-20 20:00:03,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {4121#false} assume !false; {4121#false} is VALID [2022-02-20 20:00:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:03,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:03,308 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:03,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086511799] [2022-02-20 20:00:03,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086511799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:03,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:03,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:03,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703354361] [2022-02-20 20:00:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:03,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:03,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:03,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:03,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:03,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:03,396 INFO L87 Difference]: Start difference. First operand 595 states and 901 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,366 INFO L93 Difference]: Finished difference Result 783 states and 1158 transitions. [2022-02-20 20:00:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:00:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2022-02-20 20:00:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2022-02-20 20:00:05,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 903 transitions. [2022-02-20 20:00:06,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 903 edges. 903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:06,036 INFO L225 Difference]: With dead ends: 783 [2022-02-20 20:00:06,036 INFO L226 Difference]: Without dead ends: 605 [2022-02-20 20:00:06,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:06,038 INFO L933 BasicCegarLoop]: 767 mSDtfsCounter, 7 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:06,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3829 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 20:00:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-02-20 20:00:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 600. [2022-02-20 20:00:06,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:06,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 605 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 20:00:06,060 INFO L74 IsIncluded]: Start isIncluded. First operand 605 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 20:00:06,061 INFO L87 Difference]: Start difference. First operand 605 states. Second operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 20:00:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,094 INFO L93 Difference]: Finished difference Result 605 states and 913 transitions. [2022-02-20 20:00:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 913 transitions. [2022-02-20 20:00:06,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:06,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:06,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 605 states. [2022-02-20 20:00:06,099 INFO L87 Difference]: Start difference. First operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) Second operand 605 states. [2022-02-20 20:00:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,133 INFO L93 Difference]: Finished difference Result 605 states and 913 transitions. [2022-02-20 20:00:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 913 transitions. [2022-02-20 20:00:06,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:06,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:06,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:06,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 522 states have (on average 1.524904214559387) internal successors, (796), 529 states have internal predecessors, (796), 53 states have call successors, (53), 21 states have call predecessors, (53), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 20:00:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 905 transitions. [2022-02-20 20:00:06,174 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 905 transitions. Word has length 59 [2022-02-20 20:00:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:06,175 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 905 transitions. [2022-02-20 20:00:06,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 905 transitions. [2022-02-20 20:00:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 20:00:06,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:06,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:06,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 20:00:06,387 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 20:00:06,387 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2002158956, now seen corresponding path program 1 times [2022-02-20 20:00:06,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 20:00:06,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51835116] [2022-02-20 20:00:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 20:00:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 20:00:06,390 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 20:00:06,393 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 20:00:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 20:00:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:00:06,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {7341#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~t11_pc~0 := 0bv32;~t12_pc~0 := 0bv32;~t13_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~t11_st~0 := 0bv32;~t12_st~0 := 0bv32;~t13_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~t11_i~0 := 0bv32;~t12_i~0 := 0bv32;~t13_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~T11_E~0 := 2bv32;~T12_E~0 := 2bv32;~T13_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~E_11~0 := 2bv32;~E_12~0 := 2bv32;~E_13~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {7341#true} is VALID [2022-02-20 20:00:06,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {7341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1; {7341#true} is VALID [2022-02-20 20:00:06,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7341#true} assume 0bv32 != main_#t~nondet52#1;havoc main_#t~nondet52#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; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} call update_channels1(); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume !(1bv32 == ~q_req_up~0); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,701 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7352#(= ~c_dr_pc~0 (_ bv0 32))} {7352#(= ~c_dr_pc~0 (_ bv0 32))} #1997#return; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume { :begin_inline_init_threads1 } true; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume { :end_inline_init_threads1 } true; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} call fire_delta_events1(); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_read_ev~0); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_write_ev~0); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,705 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#(= ~c_dr_pc~0 (_ bv0 32))} {7352#(= ~c_dr_pc~0 (_ bv0 32))} #1999#return; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,706 INFO L272 TraceCheckUtils]: 17: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} call activate_threads1(); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~tmp~1;havoc ~tmp___0~1; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,707 INFO L272 TraceCheckUtils]: 19: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} call #t~ret8 := is_do_write_p_triggered(); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~__retres1~0; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume !(1bv32 == ~p_dw_pc~0); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} ~__retres1~0 := 0bv32; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} #res := ~__retres1~0; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,709 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7352#(= ~c_dr_pc~0 (_ bv0 32))} {7352#(= ~c_dr_pc~0 (_ bv0 32))} #1993#return; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} ~tmp~1 := #t~ret8;havoc #t~ret8; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 != ~tmp~1); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,711 INFO L272 TraceCheckUtils]: 28: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} call #t~ret9 := is_do_read_c_triggered(); {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~__retres1~1; {7352#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 20:00:06,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~c_dr_pc~0; {7342#false} is VALID [2022-02-20 20:00:06,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {7342#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {7342#false} is VALID [2022-02-20 20:00:06,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {7342#false} #res := ~__retres1~1; {7342#false} is VALID [2022-02-20 20:00:06,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {7342#false} assume true; {7342#false} is VALID [2022-02-20 20:00:06,712 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7342#false} {7352#(= ~c_dr_pc~0 (_ bv0 32))} #1995#return; {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {7342#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {7342#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {7342#false} assume true; {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7342#false} {7352#(= ~c_dr_pc~0 (_ bv0 32))} #2001#return; {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L272 TraceCheckUtils]: 39: Hoare triple {7342#false} call reset_delta_events1(); {7342#false} is VALID [2022-02-20 20:00:06,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {7342#false} assume !(1bv32 == ~q_read_ev~0); {7342#false} is VALID [2022-02-20 20:00:06,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {7342#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {7342#false} is VALID [2022-02-20 20:00:06,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {7342#false} assume true; {7342#false} is VALID [2022-02-20 20:00:06,714 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7342#false} {7342#false} #2003#return; {7342#false} is VALID [2022-02-20 20:00:06,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {7342#false} assume !false; {7342#false} is VALID [2022-02-20 20:00:06,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {7342#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; {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {7342#false} assume !false; {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L272 TraceCheckUtils]: 47: Hoare triple {7342#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {7342#false} havoc ~__retres1~2; {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {7342#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {7342#false} #res := ~__retres1~2; {7342#false} is VALID [2022-02-20 20:00:06,715 INFO L290 TraceCheckUtils]: 51: Hoare triple {7342#false} assume true; {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7342#false} {7342#false} #2005#return; {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {7342#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {7342#false} assume 0bv32 != eval1_~tmp___1~0#1; {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L290 TraceCheckUtils]: 55: Hoare triple {7342#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {7342#false} assume !(0bv32 != eval1_~tmp~2#1); {7342#false} is VALID [2022-02-20 20:00:06,716 INFO L272 TraceCheckUtils]: 57: Hoare triple {7342#false} call error1(); {7342#false} is VALID [2022-02-20 20:00:06,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {7342#false} assume !false; {7342#false} is VALID [2022-02-20 20:00:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:06,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:00:06,717 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 20:00:06,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51835116] [2022-02-20 20:00:06,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51835116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:06,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:06,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:00:06,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824287002] [2022-02-20 20:00:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:06,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:06,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:06,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:00:06,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 20:00:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:00:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:00:06,772 INFO L87 Difference]: Start difference. First operand 600 states and 905 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,481 INFO L93 Difference]: Finished difference Result 956 states and 1380 transitions. [2022-02-20 20:00:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:00:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 20:00:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1000 transitions. [2022-02-20 20:00:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1000 transitions. [2022-02-20 20:00:07,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1000 transitions.