./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:57,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:57,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:57,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:57,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:57,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:57,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:57,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:57,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:57,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:57,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:57,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:57,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:57,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:57,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:57,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:57,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:57,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:57,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:57,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:57,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:57,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:57,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:57,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:57,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:57,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:57,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:57,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:57,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:57,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:57,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:57,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:57,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:57,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:57,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:57,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:57,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:57,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:57,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:57,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:57,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:57,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:58:57,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:57,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:57,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:57,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:57,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:57,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:57,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:57,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:57,890 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:57,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:57,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:57,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:57,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:57,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:57,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:57,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:57,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:57,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:57,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:57,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:57,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:57,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:57,895 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 -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2022-02-20 19:58:58,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:58,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:58,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:58,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:58,093 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:58,094 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.07.cil-1.c [2022-02-20 19:58:58,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b811499f9/7f6ca031535f40dc979599a052d16567/FLAGf98d7b33a [2022-02-20 19:58:58,561 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:58,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-02-20 19:58:58,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b811499f9/7f6ca031535f40dc979599a052d16567/FLAGf98d7b33a [2022-02-20 19:58:58,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b811499f9/7f6ca031535f40dc979599a052d16567 [2022-02-20 19:58:58,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:58,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:58,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:58,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:58,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:58,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:58,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d62246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58, skipping insertion in model container [2022-02-20 19:58:58,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:58,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:58,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:58,769 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.07.cil-1.c[914,927] [2022-02-20 19:58:58,817 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.07.cil-1.c[7125,7138] [2022-02-20 19:58:58,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:58,871 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:58,878 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.07.cil-1.c[914,927] [2022-02-20 19:58:58,892 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.07.cil-1.c[7125,7138] [2022-02-20 19:58:58,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:58,939 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:58,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58 WrapperNode [2022-02-20 19:58:58,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:58,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:58,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:58,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:58,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:58,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:58,991 INFO L137 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 751 [2022-02-20 19:58:58,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:58,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:58,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:58,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:58,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:58,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:59,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:59,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:59,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:59,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (1/1) ... [2022-02-20 19:58:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:59,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:59,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:58:59,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:58:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:59,088 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:59,088 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:59,100 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:59,100 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:59,100 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:59,100 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:59,100 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:59,101 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:59,101 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:59,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:59,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:59,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:59,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:59,102 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:59,102 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:59,194 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:59,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:59,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:59,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:59,779 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 19:58:59,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:59 BoogieIcfgContainer [2022-02-20 19:58:59,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:59,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:59,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:59,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:59,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:58" (1/3) ... [2022-02-20 19:58:59,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60605a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:59, skipping insertion in model container [2022-02-20 19:58:59,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:58" (2/3) ... [2022-02-20 19:58:59,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60605a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:59, skipping insertion in model container [2022-02-20 19:58:59,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:59" (3/3) ... [2022-02-20 19:58:59,788 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-02-20 19:58:59,793 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:59,794 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:59,833 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:59,837 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:58:59,837 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 19:58:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:59,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:59,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:59,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1357445742, now seen corresponding path program 1 times [2022-02-20 19:58:59,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:59,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234992618] [2022-02-20 19:58:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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); {362#true} is VALID [2022-02-20 19:59:00,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {362#true} {364#(= ~p_dw_i~0 1)} #1325#return; {364#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:59:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(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; {362#true} is VALID [2022-02-20 19:59:00,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {362#true} is VALID [2022-02-20 19:59:00,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {362#true} {363#false} #1327#return; {363#false} is VALID [2022-02-20 19:59:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} havoc ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume !(1 == ~p_dw_pc~0); {362#true} is VALID [2022-02-20 19:59:00,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} ~__retres1~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} #res := ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,101 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {362#true} {362#true} #1321#return; {362#true} is VALID [2022-02-20 19:59:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} havoc ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume 1 == ~c_dr_pc~0; {362#true} is VALID [2022-02-20 19:59:00,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {362#true} is VALID [2022-02-20 19:59:00,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} #res := ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,122 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {362#true} {362#true} #1323#return; {362#true} is VALID [2022-02-20 19:59:00,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#(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; {362#true} is VALID [2022-02-20 19:59:00,123 INFO L272 TraceCheckUtils]: 1: Hoare triple {362#true} call #t~ret8 := is_do_write_p_triggered(); {362#true} is VALID [2022-02-20 19:59:00,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} havoc ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} assume !(1 == ~p_dw_pc~0); {362#true} is VALID [2022-02-20 19:59:00,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} ~__retres1~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#true} #res := ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,125 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {362#true} {362#true} #1321#return; {362#true} is VALID [2022-02-20 19:59:00,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {362#true} is VALID [2022-02-20 19:59:00,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,125 INFO L272 TraceCheckUtils]: 10: Hoare triple {362#true} call #t~ret9 := is_do_read_c_triggered(); {362#true} is VALID [2022-02-20 19:59:00,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#true} havoc ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#true} assume 1 == ~c_dr_pc~0; {362#true} is VALID [2022-02-20 19:59:00,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {362#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {362#true} is VALID [2022-02-20 19:59:00,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#true} #res := ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,126 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {362#true} {362#true} #1323#return; {362#true} is VALID [2022-02-20 19:59:00,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {362#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {362#true} is VALID [2022-02-20 19:59:00,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(0 != ~tmp___0~1); {362#true} is VALID [2022-02-20 19:59:00,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,128 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {362#true} {363#false} #1329#return; {363#false} is VALID [2022-02-20 19:59:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(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; {362#true} is VALID [2022-02-20 19:59:00,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {362#true} is VALID [2022-02-20 19:59:00,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {362#true} {363#false} #1331#return; {363#false} is VALID [2022-02-20 19:59:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} havoc ~__retres1~2; {362#true} is VALID [2022-02-20 19:59:00,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {362#true} is VALID [2022-02-20 19:59:00,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} #res := ~__retres1~2; {362#true} is VALID [2022-02-20 19:59:00,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,159 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {362#true} {363#false} #1333#return; {363#false} is VALID [2022-02-20 19:59:00,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {362#true} is VALID [2022-02-20 19:59:00,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {364#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:59:00,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#(= ~p_dw_i~0 1)} 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; {364#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:59:00,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {364#(= ~p_dw_i~0 1)} call update_channels1(); {402#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:00,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(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); {362#true} is VALID [2022-02-20 19:59:00,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,165 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {362#true} {364#(= ~p_dw_i~0 1)} #1325#return; {364#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:59:00,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {364#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:59:00,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {363#false} is VALID [2022-02-20 19:59:00,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {363#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {363#false} is VALID [2022-02-20 19:59:00,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {363#false} assume { :end_inline_init_threads1 } true; {363#false} is VALID [2022-02-20 19:59:00,167 INFO L272 TraceCheckUtils]: 12: Hoare triple {363#false} call fire_delta_events1(); {403#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:00,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {403#(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; {362#true} is VALID [2022-02-20 19:59:00,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {362#true} is VALID [2022-02-20 19:59:00,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {362#true} {363#false} #1327#return; {363#false} is VALID [2022-02-20 19:59:00,168 INFO L272 TraceCheckUtils]: 17: Hoare triple {363#false} call activate_threads1(); {404#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:00,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {404#(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; {362#true} is VALID [2022-02-20 19:59:00,168 INFO L272 TraceCheckUtils]: 19: Hoare triple {362#true} call #t~ret8 := is_do_write_p_triggered(); {362#true} is VALID [2022-02-20 19:59:00,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {362#true} havoc ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {362#true} assume !(1 == ~p_dw_pc~0); {362#true} is VALID [2022-02-20 19:59:00,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {362#true} ~__retres1~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {362#true} #res := ~__retres1~0; {362#true} is VALID [2022-02-20 19:59:00,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,172 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {362#true} {362#true} #1321#return; {362#true} is VALID [2022-02-20 19:59:00,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {362#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {362#true} is VALID [2022-02-20 19:59:00,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {362#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L272 TraceCheckUtils]: 28: Hoare triple {362#true} call #t~ret9 := is_do_read_c_triggered(); {362#true} is VALID [2022-02-20 19:59:00,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {362#true} havoc ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {362#true} assume 1 == ~c_dr_pc~0; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {362#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {362#true} #res := ~__retres1~1; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,173 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {362#true} {362#true} #1323#return; {362#true} is VALID [2022-02-20 19:59:00,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {362#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {362#true} is VALID [2022-02-20 19:59:00,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {362#true} assume !(0 != ~tmp___0~1); {362#true} is VALID [2022-02-20 19:59:00,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,174 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {362#true} {363#false} #1329#return; {363#false} is VALID [2022-02-20 19:59:00,175 INFO L272 TraceCheckUtils]: 39: Hoare triple {363#false} call reset_delta_events1(); {403#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:00,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {403#(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; {362#true} is VALID [2022-02-20 19:59:00,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {362#true} is VALID [2022-02-20 19:59:00,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,175 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {362#true} {363#false} #1331#return; {363#false} is VALID [2022-02-20 19:59:00,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:00,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {363#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; {363#false} is VALID [2022-02-20 19:59:00,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:00,176 INFO L272 TraceCheckUtils]: 47: Hoare triple {363#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {362#true} is VALID [2022-02-20 19:59:00,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {362#true} havoc ~__retres1~2; {362#true} is VALID [2022-02-20 19:59:00,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {362#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {362#true} is VALID [2022-02-20 19:59:00,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {362#true} #res := ~__retres1~2; {362#true} is VALID [2022-02-20 19:59:00,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {362#true} assume true; {362#true} is VALID [2022-02-20 19:59:00,177 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {362#true} {363#false} #1333#return; {363#false} is VALID [2022-02-20 19:59:00,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {363#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; {363#false} is VALID [2022-02-20 19:59:00,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {363#false} assume 0 != eval1_~tmp___1~0#1; {363#false} is VALID [2022-02-20 19:59:00,180 INFO L290 TraceCheckUtils]: 55: Hoare triple {363#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; {363#false} is VALID [2022-02-20 19:59:00,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {363#false} assume !(0 != eval1_~tmp~2#1); {363#false} is VALID [2022-02-20 19:59:00,180 INFO L272 TraceCheckUtils]: 57: Hoare triple {363#false} call error1(); {363#false} is VALID [2022-02-20 19:59:00,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:00,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:00,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234992618] [2022-02-20 19:59:00,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234992618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:00,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:00,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:00,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373916806] [2022-02-20 19:59:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:00,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:00,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:00,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:00,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:00,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:00,271 INFO L87 Difference]: Start difference. First operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:01,822 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-02-20 19:59:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:59:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2022-02-20 19:59:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2022-02-20 19:59:01,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1123 transitions. [2022-02-20 19:59:02,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1123 edges. 1123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:02,589 INFO L225 Difference]: With dead ends: 714 [2022-02-20 19:59:02,589 INFO L226 Difference]: Without dead ends: 367 [2022-02-20 19:59:02,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:02,595 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 771 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:02,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1198 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-02-20 19:59:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 349. [2022-02-20 19:59:02,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:02,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:02,636 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:02,637 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,652 INFO L93 Difference]: Finished difference Result 367 states and 550 transitions. [2022-02-20 19:59:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 550 transitions. [2022-02-20 19:59:02,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 367 states. [2022-02-20 19:59:02,658 INFO L87 Difference]: Start difference. First operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 367 states. [2022-02-20 19:59:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,672 INFO L93 Difference]: Finished difference Result 367 states and 550 transitions. [2022-02-20 19:59:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 550 transitions. [2022-02-20 19:59:02,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:02,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2022-02-20 19:59:02,689 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 59 [2022-02-20 19:59:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:02,690 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2022-02-20 19:59:02,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-02-20 19:59:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:02,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:02,692 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:02,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:02,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -876365484, now seen corresponding path program 1 times [2022-02-20 19:59:02,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:02,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160067792] [2022-02-20 19:59:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {2621#(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); {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2583#(= ~q_read_ev~0 2)} #1325#return; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {2623#(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; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#(= |old(~q_read_ev~0)| 0)} assume true; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2624#(= |old(~q_read_ev~0)| 0)} {2583#(= ~q_read_ev~0 2)} #1327#return; {2582#false} is VALID [2022-02-20 19:59:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {2581#true} havoc ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#true} assume !(1 == ~p_dw_pc~0); {2581#true} is VALID [2022-02-20 19:59:02,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} ~__retres1~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {2581#true} #res := ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,782 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2581#true} {2581#true} #1321#return; {2581#true} is VALID [2022-02-20 19:59:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {2581#true} havoc ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#true} assume 1 == ~c_dr_pc~0; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {2581#true} #res := ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2581#true} {2581#true} #1323#return; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#(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; {2581#true} is VALID [2022-02-20 19:59:02,786 INFO L272 TraceCheckUtils]: 1: Hoare triple {2581#true} call #t~ret8 := is_do_write_p_triggered(); {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} havoc ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {2581#true} assume !(1 == ~p_dw_pc~0); {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {2581#true} ~__retres1~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {2581#true} #res := ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2581#true} {2581#true} #1321#return; {2581#true} is VALID [2022-02-20 19:59:02,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {2581#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {2581#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {2581#true} call #t~ret9 := is_do_read_c_triggered(); {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#true} havoc ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2581#true} assume 1 == ~c_dr_pc~0; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {2581#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#true} #res := ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,807 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2581#true} {2581#true} #1323#return; {2581#true} is VALID [2022-02-20 19:59:02,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {2581#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2581#true} is VALID [2022-02-20 19:59:02,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {2581#true} assume !(0 != ~tmp___0~1); {2581#true} is VALID [2022-02-20 19:59:02,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,807 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2581#true} {2582#false} #1329#return; {2582#false} is VALID [2022-02-20 19:59:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {2623#(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; {2581#true} is VALID [2022-02-20 19:59:02,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2581#true} is VALID [2022-02-20 19:59:02,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2581#true} {2582#false} #1331#return; {2582#false} is VALID [2022-02-20 19:59:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {2581#true} havoc ~__retres1~2; {2581#true} is VALID [2022-02-20 19:59:02,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2581#true} is VALID [2022-02-20 19:59:02,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} #res := ~__retres1~2; {2581#true} is VALID [2022-02-20 19:59:02,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,816 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2581#true} {2582#false} #1333#return; {2582#false} is VALID [2022-02-20 19:59:02,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {2581#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {2581#true} is VALID [2022-02-20 19:59:02,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {2581#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {2583#(= ~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; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {2583#(= ~q_read_ev~0 2)} call update_channels1(); {2621#(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:02,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2621#(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); {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,819 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2622#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2583#(= ~q_read_ev~0 2)} #1325#return; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2583#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2583#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {2583#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {2583#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2583#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:02,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {2583#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2623#(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:02,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {2623#(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; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {2624#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {2624#(= |old(~q_read_ev~0)| 0)} assume true; {2624#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:02,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2624#(= |old(~q_read_ev~0)| 0)} {2583#(= ~q_read_ev~0 2)} #1327#return; {2582#false} is VALID [2022-02-20 19:59:02,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {2582#false} call activate_threads1(); {2625#(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:02,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(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; {2581#true} is VALID [2022-02-20 19:59:02,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {2581#true} call #t~ret8 := is_do_write_p_triggered(); {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {2581#true} havoc ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {2581#true} assume !(1 == ~p_dw_pc~0); {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {2581#true} ~__retres1~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {2581#true} #res := ~__retres1~0; {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2581#true} {2581#true} #1321#return; {2581#true} is VALID [2022-02-20 19:59:02,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {2581#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {2581#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L272 TraceCheckUtils]: 28: Hoare triple {2581#true} call #t~ret9 := is_do_read_c_triggered(); {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {2581#true} havoc ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {2581#true} assume 1 == ~c_dr_pc~0; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {2581#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {2581#true} #res := ~__retres1~1; {2581#true} is VALID [2022-02-20 19:59:02,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,825 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2581#true} {2581#true} #1323#return; {2581#true} is VALID [2022-02-20 19:59:02,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {2581#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2581#true} is VALID [2022-02-20 19:59:02,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {2581#true} assume !(0 != ~tmp___0~1); {2581#true} is VALID [2022-02-20 19:59:02,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,825 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2581#true} {2582#false} #1329#return; {2582#false} is VALID [2022-02-20 19:59:02,825 INFO L272 TraceCheckUtils]: 39: Hoare triple {2582#false} call reset_delta_events1(); {2623#(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:02,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {2623#(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; {2581#true} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {2581#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2581#true} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,826 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2581#true} {2582#false} #1331#return; {2582#false} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {2582#false} assume !false; {2582#false} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {2582#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; {2582#false} is VALID [2022-02-20 19:59:02,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {2582#false} assume !false; {2582#false} is VALID [2022-02-20 19:59:02,826 INFO L272 TraceCheckUtils]: 47: Hoare triple {2582#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2581#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {2581#true} havoc ~__retres1~2; {2581#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {2581#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2581#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {2581#true} #res := ~__retres1~2; {2581#true} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {2581#true} assume true; {2581#true} is VALID [2022-02-20 19:59:02,827 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2581#true} {2582#false} #1333#return; {2582#false} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {2582#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; {2582#false} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {2582#false} assume 0 != eval1_~tmp___1~0#1; {2582#false} is VALID [2022-02-20 19:59:02,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {2582#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; {2582#false} is VALID [2022-02-20 19:59:02,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {2582#false} assume !(0 != eval1_~tmp~2#1); {2582#false} is VALID [2022-02-20 19:59:02,828 INFO L272 TraceCheckUtils]: 57: Hoare triple {2582#false} call error1(); {2582#false} is VALID [2022-02-20 19:59:02,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {2582#false} assume !false; {2582#false} is VALID [2022-02-20 19:59:02,828 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:02,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:02,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160067792] [2022-02-20 19:59:02,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160067792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:02,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:02,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:02,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108686661] [2022-02-20 19:59:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:02,830 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:02,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:02,831 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:02,862 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:02,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:02,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:02,863 INFO L87 Difference]: Start difference. First operand 349 states and 522 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,356 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2022-02-20 19:59:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:05,356 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:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 838 transitions. [2022-02-20 19:59:05,367 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:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 838 transitions. [2022-02-20 19:59:05,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 838 transitions. [2022-02-20 19:59:05,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 838 edges. 838 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:05,912 INFO L225 Difference]: With dead ends: 574 [2022-02-20 19:59:05,912 INFO L226 Difference]: Without dead ends: 485 [2022-02-20 19:59:05,913 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:05,913 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 642 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:05,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 1948 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-20 19:59:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 445. [2022-02-20 19:59:05,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:05,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 485 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:05,935 INFO L74 IsIncluded]: Start isIncluded. First operand 485 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:05,936 INFO L87 Difference]: Start difference. First operand 485 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,949 INFO L93 Difference]: Finished difference Result 485 states and 708 transitions. [2022-02-20 19:59:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 708 transitions. [2022-02-20 19:59:05,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:05,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:05,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 485 states. [2022-02-20 19:59:05,952 INFO L87 Difference]: Start difference. First operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 485 states. [2022-02-20 19:59:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,965 INFO L93 Difference]: Finished difference Result 485 states and 708 transitions. [2022-02-20 19:59:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 708 transitions. [2022-02-20 19:59:05,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:05,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:05,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:05,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 653 transitions. [2022-02-20 19:59:05,980 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 653 transitions. Word has length 59 [2022-02-20 19:59:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:05,981 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 653 transitions. [2022-02-20 19:59:05,981 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:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 653 transitions. [2022-02-20 19:59:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:05,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:05,982 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:05,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:05,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -637036524, now seen corresponding path program 1 times [2022-02-20 19:59:05,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:05,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708607625] [2022-02-20 19:59:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {5039#(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); {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5001#(= ~q_write_ev~0 ~q_read_ev~0)} #1325#return; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {5040#(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); {5041#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {5041#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5001#(= ~q_write_ev~0 ~q_read_ev~0)} #1327#return; {5000#false} is VALID [2022-02-20 19:59:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#true} havoc ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume !(1 == ~p_dw_pc~0); {4999#true} is VALID [2022-02-20 19:59:06,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} ~__retres1~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {4999#true} #res := ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,065 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4999#true} {4999#true} #1321#return; {4999#true} is VALID [2022-02-20 19:59:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#true} havoc ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume 1 == ~c_dr_pc~0; {4999#true} is VALID [2022-02-20 19:59:06,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4999#true} is VALID [2022-02-20 19:59:06,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {4999#true} #res := ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4999#true} {4999#true} #1323#return; {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {5043#(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; {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L272 TraceCheckUtils]: 1: Hoare triple {4999#true} call #t~ret8 := is_do_write_p_triggered(); {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} havoc ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {4999#true} assume !(1 == ~p_dw_pc~0); {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {4999#true} ~__retres1~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {4999#true} #res := ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4999#true} {4999#true} #1321#return; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {4999#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {4999#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {4999#true} call #t~ret9 := is_do_read_c_triggered(); {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {4999#true} havoc ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {4999#true} assume 1 == ~c_dr_pc~0; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {4999#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#true} #res := ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4999#true} {4999#true} #1323#return; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {4999#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {4999#true} assume !(0 != ~tmp___0~1); {4999#true} is VALID [2022-02-20 19:59:06,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,072 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4999#true} {5000#false} #1329#return; {5000#false} is VALID [2022-02-20 19:59:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {5040#(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); {4999#true} is VALID [2022-02-20 19:59:06,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4999#true} is VALID [2022-02-20 19:59:06,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {5000#false} #1331#return; {5000#false} is VALID [2022-02-20 19:59:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#true} havoc ~__retres1~2; {4999#true} is VALID [2022-02-20 19:59:06,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4999#true} is VALID [2022-02-20 19:59:06,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} #res := ~__retres1~2; {4999#true} is VALID [2022-02-20 19:59:06,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,080 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4999#true} {5000#false} #1333#return; {5000#false} is VALID [2022-02-20 19:59:06,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {4999#true} is VALID [2022-02-20 19:59:06,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {5001#(= ~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; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5039#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:06,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {5039#(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); {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,083 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5001#(= ~q_write_ev~0 ~q_read_ev~0)} #1325#return; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5001#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:06,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {5001#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {5040#(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); {5041#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {5041#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:06,086 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5042#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5001#(= ~q_write_ev~0 ~q_read_ev~0)} #1327#return; {5000#false} is VALID [2022-02-20 19:59:06,086 INFO L272 TraceCheckUtils]: 17: Hoare triple {5000#false} call activate_threads1(); {5043#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:06,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {5043#(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; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L272 TraceCheckUtils]: 19: Hoare triple {4999#true} call #t~ret8 := is_do_write_p_triggered(); {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {4999#true} havoc ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {4999#true} assume !(1 == ~p_dw_pc~0); {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {4999#true} ~__retres1~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {4999#true} #res := ~__retres1~0; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4999#true} {4999#true} #1321#return; {4999#true} is VALID [2022-02-20 19:59:06,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {4999#true} call #t~ret9 := is_do_read_c_triggered(); {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {4999#true} havoc ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {4999#true} assume 1 == ~c_dr_pc~0; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {4999#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {4999#true} #res := ~__retres1~1; {4999#true} is VALID [2022-02-20 19:59:06,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4999#true} {4999#true} #1323#return; {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {4999#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {4999#true} assume !(0 != ~tmp___0~1); {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4999#true} {5000#false} #1329#return; {5000#false} is VALID [2022-02-20 19:59:06,089 INFO L272 TraceCheckUtils]: 39: Hoare triple {5000#false} call reset_delta_events1(); {5040#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:06,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {5040#(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); {4999#true} is VALID [2022-02-20 19:59:06,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {4999#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4999#true} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,090 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4999#true} {5000#false} #1331#return; {5000#false} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {5000#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; {5000#false} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-02-20 19:59:06,090 INFO L272 TraceCheckUtils]: 47: Hoare triple {5000#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4999#true} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {4999#true} havoc ~__retres1~2; {4999#true} is VALID [2022-02-20 19:59:06,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {4999#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4999#true} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {4999#true} #res := ~__retres1~2; {4999#true} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-02-20 19:59:06,091 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4999#true} {5000#false} #1333#return; {5000#false} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {5000#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; {5000#false} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {5000#false} assume 0 != eval1_~tmp___1~0#1; {5000#false} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {5000#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; {5000#false} is VALID [2022-02-20 19:59:06,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {5000#false} assume !(0 != eval1_~tmp~2#1); {5000#false} is VALID [2022-02-20 19:59:06,092 INFO L272 TraceCheckUtils]: 57: Hoare triple {5000#false} call error1(); {5000#false} is VALID [2022-02-20 19:59:06,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-02-20 19:59:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:06,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:06,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708607625] [2022-02-20 19:59:06,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708607625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:06,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:06,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:06,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254960002] [2022-02-20 19:59:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,093 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:06,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,094 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:06,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:06,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:06,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:06,125 INFO L87 Difference]: Start difference. First operand 445 states and 653 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:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,937 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2022-02-20 19:59:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:08,938 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:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:08,938 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:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 861 transitions. [2022-02-20 19:59:08,945 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:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 861 transitions. [2022-02-20 19:59:08,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 861 transitions. [2022-02-20 19:59:09,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 861 edges. 861 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:09,545 INFO L225 Difference]: With dead ends: 794 [2022-02-20 19:59:09,545 INFO L226 Difference]: Without dead ends: 616 [2022-02-20 19:59:09,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:09,546 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 1022 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:09,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1049 Valid, 2009 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-02-20 19:59:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 541. [2022-02-20 19:59:09,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:09,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:59:09,566 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:59:09,567 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:59:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,584 INFO L93 Difference]: Finished difference Result 616 states and 890 transitions. [2022-02-20 19:59:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 890 transitions. [2022-02-20 19:59:09,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:09,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:09,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 616 states. [2022-02-20 19:59:09,588 INFO L87 Difference]: Start difference. First operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 616 states. [2022-02-20 19:59:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,605 INFO L93 Difference]: Finished difference Result 616 states and 890 transitions. [2022-02-20 19:59:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 890 transitions. [2022-02-20 19:59:09,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:09,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:09,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:09,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:59:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 786 transitions. [2022-02-20 19:59:09,624 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 786 transitions. Word has length 59 [2022-02-20 19:59:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:09,625 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 786 transitions. [2022-02-20 19:59:09,625 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:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 786 transitions. [2022-02-20 19:59:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:09,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:09,626 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:09,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:09,626 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 256449814, now seen corresponding path program 1 times [2022-02-20 19:59:09,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:09,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178824656] [2022-02-20 19:59:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {8147#(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); {8108#true} is VALID [2022-02-20 19:59:09,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8108#true} {8108#true} #1325#return; {8108#true} is VALID [2022-02-20 19:59:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {8148#(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); {8108#true} is VALID [2022-02-20 19:59:09,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume !(0 == ~q_write_ev~0); {8108#true} is VALID [2022-02-20 19:59:09,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8108#true} {8108#true} #1327#return; {8108#true} is VALID [2022-02-20 19:59:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {8108#true} havoc ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume !(1 == ~p_dw_pc~0); {8108#true} is VALID [2022-02-20 19:59:09,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} ~__retres1~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {8108#true} #res := ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,699 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8108#true} {8108#true} #1321#return; {8108#true} is VALID [2022-02-20 19:59:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {8108#true} havoc ~__retres1~1; {8108#true} is VALID [2022-02-20 19:59:09,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume 1 == ~c_dr_pc~0; {8108#true} is VALID [2022-02-20 19:59:09,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:59:09,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {8165#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,717 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8165#(<= 1 |is_do_read_c_triggered_#res|)} {8108#true} #1323#return; {8162#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:09,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {8149#(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; {8108#true} is VALID [2022-02-20 19:59:09,717 INFO L272 TraceCheckUtils]: 1: Hoare triple {8108#true} call #t~ret8 := is_do_write_p_triggered(); {8108#true} is VALID [2022-02-20 19:59:09,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} havoc ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {8108#true} assume !(1 == ~p_dw_pc~0); {8108#true} is VALID [2022-02-20 19:59:09,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {8108#true} ~__retres1~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {8108#true} #res := ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8108#true} {8108#true} #1321#return; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {8108#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {8108#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L272 TraceCheckUtils]: 10: Hoare triple {8108#true} call #t~ret9 := is_do_read_c_triggered(); {8108#true} is VALID [2022-02-20 19:59:09,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {8108#true} havoc ~__retres1~1; {8108#true} is VALID [2022-02-20 19:59:09,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {8108#true} assume 1 == ~c_dr_pc~0; {8108#true} is VALID [2022-02-20 19:59:09,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {8108#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:59:09,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {8165#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,720 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8165#(<= 1 |is_do_read_c_triggered_#res|)} {8108#true} #1323#return; {8162#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:09,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {8162#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8163#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:59:09,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {8163#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8109#false} is VALID [2022-02-20 19:59:09,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {8109#false} assume true; {8109#false} is VALID [2022-02-20 19:59:09,721 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8109#false} {8108#true} #1329#return; {8109#false} is VALID [2022-02-20 19:59:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {8148#(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); {8108#true} is VALID [2022-02-20 19:59:09,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8108#true} is VALID [2022-02-20 19:59:09,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8108#true} {8109#false} #1331#return; {8109#false} is VALID [2022-02-20 19:59:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {8108#true} havoc ~__retres1~2; {8108#true} is VALID [2022-02-20 19:59:09,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8108#true} is VALID [2022-02-20 19:59:09,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} #res := ~__retres1~2; {8108#true} is VALID [2022-02-20 19:59:09,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,730 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8108#true} {8109#false} #1333#return; {8109#false} is VALID [2022-02-20 19:59:09,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {8108#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {8108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {8108#true} is VALID [2022-02-20 19:59:09,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {8108#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {8108#true} is VALID [2022-02-20 19:59:09,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {8108#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; {8108#true} is VALID [2022-02-20 19:59:09,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {8108#true} call update_channels1(); {8147#(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:09,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {8147#(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); {8108#true} is VALID [2022-02-20 19:59:09,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,735 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8108#true} {8108#true} #1325#return; {8108#true} is VALID [2022-02-20 19:59:09,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {8108#true} assume { :begin_inline_init_threads1 } true; {8108#true} is VALID [2022-02-20 19:59:09,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {8108#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {8108#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {8108#true} assume { :end_inline_init_threads1 } true; {8108#true} is VALID [2022-02-20 19:59:09,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {8108#true} call fire_delta_events1(); {8148#(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:09,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {8148#(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); {8108#true} is VALID [2022-02-20 19:59:09,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {8108#true} assume !(0 == ~q_write_ev~0); {8108#true} is VALID [2022-02-20 19:59:09,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,742 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8108#true} {8108#true} #1327#return; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {8108#true} call activate_threads1(); {8149#(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:09,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {8149#(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; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L272 TraceCheckUtils]: 19: Hoare triple {8108#true} call #t~ret8 := is_do_write_p_triggered(); {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {8108#true} havoc ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {8108#true} assume !(1 == ~p_dw_pc~0); {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {8108#true} ~__retres1~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {8108#true} #res := ~__retres1~0; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,743 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8108#true} {8108#true} #1321#return; {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {8108#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {8108#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {8108#true} call #t~ret9 := is_do_read_c_triggered(); {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {8108#true} havoc ~__retres1~1; {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {8108#true} assume 1 == ~c_dr_pc~0; {8108#true} is VALID [2022-02-20 19:59:09,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {8108#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:59:09,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {8164#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {8165#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8165#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:59:09,745 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8165#(<= 1 |is_do_read_c_triggered_#res|)} {8108#true} #1323#return; {8162#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:09,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {8162#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8163#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:59:09,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {8163#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8109#false} is VALID [2022-02-20 19:59:09,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {8109#false} assume true; {8109#false} is VALID [2022-02-20 19:59:09,746 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8109#false} {8108#true} #1329#return; {8109#false} is VALID [2022-02-20 19:59:09,746 INFO L272 TraceCheckUtils]: 39: Hoare triple {8109#false} call reset_delta_events1(); {8148#(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:09,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {8148#(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); {8108#true} is VALID [2022-02-20 19:59:09,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {8108#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8108#true} is VALID [2022-02-20 19:59:09,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,746 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8108#true} {8109#false} #1331#return; {8109#false} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {8109#false} assume !false; {8109#false} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {8109#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; {8109#false} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {8109#false} assume !false; {8109#false} is VALID [2022-02-20 19:59:09,747 INFO L272 TraceCheckUtils]: 47: Hoare triple {8109#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8108#true} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {8108#true} havoc ~__retres1~2; {8108#true} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {8108#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8108#true} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {8108#true} #res := ~__retres1~2; {8108#true} is VALID [2022-02-20 19:59:09,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {8108#true} assume true; {8108#true} is VALID [2022-02-20 19:59:09,747 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8108#true} {8109#false} #1333#return; {8109#false} is VALID [2022-02-20 19:59:09,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {8109#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; {8109#false} is VALID [2022-02-20 19:59:09,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {8109#false} assume 0 != eval1_~tmp___1~0#1; {8109#false} is VALID [2022-02-20 19:59:09,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {8109#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; {8109#false} is VALID [2022-02-20 19:59:09,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {8109#false} assume !(0 != eval1_~tmp~2#1); {8109#false} is VALID [2022-02-20 19:59:09,748 INFO L272 TraceCheckUtils]: 57: Hoare triple {8109#false} call error1(); {8109#false} is VALID [2022-02-20 19:59:09,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {8109#false} assume !false; {8109#false} is VALID [2022-02-20 19:59:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:09,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:09,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178824656] [2022-02-20 19:59:09,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178824656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:09,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:09,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:09,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147160411] [2022-02-20 19:59:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:09,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:09,750 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:09,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:09,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:09,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:09,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:09,781 INFO L87 Difference]: Start difference. First operand 541 states and 786 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:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,309 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2022-02-20 19:59:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:12,309 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:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:12,311 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:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 683 transitions. [2022-02-20 19:59:12,316 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:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 683 transitions. [2022-02-20 19:59:12,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 683 transitions. [2022-02-20 19:59:12,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,796 INFO L225 Difference]: With dead ends: 869 [2022-02-20 19:59:12,796 INFO L226 Difference]: Without dead ends: 601 [2022-02-20 19:59:12,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:12,798 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 658 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:12,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 2035 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-02-20 19:59:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 556. [2022-02-20 19:59:12,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:59:12,816 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:59:12,817 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:59:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,832 INFO L93 Difference]: Finished difference Result 601 states and 867 transitions. [2022-02-20 19:59:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 867 transitions. [2022-02-20 19:59:12,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 601 states. [2022-02-20 19:59:12,836 INFO L87 Difference]: Start difference. First operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 601 states. [2022-02-20 19:59:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,851 INFO L93 Difference]: Finished difference Result 601 states and 867 transitions. [2022-02-20 19:59:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 867 transitions. [2022-02-20 19:59:12,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:59:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2022-02-20 19:59:12,869 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 59 [2022-02-20 19:59:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,869 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2022-02-20 19:59:12,870 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:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2022-02-20 19:59:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:12,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:12,871 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888148, now seen corresponding path program 1 times [2022-02-20 19:59:12,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:12,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121650195] [2022-02-20 19:59:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {11333#(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); {11294#true} is VALID [2022-02-20 19:59:12,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:12,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11294#true} {11294#true} #1325#return; {11294#true} is VALID [2022-02-20 19:59:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {11334#(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); {11294#true} is VALID [2022-02-20 19:59:12,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume !(0 == ~q_write_ev~0); {11294#true} is VALID [2022-02-20 19:59:12,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:12,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11294#true} {11294#true} #1327#return; {11294#true} is VALID [2022-02-20 19:59:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:13,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {11294#true} havoc ~__retres1~0; {11294#true} is VALID [2022-02-20 19:59:13,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume !(1 == ~p_dw_pc~0); {11294#true} is VALID [2022-02-20 19:59:13,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} ~__retres1~0 := 0; {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:13,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,009 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11294#true} #1321#return; {11342#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:13,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {11294#true} havoc ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume 1 == ~c_dr_pc~0; {11294#true} is VALID [2022-02-20 19:59:13,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11294#true} is VALID [2022-02-20 19:59:13,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {11294#true} #res := ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,014 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11294#true} {11295#false} #1323#return; {11295#false} is VALID [2022-02-20 19:59:13,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {11335#(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; {11294#true} is VALID [2022-02-20 19:59:13,015 INFO L272 TraceCheckUtils]: 1: Hoare triple {11294#true} call #t~ret8 := is_do_write_p_triggered(); {11294#true} is VALID [2022-02-20 19:59:13,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} havoc ~__retres1~0; {11294#true} is VALID [2022-02-20 19:59:13,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {11294#true} assume !(1 == ~p_dw_pc~0); {11294#true} is VALID [2022-02-20 19:59:13,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {11294#true} ~__retres1~0 := 0; {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:13,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,017 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11294#true} #1321#return; {11342#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:13,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {11342#(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; {11343#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:13,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {11343#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11295#false} is VALID [2022-02-20 19:59:13,018 INFO L272 TraceCheckUtils]: 10: Hoare triple {11295#false} call #t~ret9 := is_do_read_c_triggered(); {11294#true} is VALID [2022-02-20 19:59:13,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {11294#true} havoc ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {11294#true} assume 1 == ~c_dr_pc~0; {11294#true} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {11294#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11294#true} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {11294#true} #res := ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,019 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11294#true} {11295#false} #1323#return; {11295#false} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {11295#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11295#false} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {11295#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11295#false} is VALID [2022-02-20 19:59:13,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {11295#false} assume true; {11295#false} is VALID [2022-02-20 19:59:13,019 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11295#false} {11294#true} #1329#return; {11295#false} is VALID [2022-02-20 19:59:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:13,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {11334#(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); {11294#true} is VALID [2022-02-20 19:59:13,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11294#true} is VALID [2022-02-20 19:59:13,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11294#true} {11295#false} #1331#return; {11295#false} is VALID [2022-02-20 19:59:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {11294#true} havoc ~__retres1~2; {11294#true} is VALID [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11294#true} is VALID [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} #res := ~__retres1~2; {11294#true} is VALID [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,030 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11294#true} {11295#false} #1333#return; {11295#false} is VALID [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {11294#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {11294#true} is VALID [2022-02-20 19:59:13,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {11294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {11294#true} is VALID [2022-02-20 19:59:13,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {11294#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {11294#true} is VALID [2022-02-20 19:59:13,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {11294#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; {11294#true} is VALID [2022-02-20 19:59:13,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {11294#true} call update_channels1(); {11333#(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:13,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {11333#(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); {11294#true} is VALID [2022-02-20 19:59:13,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,031 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11294#true} {11294#true} #1325#return; {11294#true} is VALID [2022-02-20 19:59:13,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {11294#true} assume { :begin_inline_init_threads1 } true; {11294#true} is VALID [2022-02-20 19:59:13,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {11294#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11294#true} is VALID [2022-02-20 19:59:13,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {11294#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11294#true} is VALID [2022-02-20 19:59:13,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {11294#true} assume { :end_inline_init_threads1 } true; {11294#true} is VALID [2022-02-20 19:59:13,032 INFO L272 TraceCheckUtils]: 12: Hoare triple {11294#true} call fire_delta_events1(); {11334#(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:13,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {11334#(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); {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {11294#true} assume !(0 == ~q_write_ev~0); {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11294#true} {11294#true} #1327#return; {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L272 TraceCheckUtils]: 17: Hoare triple {11294#true} call activate_threads1(); {11335#(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:13,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {11335#(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; {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L272 TraceCheckUtils]: 19: Hoare triple {11294#true} call #t~ret8 := is_do_write_p_triggered(); {11294#true} is VALID [2022-02-20 19:59:13,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {11294#true} havoc ~__retres1~0; {11294#true} is VALID [2022-02-20 19:59:13,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {11294#true} assume !(1 == ~p_dw_pc~0); {11294#true} is VALID [2022-02-20 19:59:13,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {11294#true} ~__retres1~0 := 0; {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:13,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {11350#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:13,040 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11351#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11294#true} #1321#return; {11342#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:13,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {11342#(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; {11343#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:13,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {11343#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11295#false} is VALID [2022-02-20 19:59:13,041 INFO L272 TraceCheckUtils]: 28: Hoare triple {11295#false} call #t~ret9 := is_do_read_c_triggered(); {11294#true} is VALID [2022-02-20 19:59:13,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {11294#true} havoc ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {11294#true} assume 1 == ~c_dr_pc~0; {11294#true} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {11294#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11294#true} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {11294#true} #res := ~__retres1~1; {11294#true} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,042 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11294#true} {11295#false} #1323#return; {11295#false} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {11295#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11295#false} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {11295#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11295#false} is VALID [2022-02-20 19:59:13,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {11295#false} assume true; {11295#false} is VALID [2022-02-20 19:59:13,042 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11295#false} {11294#true} #1329#return; {11295#false} is VALID [2022-02-20 19:59:13,042 INFO L272 TraceCheckUtils]: 39: Hoare triple {11295#false} call reset_delta_events1(); {11334#(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:13,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {11334#(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); {11294#true} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {11294#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11294#true} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,043 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11294#true} {11295#false} #1331#return; {11295#false} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {11295#false} assume !false; {11295#false} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {11295#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; {11295#false} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {11295#false} assume !false; {11295#false} is VALID [2022-02-20 19:59:13,043 INFO L272 TraceCheckUtils]: 47: Hoare triple {11295#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11294#true} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {11294#true} havoc ~__retres1~2; {11294#true} is VALID [2022-02-20 19:59:13,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {11294#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11294#true} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {11294#true} #res := ~__retres1~2; {11294#true} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {11294#true} assume true; {11294#true} is VALID [2022-02-20 19:59:13,044 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11294#true} {11295#false} #1333#return; {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {11295#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; {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {11295#false} assume 0 != eval1_~tmp___1~0#1; {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {11295#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; {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {11295#false} assume !(0 != eval1_~tmp~2#1); {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L272 TraceCheckUtils]: 57: Hoare triple {11295#false} call error1(); {11295#false} is VALID [2022-02-20 19:59:13,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {11295#false} assume !false; {11295#false} is VALID [2022-02-20 19:59:13,045 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:13,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:13,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121650195] [2022-02-20 19:59:13,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121650195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:13,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:13,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:13,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137688426] [2022-02-20 19:59:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:13,047 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:13,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:13,048 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:13,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:13,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:13,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:13,081 INFO L87 Difference]: Start difference. First operand 556 states and 801 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:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:15,671 INFO L93 Difference]: Finished difference Result 875 states and 1234 transitions. [2022-02-20 19:59:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:15,672 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:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:15,672 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:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 679 transitions. [2022-02-20 19:59:15,676 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:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 679 transitions. [2022-02-20 19:59:15,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 679 transitions. [2022-02-20 19:59:16,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:16,109 INFO L225 Difference]: With dead ends: 875 [2022-02-20 19:59:16,109 INFO L226 Difference]: Without dead ends: 592 [2022-02-20 19:59:16,110 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:16,111 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 668 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:16,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 2031 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-02-20 19:59:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 561. [2022-02-20 19:59:16,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:16,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 592 states. Second operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:59:16,137 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states. Second operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:59:16,138 INFO L87 Difference]: Start difference. First operand 592 states. Second operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:59:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:16,153 INFO L93 Difference]: Finished difference Result 592 states and 848 transitions. [2022-02-20 19:59:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 848 transitions. [2022-02-20 19:59:16,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:16,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:16,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 592 states. [2022-02-20 19:59:16,157 INFO L87 Difference]: Start difference. First operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 592 states. [2022-02-20 19:59:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:16,172 INFO L93 Difference]: Finished difference Result 592 states and 848 transitions. [2022-02-20 19:59:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 848 transitions. [2022-02-20 19:59:16,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:16,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:16,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:16,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:59:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 804 transitions. [2022-02-20 19:59:16,191 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 804 transitions. Word has length 59 [2022-02-20 19:59:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:16,191 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 804 transitions. [2022-02-20 19:59:16,191 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:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 804 transitions. [2022-02-20 19:59:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:16,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:16,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:16,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:16,193 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1958319534, now seen corresponding path program 1 times [2022-02-20 19:59:16,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:16,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455286462] [2022-02-20 19:59:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {14516#(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); {14517#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:16,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {14517#(not (= |old(~q_req_up~0)| 1))} assume true; {14517#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:16,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14517#(not (= |old(~q_req_up~0)| 1))} {14477#(= ~c_dr_pc~0 ~q_req_up~0)} #1325#return; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {14518#(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); {14474#true} is VALID [2022-02-20 19:59:16,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {14474#true} assume !(0 == ~q_write_ev~0); {14474#true} is VALID [2022-02-20 19:59:16,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14474#true} {14481#(not (= ~c_dr_pc~0 1))} #1327#return; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {14474#true} havoc ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {14474#true} assume !(1 == ~p_dw_pc~0); {14474#true} is VALID [2022-02-20 19:59:16,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {14474#true} ~__retres1~0 := 0; {14474#true} is VALID [2022-02-20 19:59:16,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {14474#true} #res := ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,290 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14474#true} {14474#true} #1321#return; {14474#true} is VALID [2022-02-20 19:59:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {14474#true} havoc ~__retres1~1; {14474#true} is VALID [2022-02-20 19:59:16,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {14474#true} assume 1 == ~c_dr_pc~0; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,299 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} {14474#true} #1323#return; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {14519#(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; {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L272 TraceCheckUtils]: 1: Hoare triple {14474#true} call #t~ret8 := is_do_write_p_triggered(); {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {14474#true} havoc ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {14474#true} assume !(1 == ~p_dw_pc~0); {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {14474#true} ~__retres1~0 := 0; {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {14474#true} #res := ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14474#true} {14474#true} #1321#return; {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {14474#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {14474#true} assume !(0 != ~tmp~1); {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L272 TraceCheckUtils]: 10: Hoare triple {14474#true} call #t~ret9 := is_do_read_c_triggered(); {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {14474#true} havoc ~__retres1~1; {14474#true} is VALID [2022-02-20 19:59:16,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {14474#true} assume 1 == ~c_dr_pc~0; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} {14474#true} #1323#return; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,303 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} {14481#(not (= ~c_dr_pc~0 1))} #1329#return; {14475#false} is VALID [2022-02-20 19:59:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {14518#(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); {14474#true} is VALID [2022-02-20 19:59:16,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {14474#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14474#true} is VALID [2022-02-20 19:59:16,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14474#true} {14475#false} #1331#return; {14475#false} is VALID [2022-02-20 19:59:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:16,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {14474#true} havoc ~__retres1~2; {14474#true} is VALID [2022-02-20 19:59:16,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {14474#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14474#true} is VALID [2022-02-20 19:59:16,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {14474#true} #res := ~__retres1~2; {14474#true} is VALID [2022-02-20 19:59:16,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,312 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14474#true} {14475#false} #1333#return; {14475#false} is VALID [2022-02-20 19:59:16,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {14474#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {14476#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:16,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {14476#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {14476#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:16,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {14476#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {14477#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:16,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {14477#(= ~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; {14477#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:16,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {14477#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {14516#(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:16,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {14516#(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); {14517#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:16,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {14517#(not (= |old(~q_req_up~0)| 1))} assume true; {14517#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:16,315 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14517#(not (= |old(~q_req_up~0)| 1))} {14477#(= ~c_dr_pc~0 ~q_req_up~0)} #1325#return; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,316 INFO L272 TraceCheckUtils]: 12: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {14518#(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:16,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {14518#(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); {14474#true} is VALID [2022-02-20 19:59:16,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {14474#true} assume !(0 == ~q_write_ev~0); {14474#true} is VALID [2022-02-20 19:59:16,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,317 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14474#true} {14481#(not (= ~c_dr_pc~0 1))} #1327#return; {14481#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:16,317 INFO L272 TraceCheckUtils]: 17: Hoare triple {14481#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {14519#(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:16,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {14519#(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; {14474#true} is VALID [2022-02-20 19:59:16,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {14474#true} call #t~ret8 := is_do_write_p_triggered(); {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {14474#true} havoc ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {14474#true} assume !(1 == ~p_dw_pc~0); {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {14474#true} ~__retres1~0 := 0; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {14474#true} #res := ~__retres1~0; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14474#true} {14474#true} #1321#return; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {14474#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {14474#true} assume !(0 != ~tmp~1); {14474#true} is VALID [2022-02-20 19:59:16,318 INFO L272 TraceCheckUtils]: 28: Hoare triple {14474#true} call #t~ret9 := is_do_read_c_triggered(); {14474#true} is VALID [2022-02-20 19:59:16,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {14474#true} havoc ~__retres1~1; {14474#true} is VALID [2022-02-20 19:59:16,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {14474#true} assume 1 == ~c_dr_pc~0; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,320 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} {14474#true} #1323#return; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:16,321 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14532#(= (+ (- 1) ~c_dr_pc~0) 0)} {14481#(not (= ~c_dr_pc~0 1))} #1329#return; {14475#false} is VALID [2022-02-20 19:59:16,321 INFO L272 TraceCheckUtils]: 39: Hoare triple {14475#false} call reset_delta_events1(); {14518#(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:16,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {14518#(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); {14474#true} is VALID [2022-02-20 19:59:16,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {14474#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14474#true} is VALID [2022-02-20 19:59:16,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,321 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14474#true} {14475#false} #1331#return; {14475#false} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {14475#false} assume !false; {14475#false} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {14475#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; {14475#false} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {14475#false} assume !false; {14475#false} is VALID [2022-02-20 19:59:16,322 INFO L272 TraceCheckUtils]: 47: Hoare triple {14475#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14474#true} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {14474#true} havoc ~__retres1~2; {14474#true} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {14474#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14474#true} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {14474#true} #res := ~__retres1~2; {14474#true} is VALID [2022-02-20 19:59:16,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {14474#true} assume true; {14474#true} is VALID [2022-02-20 19:59:16,322 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14474#true} {14475#false} #1333#return; {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {14475#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; {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {14475#false} assume 0 != eval1_~tmp___1~0#1; {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {14475#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; {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {14475#false} assume !(0 != eval1_~tmp~2#1); {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L272 TraceCheckUtils]: 57: Hoare triple {14475#false} call error1(); {14475#false} is VALID [2022-02-20 19:59:16,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {14475#false} assume !false; {14475#false} is VALID [2022-02-20 19:59:16,323 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:16,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:16,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455286462] [2022-02-20 19:59:16,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455286462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:16,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:16,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:16,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470671085] [2022-02-20 19:59:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:16,325 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:16,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:16,325 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:16,352 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:16,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:16,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:16,354 INFO L87 Difference]: Start difference. First operand 561 states and 804 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:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,079 INFO L93 Difference]: Finished difference Result 1931 states and 2655 transitions. [2022-02-20 19:59:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:21,079 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:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:21,079 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:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1205 transitions. [2022-02-20 19:59:21,087 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:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1205 transitions. [2022-02-20 19:59:21,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1205 transitions. [2022-02-20 19:59:21,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1205 edges. 1205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:21,989 INFO L225 Difference]: With dead ends: 1931 [2022-02-20 19:59:21,990 INFO L226 Difference]: Without dead ends: 1625 [2022-02-20 19:59:21,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:21,993 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 3083 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3098 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:21,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3098 Valid, 1997 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:59:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2022-02-20 19:59:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1477. [2022-02-20 19:59:22,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:22,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1625 states. Second operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:59:22,060 INFO L74 IsIncluded]: Start isIncluded. First operand 1625 states. Second operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:59:22,063 INFO L87 Difference]: Start difference. First operand 1625 states. Second operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:59:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,146 INFO L93 Difference]: Finished difference Result 1625 states and 2126 transitions. [2022-02-20 19:59:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2126 transitions. [2022-02-20 19:59:22,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1625 states. [2022-02-20 19:59:22,153 INFO L87 Difference]: Start difference. First operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1625 states. [2022-02-20 19:59:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,236 INFO L93 Difference]: Finished difference Result 1625 states and 2126 transitions. [2022-02-20 19:59:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2126 transitions. [2022-02-20 19:59:22,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:22,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:59:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1962 transitions. [2022-02-20 19:59:22,343 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1962 transitions. Word has length 59 [2022-02-20 19:59:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:22,343 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 1962 transitions. [2022-02-20 19:59:22,344 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:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1962 transitions. [2022-02-20 19:59:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:22,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:22,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:22,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:22,345 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -440465259, now seen corresponding path program 1 times [2022-02-20 19:59:22,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:22,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125497490] [2022-02-20 19:59:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:22,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {22468#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1325#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {22469#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {22469#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1327#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {22428#true} havoc ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(1 == ~p_dw_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {22428#true} ~__retres1~0 := 0; {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {22428#true} #res := ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22428#true} {22428#true} #1321#return; {22428#true} is VALID [2022-02-20 19:59:22,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {22428#true} havoc ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(1 == ~c_dr_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {22428#true} ~__retres1~1 := 0; {22428#true} is VALID [2022-02-20 19:59:22,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {22428#true} #res := ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22428#true} {22428#true} #1323#return; {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {22470#(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; {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L272 TraceCheckUtils]: 1: Hoare triple {22428#true} call #t~ret8 := is_do_write_p_triggered(); {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {22428#true} havoc ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {22428#true} assume !(1 == ~p_dw_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {22428#true} ~__retres1~0 := 0; {22428#true} is VALID [2022-02-20 19:59:22,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {22428#true} #res := ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,411 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22428#true} {22428#true} #1321#return; {22428#true} is VALID [2022-02-20 19:59:22,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {22428#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {22428#true} assume !(0 != ~tmp~1); {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L272 TraceCheckUtils]: 10: Hoare triple {22428#true} call #t~ret9 := is_do_read_c_triggered(); {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {22428#true} havoc ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {22428#true} assume !(1 == ~c_dr_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {22428#true} ~__retres1~1 := 0; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {22428#true} #res := ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22428#true} {22428#true} #1323#return; {22428#true} is VALID [2022-02-20 19:59:22,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {22428#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22428#true} is VALID [2022-02-20 19:59:22,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {22428#true} assume !(0 != ~tmp___0~1); {22428#true} is VALID [2022-02-20 19:59:22,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,413 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22428#true} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1329#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {22469#(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); {22483#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:22,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {22483#(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; {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1331#return; {22429#false} is VALID [2022-02-20 19:59:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:22,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {22428#true} havoc ~__retres1~2; {22428#true} is VALID [2022-02-20 19:59:22,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {22428#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22428#true} is VALID [2022-02-20 19:59:22,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {22428#true} #res := ~__retres1~2; {22428#true} is VALID [2022-02-20 19:59:22,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,437 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22428#true} {22429#false} #1333#return; {22429#false} is VALID [2022-02-20 19:59:22,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {22428#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22428#true} is VALID [2022-02-20 19:59:22,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {22428#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {22428#true} is VALID [2022-02-20 19:59:22,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {22428#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {22430#(= ~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; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22468#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:22,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {22468#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,440 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1325#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,441 INFO L272 TraceCheckUtils]: 12: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {22469#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {22469#(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); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,442 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1327#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {22470#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {22470#(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; {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L272 TraceCheckUtils]: 19: Hoare triple {22428#true} call #t~ret8 := is_do_write_p_triggered(); {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {22428#true} havoc ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {22428#true} assume !(1 == ~p_dw_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {22428#true} ~__retres1~0 := 0; {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {22428#true} #res := ~__retres1~0; {22428#true} is VALID [2022-02-20 19:59:22,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22428#true} {22428#true} #1321#return; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {22428#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {22428#true} assume !(0 != ~tmp~1); {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L272 TraceCheckUtils]: 28: Hoare triple {22428#true} call #t~ret9 := is_do_read_c_triggered(); {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {22428#true} havoc ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {22428#true} assume !(1 == ~c_dr_pc~0); {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {22428#true} ~__retres1~1 := 0; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {22428#true} #res := ~__retres1~1; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,444 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22428#true} {22428#true} #1323#return; {22428#true} is VALID [2022-02-20 19:59:22,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {22428#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22428#true} is VALID [2022-02-20 19:59:22,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {22428#true} assume !(0 != ~tmp___0~1); {22428#true} is VALID [2022-02-20 19:59:22,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,455 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22428#true} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1329#return; {22430#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:22,456 INFO L272 TraceCheckUtils]: 39: Hoare triple {22430#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {22469#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:22,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {22469#(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); {22483#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:22,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {22483#(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; {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:22,457 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22484#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22430#(= ~q_write_ev~0 ~q_read_ev~0)} #1331#return; {22429#false} is VALID [2022-02-20 19:59:22,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {22429#false} assume !false; {22429#false} is VALID [2022-02-20 19:59:22,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {22429#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; {22429#false} is VALID [2022-02-20 19:59:22,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {22429#false} assume !false; {22429#false} is VALID [2022-02-20 19:59:22,457 INFO L272 TraceCheckUtils]: 47: Hoare triple {22429#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22428#true} is VALID [2022-02-20 19:59:22,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {22428#true} havoc ~__retres1~2; {22428#true} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {22428#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22428#true} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {22428#true} #res := ~__retres1~2; {22428#true} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {22428#true} assume true; {22428#true} is VALID [2022-02-20 19:59:22,458 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22428#true} {22429#false} #1333#return; {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {22429#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; {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {22429#false} assume 0 != eval1_~tmp___1~0#1; {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {22429#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; {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {22429#false} assume !(0 != eval1_~tmp~2#1); {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L272 TraceCheckUtils]: 57: Hoare triple {22429#false} call error1(); {22429#false} is VALID [2022-02-20 19:59:22,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {22429#false} assume !false; {22429#false} is VALID [2022-02-20 19:59:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:22,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:22,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125497490] [2022-02-20 19:59:22,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125497490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:22,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:22,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:22,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271628797] [2022-02-20 19:59:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:22,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:22,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:22,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:22,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:22,489 INFO L87 Difference]: Start difference. First operand 1477 states and 1962 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,225 INFO L93 Difference]: Finished difference Result 2758 states and 3550 transitions. [2022-02-20 19:59:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 19:59:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:59:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 842 transitions. [2022-02-20 19:59:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 842 transitions. [2022-02-20 19:59:25,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 842 transitions. [2022-02-20 19:59:25,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 842 edges. 842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:25,885 INFO L225 Difference]: With dead ends: 2758 [2022-02-20 19:59:25,885 INFO L226 Difference]: Without dead ends: 1765 [2022-02-20 19:59:25,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:59:25,887 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 1030 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:25,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 1753 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-02-20 19:59:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1419. [2022-02-20 19:59:25,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:25,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1765 states. Second operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:59:25,953 INFO L74 IsIncluded]: Start isIncluded. First operand 1765 states. Second operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:59:25,954 INFO L87 Difference]: Start difference. First operand 1765 states. Second operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:59:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,048 INFO L93 Difference]: Finished difference Result 1765 states and 2259 transitions. [2022-02-20 19:59:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2259 transitions. [2022-02-20 19:59:26,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) Second operand 1765 states. [2022-02-20 19:59:26,054 INFO L87 Difference]: Start difference. First operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) Second operand 1765 states. [2022-02-20 19:59:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,145 INFO L93 Difference]: Finished difference Result 1765 states and 2259 transitions. [2022-02-20 19:59:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2259 transitions. [2022-02-20 19:59:26,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:59:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1879 transitions. [2022-02-20 19:59:26,228 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1879 transitions. Word has length 59 [2022-02-20 19:59:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,228 INFO L470 AbstractCegarLoop]: Abstraction has 1419 states and 1879 transitions. [2022-02-20 19:59:26,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1879 transitions. [2022-02-20 19:59:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:26,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:26,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:26,229 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1860357331, now seen corresponding path program 1 times [2022-02-20 19:59:26,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:26,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530820066] [2022-02-20 19:59:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:26,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:26,324 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:26,328 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:26,329 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:26,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:26,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:26,335 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:26,340 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:26,391 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:26,392 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:26,398 INFO L158 Benchmark]: Toolchain (without parser) took 27801.96ms. Allocated memory was 98.6MB in the beginning and 234.9MB in the end (delta: 136.3MB). Free memory was 66.0MB in the beginning and 170.8MB in the end (delta: -104.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,398 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:26,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.28ms. Allocated memory is still 98.6MB. Free memory was 65.7MB in the beginning and 60.0MB in the end (delta: 5.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 55.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,398 INFO L158 Benchmark]: Boogie Preprocessor took 37.93ms. Allocated memory is still 98.6MB. Free memory was 55.1MB in the beginning and 51.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,399 INFO L158 Benchmark]: RCFGBuilder took 750.25ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 51.3MB in the beginning and 96.0MB in the end (delta: -44.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,399 INFO L158 Benchmark]: TraceAbstraction took 26614.41ms. Allocated memory was 125.8MB in the beginning and 234.9MB in the end (delta: 109.1MB). Free memory was 96.0MB in the beginning and 170.8MB in the end (delta: -74.7MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:26,403 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.19ms. Allocated memory is still 98.6MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.28ms. Allocated memory is still 98.6MB. Free memory was 65.7MB in the beginning and 60.0MB in the end (delta: 5.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 55.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.93ms. Allocated memory is still 98.6MB. Free memory was 55.1MB in the beginning and 51.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 750.25ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 51.3MB in the beginning and 96.0MB in the end (delta: -44.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26614.41ms. Allocated memory was 125.8MB in the beginning and 234.9MB in the end (delta: 109.1MB). Free memory was 96.0MB in the beginning and 170.8MB in the end (delta: -74.7MB). Peak memory consumption was 33.1MB. 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:26,431 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.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:27,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:27,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:28,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:28,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:28,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:28,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:28,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:28,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:28,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:28,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:28,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:28,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:28,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:28,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:28,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:28,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:28,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:28,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:28,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:28,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:28,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:28,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:28,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:28,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:28,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:28,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:28,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:28,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:28,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:28,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:28,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:28,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:28,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:28,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:28,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:28,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:28,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:28,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:28,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:28,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:28,070 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:28,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:28,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:28,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:28,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:28,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:28,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:28,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:28,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:28,097 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:28,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:28,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:28,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:28,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:28,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:28,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:28,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:28,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:28,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:28,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:28,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:28,102 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 -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2022-02-20 19:59:28,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:28,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:28,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:28,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:28,413 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:28,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.07.cil-1.c [2022-02-20 19:59:28,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c123bbf/1c3a513cff5e44519153f178aafa0457/FLAG3d7f490dc [2022-02-20 19:59:28,887 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:28,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-02-20 19:59:28,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c123bbf/1c3a513cff5e44519153f178aafa0457/FLAG3d7f490dc [2022-02-20 19:59:29,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c123bbf/1c3a513cff5e44519153f178aafa0457 [2022-02-20 19:59:29,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:29,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:29,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:29,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:29,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:29,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719fa267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29, skipping insertion in model container [2022-02-20 19:59:29,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:29,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:29,433 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.07.cil-1.c[914,927] [2022-02-20 19:59:29,468 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.07.cil-1.c[7125,7138] [2022-02-20 19:59:29,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:29,560 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:29,576 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.07.cil-1.c[914,927] [2022-02-20 19:59:29,596 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.07.cil-1.c[7125,7138] [2022-02-20 19:59:29,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:29,658 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:29,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29 WrapperNode [2022-02-20 19:59:29,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:29,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:29,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:29,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:29,664 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:29" (1/1) ... [2022-02-20 19:59:29,684 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:29" (1/1) ... [2022-02-20 19:59:29,722 INFO L137 Inliner]: procedures = 68, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 722 [2022-02-20 19:59:29,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:29,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:29,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:29,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:29,745 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:29" (1/1) ... [2022-02-20 19:59:29,745 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:29" (1/1) ... [2022-02-20 19:59:29,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,762 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:29" (1/1) ... [2022-02-20 19:59:29,786 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:29" (1/1) ... [2022-02-20 19:59:29,794 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:29" (1/1) ... [2022-02-20 19:59:29,808 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:29" (1/1) ... [2022-02-20 19:59:29,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:29,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:29,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:29,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:29,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:29,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:29,848 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:29,861 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:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:29,885 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:29,886 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:29,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:29,887 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:29,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:29,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:29,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:29,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:29,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:29,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:29,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:29,889 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:29,889 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:29,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:29,890 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:29,997 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:29,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:30,542 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:30,550 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:30,551 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 19:59:30,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:30 BoogieIcfgContainer [2022-02-20 19:59:30,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:30,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:30,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:30,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:30,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:29" (1/3) ... [2022-02-20 19:59:30,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154d9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:30, skipping insertion in model container [2022-02-20 19:59:30,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29" (2/3) ... [2022-02-20 19:59:30,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154d9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:30, skipping insertion in model container [2022-02-20 19:59:30,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:30" (3/3) ... [2022-02-20 19:59:30,557 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2022-02-20 19:59:30,560 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:30,560 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:30,589 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:30,594 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:30,594 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 19:59:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:30,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:30,620 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:30,621 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1357445742, now seen corresponding path program 1 times [2022-02-20 19:59:30,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:30,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204594895] [2022-02-20 19:59:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:30,635 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:30,655 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:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:59:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:30,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:30,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {362#true} is VALID [2022-02-20 19:59:30,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1; {362#true} is VALID [2022-02-20 19:59:30,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume 0bv32 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:30,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:30,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} call update_channels1(); {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:30,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} assume !(1bv32 == ~q_req_up~0); {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:30,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} assume true; {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:30,991 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {373#(= ~p_dw_i~0 (_ bv1 32))} {373#(= ~p_dw_i~0 (_ bv1 32))} #1325#return; {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:31,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} assume { :begin_inline_init_threads1 } true; {373#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:31,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {373#(= ~p_dw_i~0 (_ bv1 32))} assume !(1bv32 == ~p_dw_i~0);~p_dw_st~0 := 2bv32; {363#false} is VALID [2022-02-20 19:59:31,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {363#false} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {363#false} is VALID [2022-02-20 19:59:31,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {363#false} assume { :end_inline_init_threads1 } true; {363#false} is VALID [2022-02-20 19:59:31,001 INFO L272 TraceCheckUtils]: 12: Hoare triple {363#false} call fire_delta_events1(); {363#false} is VALID [2022-02-20 19:59:31,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {363#false} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {363#false} is VALID [2022-02-20 19:59:31,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {363#false} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {363#false} is VALID [2022-02-20 19:59:31,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,002 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {363#false} {363#false} #1327#return; {363#false} is VALID [2022-02-20 19:59:31,002 INFO L272 TraceCheckUtils]: 17: Hoare triple {363#false} call activate_threads1(); {363#false} is VALID [2022-02-20 19:59:31,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {363#false} havoc ~tmp~1;havoc ~tmp___0~1; {363#false} is VALID [2022-02-20 19:59:31,003 INFO L272 TraceCheckUtils]: 19: Hoare triple {363#false} call #t~ret8 := is_do_write_p_triggered(); {363#false} is VALID [2022-02-20 19:59:31,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {363#false} havoc ~__retres1~0; {363#false} is VALID [2022-02-20 19:59:31,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {363#false} assume !(1bv32 == ~p_dw_pc~0); {363#false} is VALID [2022-02-20 19:59:31,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {363#false} ~__retres1~0 := 0bv32; {363#false} is VALID [2022-02-20 19:59:31,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {363#false} #res := ~__retres1~0; {363#false} is VALID [2022-02-20 19:59:31,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,004 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {363#false} {363#false} #1321#return; {363#false} is VALID [2022-02-20 19:59:31,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {363#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {363#false} is VALID [2022-02-20 19:59:31,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {363#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {363#false} is VALID [2022-02-20 19:59:31,004 INFO L272 TraceCheckUtils]: 28: Hoare triple {363#false} call #t~ret9 := is_do_read_c_triggered(); {363#false} is VALID [2022-02-20 19:59:31,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {363#false} havoc ~__retres1~1; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {363#false} assume 1bv32 == ~c_dr_pc~0; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {363#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {363#false} #res := ~__retres1~1; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {363#false} {363#false} #1323#return; {363#false} is VALID [2022-02-20 19:59:31,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {363#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {363#false} is VALID [2022-02-20 19:59:31,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {363#false} assume !(0bv32 != ~tmp___0~1); {363#false} is VALID [2022-02-20 19:59:31,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,006 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {363#false} {363#false} #1329#return; {363#false} is VALID [2022-02-20 19:59:31,006 INFO L272 TraceCheckUtils]: 39: Hoare triple {363#false} call reset_delta_events1(); {363#false} is VALID [2022-02-20 19:59:31,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {363#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {363#false} is VALID [2022-02-20 19:59:31,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {363#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {363#false} is VALID [2022-02-20 19:59:31,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,007 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {363#false} {363#false} #1331#return; {363#false} is VALID [2022-02-20 19:59:31,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:31,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {363#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; {363#false} is VALID [2022-02-20 19:59:31,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:31,008 INFO L272 TraceCheckUtils]: 47: Hoare triple {363#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {363#false} is VALID [2022-02-20 19:59:31,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {363#false} havoc ~__retres1~2; {363#false} is VALID [2022-02-20 19:59:31,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {363#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {363#false} is VALID [2022-02-20 19:59:31,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {363#false} #res := ~__retres1~2; {363#false} is VALID [2022-02-20 19:59:31,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {363#false} assume true; {363#false} is VALID [2022-02-20 19:59:31,009 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {363#false} {363#false} #1333#return; {363#false} is VALID [2022-02-20 19:59:31,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {363#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {363#false} is VALID [2022-02-20 19:59:31,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {363#false} assume 0bv32 != eval1_~tmp___1~0#1; {363#false} is VALID [2022-02-20 19:59:31,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {363#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {363#false} is VALID [2022-02-20 19:59:31,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {363#false} assume !(0bv32 != eval1_~tmp~2#1); {363#false} is VALID [2022-02-20 19:59:31,010 INFO L272 TraceCheckUtils]: 57: Hoare triple {363#false} call error1(); {363#false} is VALID [2022-02-20 19:59:31,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 19:59:31,011 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,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:31,012 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:31,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204594895] [2022-02-20 19:59:31,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204594895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:59:31,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082925763] [2022-02-20 19:59:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:31,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,067 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,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:59:31,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:59:31,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:31,084 INFO L87 Difference]: Start difference. First operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,694 INFO L93 Difference]: Finished difference Result 696 states and 1095 transitions. [2022-02-20 19:59:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:59:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2022-02-20 19:59:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2022-02-20 19:59:31,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1095 transitions. [2022-02-20 19:59:32,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1095 edges. 1095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:32,530 INFO L225 Difference]: With dead ends: 696 [2022-02-20 19:59:32,531 INFO L226 Difference]: Without dead ends: 349 [2022-02-20 19:59:32,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:32,537 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 129 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:32,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 924 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-02-20 19:59:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-02-20 19:59:32,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:32,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:32,574 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:32,575 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,591 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-02-20 19:59:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-02-20 19:59:32,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 349 states. [2022-02-20 19:59:32,596 INFO L87 Difference]: Start difference. First operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 349 states. [2022-02-20 19:59:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,607 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-02-20 19:59:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-02-20 19:59:32,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:32,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:32,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:32,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2022-02-20 19:59:32,623 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 59 [2022-02-20 19:59:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:32,623 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2022-02-20 19:59:32,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2022-02-20 19:59:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:32,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:32,625 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:32,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:32,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:32,833 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -876365484, now seen corresponding path program 1 times [2022-02-20 19:59:32,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:32,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090592749] [2022-02-20 19:59:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:32,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:32,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:59:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:33,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2633#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {2633#true} is VALID [2022-02-20 19:59:33,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2633#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1; {2633#true} is VALID [2022-02-20 19:59:33,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2633#true} assume 0bv32 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {2644#(= (_ 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; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,127 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2644#(= (_ bv2 32) ~q_read_ev~0)} #1325#return; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2644#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,129 INFO L272 TraceCheckUtils]: 12: Hoare triple {2644#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:33,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {2651#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:33,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:33,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:33,130 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2679#(= |old(~q_read_ev~0)| (_ bv0 32))} {2644#(= (_ bv2 32) ~q_read_ev~0)} #1327#return; {2634#false} is VALID [2022-02-20 19:59:33,130 INFO L272 TraceCheckUtils]: 17: Hoare triple {2634#false} call activate_threads1(); {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {2634#false} havoc ~tmp~1;havoc ~tmp___0~1; {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {2634#false} call #t~ret8 := is_do_write_p_triggered(); {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {2634#false} havoc ~__retres1~0; {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {2634#false} assume !(1bv32 == ~p_dw_pc~0); {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#false} ~__retres1~0 := 0bv32; {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {2634#false} #res := ~__retres1~0; {2634#false} is VALID [2022-02-20 19:59:33,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {2634#false} assume true; {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2634#false} {2634#false} #1321#return; {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {2634#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {2634#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L272 TraceCheckUtils]: 28: Hoare triple {2634#false} call #t~ret9 := is_do_read_c_triggered(); {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {2634#false} havoc ~__retres1~1; {2634#false} is VALID [2022-02-20 19:59:33,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {2634#false} assume 1bv32 == ~c_dr_pc~0; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {2634#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {2634#false} #res := ~__retres1~1; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {2634#false} assume true; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2634#false} {2634#false} #1323#return; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {2634#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {2634#false} assume !(0bv32 != ~tmp___0~1); {2634#false} is VALID [2022-02-20 19:59:33,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {2634#false} assume true; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2634#false} {2634#false} #1329#return; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L272 TraceCheckUtils]: 39: Hoare triple {2634#false} call reset_delta_events1(); {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {2634#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {2634#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {2634#false} assume true; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2634#false} {2634#false} #1331#return; {2634#false} is VALID [2022-02-20 19:59:33,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {2634#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; {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L272 TraceCheckUtils]: 47: Hoare triple {2634#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {2634#false} havoc ~__retres1~2; {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {2634#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2634#false} is VALID [2022-02-20 19:59:33,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {2634#false} #res := ~__retres1~2; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {2634#false} assume true; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2634#false} {2634#false} #1333#return; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {2634#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {2634#false} assume 0bv32 != eval1_~tmp___1~0#1; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {2634#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {2634#false} assume !(0bv32 != eval1_~tmp~2#1); {2634#false} is VALID [2022-02-20 19:59:33,136 INFO L272 TraceCheckUtils]: 57: Hoare triple {2634#false} call error1(); {2634#false} is VALID [2022-02-20 19:59:33,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2022-02-20 19:59:33,137 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:33,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:33,137 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:33,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090592749] [2022-02-20 19:59:33,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090592749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:33,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:33,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:33,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805631832] [2022-02-20 19:59:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:33,139 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:33,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:33,140 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:33,176 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:33,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:33,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:33,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:33,178 INFO L87 Difference]: Start difference. First operand 349 states and 522 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:34,863 INFO L93 Difference]: Finished difference Result 542 states and 792 transitions. [2022-02-20 19:59:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:34,864 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:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 792 transitions. [2022-02-20 19:59:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 792 transitions. [2022-02-20 19:59:34,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 792 transitions. [2022-02-20 19:59:35,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 792 edges. 792 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:35,438 INFO L225 Difference]: With dead ends: 542 [2022-02-20 19:59:35,438 INFO L226 Difference]: Without dead ends: 453 [2022-02-20 19:59:35,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:35,439 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 372 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:35,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 1317 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-02-20 19:59:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2022-02-20 19:59:35,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:35,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,458 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,459 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,473 INFO L93 Difference]: Finished difference Result 453 states and 662 transitions. [2022-02-20 19:59:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 662 transitions. [2022-02-20 19:59:35,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 453 states. [2022-02-20 19:59:35,477 INFO L87 Difference]: Start difference. First operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 453 states. [2022-02-20 19:59:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,506 INFO L93 Difference]: Finished difference Result 453 states and 662 transitions. [2022-02-20 19:59:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 662 transitions. [2022-02-20 19:59:35,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:35,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 653 transitions. [2022-02-20 19:59:35,523 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 653 transitions. Word has length 59 [2022-02-20 19:59:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:35,523 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 653 transitions. [2022-02-20 19:59:35,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 653 transitions. [2022-02-20 19:59:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:35,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:35,525 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:35,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:35,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:35,733 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash -637036524, now seen corresponding path program 1 times [2022-02-20 19:59:35,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:35,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157895393] [2022-02-20 19:59:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:35,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:35,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 19:59:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:35,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:35,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:35,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {5051#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {5051#true} is VALID [2022-02-20 19:59:35,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {5051#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1; {5051#true} is VALID [2022-02-20 19:59:35,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {5051#true} assume 0bv32 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,989 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {5062#(= (_ bv2 32) ~q_write_ev~0)} #1325#return; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {5062#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,991 INFO L272 TraceCheckUtils]: 12: Hoare triple {5062#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:35,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {5069#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {5100#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:35,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {5100#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {5100#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:35,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5100#(= |old(~q_write_ev~0)| (_ bv0 32))} {5062#(= (_ bv2 32) ~q_write_ev~0)} #1327#return; {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L272 TraceCheckUtils]: 17: Hoare triple {5052#false} call activate_threads1(); {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {5052#false} havoc ~tmp~1;havoc ~tmp___0~1; {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L272 TraceCheckUtils]: 19: Hoare triple {5052#false} call #t~ret8 := is_do_write_p_triggered(); {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {5052#false} havoc ~__retres1~0; {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {5052#false} assume !(1bv32 == ~p_dw_pc~0); {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {5052#false} ~__retres1~0 := 0bv32; {5052#false} is VALID [2022-02-20 19:59:35,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {5052#false} #res := ~__retres1~0; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {5052#false} assume true; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5052#false} {5052#false} #1321#return; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {5052#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {5052#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L272 TraceCheckUtils]: 28: Hoare triple {5052#false} call #t~ret9 := is_do_read_c_triggered(); {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {5052#false} havoc ~__retres1~1; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {5052#false} assume 1bv32 == ~c_dr_pc~0; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {5052#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {5052#false} is VALID [2022-02-20 19:59:35,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {5052#false} #res := ~__retres1~1; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {5052#false} assume true; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5052#false} {5052#false} #1323#return; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {5052#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {5052#false} assume !(0bv32 != ~tmp___0~1); {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {5052#false} assume true; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5052#false} {5052#false} #1329#return; {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L272 TraceCheckUtils]: 39: Hoare triple {5052#false} call reset_delta_events1(); {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {5052#false} assume !(1bv32 == ~q_read_ev~0); {5052#false} is VALID [2022-02-20 19:59:35,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {5052#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {5052#false} assume true; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5052#false} {5052#false} #1331#return; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {5052#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; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L272 TraceCheckUtils]: 47: Hoare triple {5052#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {5052#false} havoc ~__retres1~2; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {5052#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {5052#false} is VALID [2022-02-20 19:59:35,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {5052#false} #res := ~__retres1~2; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {5052#false} assume true; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5052#false} {5052#false} #1333#return; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 53: Hoare triple {5052#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {5052#false} assume 0bv32 != eval1_~tmp___1~0#1; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {5052#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {5052#false} assume !(0bv32 != eval1_~tmp~2#1); {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L272 TraceCheckUtils]: 57: Hoare triple {5052#false} call error1(); {5052#false} is VALID [2022-02-20 19:59:35,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-02-20 19:59:35,998 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:35,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:35,998 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:35,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157895393] [2022-02-20 19:59:35,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157895393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:35,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:35,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:35,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453456657] [2022-02-20 19:59:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:35,999 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:35,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:35,999 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:36,043 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:36,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:36,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:36,044 INFO L87 Difference]: Start difference. First operand 445 states and 653 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:37,678 INFO L93 Difference]: Finished difference Result 839 states and 1207 transitions. [2022-02-20 19:59:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:37,679 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:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2022-02-20 19:59:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2022-02-20 19:59:37,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 790 transitions. [2022-02-20 19:59:38,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:38,204 INFO L225 Difference]: With dead ends: 839 [2022-02-20 19:59:38,204 INFO L226 Difference]: Without dead ends: 659 [2022-02-20 19:59:38,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:38,206 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 364 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:38,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1322 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-02-20 19:59:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 650. [2022-02-20 19:59:38,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:38,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-20 19:59:38,231 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-20 19:59:38,232 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-20 19:59:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:38,250 INFO L93 Difference]: Finished difference Result 659 states and 941 transitions. [2022-02-20 19:59:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 941 transitions. [2022-02-20 19:59:38,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:38,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:38,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) Second operand 659 states. [2022-02-20 19:59:38,254 INFO L87 Difference]: Start difference. First operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) Second operand 659 states. [2022-02-20 19:59:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:38,272 INFO L93 Difference]: Finished difference Result 659 states and 941 transitions. [2022-02-20 19:59:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 941 transitions. [2022-02-20 19:59:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:38,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:38,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:38,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 535 states have (on average 1.4411214953271028) internal successors, (771), 550 states have internal predecessors, (771), 69 states have call successors, (69), 35 states have call predecessors, (69), 44 states have return successors, (91), 69 states have call predecessors, (91), 66 states have call successors, (91) [2022-02-20 19:59:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 931 transitions. [2022-02-20 19:59:38,297 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 931 transitions. Word has length 59 [2022-02-20 19:59:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:38,298 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 931 transitions. [2022-02-20 19:59:38,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 931 transitions. [2022-02-20 19:59:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:38,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:38,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:38,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 19:59:38,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:38,509 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1585597717, now seen corresponding path program 1 times [2022-02-20 19:59:38,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:38,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812820762] [2022-02-20 19:59:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:38,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:38,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 19:59:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:38,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:38,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {8560#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;~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;~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;~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;~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;~token~0 := 0bv32;~local~0 := 0bv32; {8560#true} is VALID [2022-02-20 19:59:38,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {8560#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {8560#true} assume 0bv32 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {8560#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; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {8560#true} call update_channels1(); {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {8560#true} assume !(1bv32 == ~q_req_up~0); {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {8560#true} assume true; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8560#true} {8560#true} #1325#return; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {8560#true} assume { :begin_inline_init_threads1 } true; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {8560#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {8560#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8560#true} is VALID [2022-02-20 19:59:38,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#true} assume { :end_inline_init_threads1 } true; {8560#true} is VALID [2022-02-20 19:59:38,730 INFO L272 TraceCheckUtils]: 12: Hoare triple {8560#true} call fire_delta_events1(); {8560#true} is VALID [2022-02-20 19:59:38,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#true} assume !(0bv32 == ~q_read_ev~0); {8560#true} is VALID [2022-02-20 19:59:38,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#true} assume !(0bv32 == ~q_write_ev~0); {8560#true} is VALID [2022-02-20 19:59:38,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#true} assume true; {8560#true} is VALID [2022-02-20 19:59:38,730 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8560#true} {8560#true} #1327#return; {8560#true} is VALID [2022-02-20 19:59:38,731 INFO L272 TraceCheckUtils]: 17: Hoare triple {8560#true} call activate_threads1(); {8560#true} is VALID [2022-02-20 19:59:38,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#true} havoc ~tmp~1;havoc ~tmp___0~1; {8560#true} is VALID [2022-02-20 19:59:38,731 INFO L272 TraceCheckUtils]: 19: Hoare triple {8560#true} call #t~ret8 := is_do_write_p_triggered(); {8560#true} is VALID [2022-02-20 19:59:38,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#true} havoc ~__retres1~0; {8560#true} is VALID [2022-02-20 19:59:38,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#true} assume !(1bv32 == ~p_dw_pc~0); {8560#true} is VALID [2022-02-20 19:59:38,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#true} ~__retres1~0 := 0bv32; {8631#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:38,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {8631#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {8635#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:38,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {8635#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {8635#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:38,737 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8635#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {8560#true} #1321#return; {8642#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:38,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {8642#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {8646#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:38,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {8646#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L272 TraceCheckUtils]: 28: Hoare triple {8561#false} call #t~ret9 := is_do_read_c_triggered(); {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {8561#false} havoc ~__retres1~1; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {8561#false} assume !(1bv32 == ~c_dr_pc~0); {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {8561#false} ~__retres1~1 := 0bv32; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {8561#false} #res := ~__retres1~1; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {8561#false} assume true; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8561#false} {8561#false} #1323#return; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {8561#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {8561#false} assume !(0bv32 != ~tmp___0~1); {8561#false} is VALID [2022-02-20 19:59:38,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {8561#false} assume true; {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8561#false} {8560#true} #1329#return; {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L272 TraceCheckUtils]: 39: Hoare triple {8561#false} call reset_delta_events1(); {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {8561#false} assume !(1bv32 == ~q_read_ev~0); {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {8561#false} assume !(1bv32 == ~q_write_ev~0); {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {8561#false} assume true; {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8561#false} {8561#false} #1331#return; {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {8561#false} assume !false; {8561#false} is VALID [2022-02-20 19:59:38,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {8561#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; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {8561#false} assume !false; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L272 TraceCheckUtils]: 47: Hoare triple {8561#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {8561#false} havoc ~__retres1~2; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {8561#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {8561#false} #res := ~__retres1~2; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {8561#false} assume true; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8561#false} {8561#false} #1333#return; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {8561#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {8561#false} assume 0bv32 != eval1_~tmp___1~0#1; {8561#false} is VALID [2022-02-20 19:59:38,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {8561#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8561#false} is VALID [2022-02-20 19:59:38,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {8561#false} assume !(0bv32 != eval1_~tmp~2#1); {8561#false} is VALID [2022-02-20 19:59:38,741 INFO L272 TraceCheckUtils]: 57: Hoare triple {8561#false} call error1(); {8561#false} is VALID [2022-02-20 19:59:38,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {8561#false} assume !false; {8561#false} is VALID [2022-02-20 19:59:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:38,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:38,741 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:38,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812820762] [2022-02-20 19:59:38,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812820762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:38,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:38,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:38,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656455130] [2022-02-20 19:59:38,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:38,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:38,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:38,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:38,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:38,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:38,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:38,780 INFO L87 Difference]: Start difference. First operand 650 states and 931 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,886 INFO L93 Difference]: Finished difference Result 1041 states and 1464 transitions. [2022-02-20 19:59:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 656 transitions. [2022-02-20 19:59:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 656 transitions. [2022-02-20 19:59:39,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 656 transitions. [2022-02-20 19:59:40,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:40,326 INFO L225 Difference]: With dead ends: 1041 [2022-02-20 19:59:40,326 INFO L226 Difference]: Without dead ends: 670 [2022-02-20 19:59:40,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:40,331 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 7 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:40,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2594 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-02-20 19:59:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 660. [2022-02-20 19:59:40,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:40,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 670 states. Second operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) [2022-02-20 19:59:40,354 INFO L74 IsIncluded]: Start isIncluded. First operand 670 states. Second operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) [2022-02-20 19:59:40,355 INFO L87 Difference]: Start difference. First operand 670 states. Second operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) [2022-02-20 19:59:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,377 INFO L93 Difference]: Finished difference Result 670 states and 955 transitions. [2022-02-20 19:59:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 955 transitions. [2022-02-20 19:59:40,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) Second operand 670 states. [2022-02-20 19:59:40,382 INFO L87 Difference]: Start difference. First operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) Second operand 670 states. [2022-02-20 19:59:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,401 INFO L93 Difference]: Finished difference Result 670 states and 955 transitions. [2022-02-20 19:59:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 955 transitions. [2022-02-20 19:59:40,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:40,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 543 states have (on average 1.430939226519337) internal successors, (777), 558 states have internal predecessors, (777), 69 states have call successors, (69), 35 states have call predecessors, (69), 46 states have return successors, (93), 71 states have call predecessors, (93), 66 states have call successors, (93) [2022-02-20 19:59:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 939 transitions. [2022-02-20 19:59:40,428 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 939 transitions. Word has length 59 [2022-02-20 19:59:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:40,428 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 939 transitions. [2022-02-20 19:59:40,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 939 transitions. [2022-02-20 19:59:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:40,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:40,430 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:40,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 19:59:40,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:40,639 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1860357331, now seen corresponding path program 1 times [2022-02-20 19:59:40,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:40,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600429971] [2022-02-20 19:59:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:40,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:40,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 19:59:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:40,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:40,858 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:40,859 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:40,862 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:40,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:40,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:41,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:41,067 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:41,069 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:41,136 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:41,136 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:41,140 INFO L158 Benchmark]: Toolchain (without parser) took 11874.78ms. Allocated memory was 48.2MB in the beginning and 142.6MB in the end (delta: 94.4MB). Free memory was 22.9MB in the beginning and 105.9MB in the end (delta: -83.0MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,140 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:41,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.95ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 22.7MB in the beginning and 36.0MB in the end (delta: -13.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.16ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 31.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,141 INFO L158 Benchmark]: Boogie Preprocessor took 91.78ms. Allocated memory is still 60.8MB. Free memory was 31.4MB in the beginning and 40.9MB in the end (delta: -9.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,141 INFO L158 Benchmark]: RCFGBuilder took 736.48ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.9MB in the beginning and 45.3MB in the end (delta: -4.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,141 INFO L158 Benchmark]: TraceAbstraction took 10585.92ms. Allocated memory was 73.4MB in the beginning and 142.6MB in the end (delta: 69.2MB). Free memory was 44.9MB in the beginning and 105.9MB in the end (delta: -60.9MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:41,143 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.95ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 22.7MB in the beginning and 36.0MB in the end (delta: -13.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.16ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 31.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.78ms. Allocated memory is still 60.8MB. Free memory was 31.4MB in the beginning and 40.9MB in the end (delta: -9.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * RCFGBuilder took 736.48ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 40.9MB in the beginning and 45.3MB in the end (delta: -4.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10585.92ms. Allocated memory was 73.4MB in the beginning and 142.6MB in the end (delta: 69.2MB). Free memory was 44.9MB in the beginning and 105.9MB in the end (delta: -60.9MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:41,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator