./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:14:30,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:14:30,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:14:30,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:14:30,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:14:30,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:14:30,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:14:30,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:14:30,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:14:30,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:14:30,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:14:30,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:14:30,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:14:30,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:14:30,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:14:30,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:14:30,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:14:30,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:14:30,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:14:30,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:14:30,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:14:30,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:14:30,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:14:30,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:14:30,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:14:30,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:14:30,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:14:30,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:14:30,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:14:30,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:14:30,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:14:30,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:14:30,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:14:30,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:14:30,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:14:30,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:14:30,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:14:30,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:14:30,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:14:30,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:14:30,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:14:30,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:14:30,958 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:14:30,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:14:30,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:14:30,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:14:30,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:14:30,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:14:30,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:14:30,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:14:30,960 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:14:30,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:14:30,961 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:14:30,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:14:30,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:14:30,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:14:30,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:14:30,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:14:30,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:14:30,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:14:30,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:30,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:14:30,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:14:30,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:14:30,966 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:14:30,966 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 -> afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba [2021-12-22 13:14:31,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:14:31,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:14:31,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:14:31,166 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:14:31,167 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:14:31,168 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.12.cil-2.c [2021-12-22 13:14:31,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5fe0fca5/e9e0a57622ae4132bdf4b94a7b3f102c/FLAG71e811f51 [2021-12-22 13:14:31,628 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:14:31,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2021-12-22 13:14:31,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5fe0fca5/e9e0a57622ae4132bdf4b94a7b3f102c/FLAG71e811f51 [2021-12-22 13:14:31,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5fe0fca5/e9e0a57622ae4132bdf4b94a7b3f102c [2021-12-22 13:14:31,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:14:31,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:14:31,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:31,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:14:31,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:14:31,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:31" (1/1) ... [2021-12-22 13:14:31,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbbb8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:31, skipping insertion in model container [2021-12-22 13:14:31,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:31" (1/1) ... [2021-12-22 13:14:31,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:14:32,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:14:32,141 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.12.cil-2.c[914,927] [2021-12-22 13:14:32,205 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.12.cil-2.c[7125,7138] [2021-12-22 13:14:32,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:32,329 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:14:32,338 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.12.cil-2.c[914,927] [2021-12-22 13:14:32,360 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.12.cil-2.c[7125,7138] [2021-12-22 13:14:32,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:32,413 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:14:32,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32 WrapperNode [2021-12-22 13:14:32,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:32,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:32,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:14:32,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:14:32,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,481 INFO L137 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1041 [2021-12-22 13:14:32,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:32,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:14:32,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:14:32,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:14:32,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:14:32,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:14:32,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:14:32,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:14:32,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (1/1) ... [2021-12-22 13:14:32,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:32,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:32,584 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) [2021-12-22 13:14:32,586 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 [2021-12-22 13:14:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:14:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-22 13:14:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-22 13:14:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 13:14:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 13:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-22 13:14:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-22 13:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-22 13:14:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-22 13:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-22 13:14:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-22 13:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-22 13:14:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-22 13:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-22 13:14:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-22 13:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-22 13:14:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-22 13:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 13:14:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 13:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-22 13:14:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-22 13:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-22 13:14:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-22 13:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-22 13:14:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-22 13:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-22 13:14:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-22 13:14:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:14:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:14:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-22 13:14:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-22 13:14:32,735 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:14:32,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:14:33,345 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:14:33,358 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:14:33,358 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-12-22 13:14:33,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:33 BoogieIcfgContainer [2021-12-22 13:14:33,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:14:33,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:14:33,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:14:33,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:14:33,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:14:31" (1/3) ... [2021-12-22 13:14:33,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfbc2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:33, skipping insertion in model container [2021-12-22 13:14:33,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:32" (2/3) ... [2021-12-22 13:14:33,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfbc2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:33, skipping insertion in model container [2021-12-22 13:14:33,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:33" (3/3) ... [2021-12-22 13:14:33,368 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2021-12-22 13:14:33,372 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:14:33,372 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:14:33,407 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:14:33,412 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 [2021-12-22 13:14:33,413 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 13:14:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-22 13:14:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:33,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:33,437 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] [2021-12-22 13:14:33,438 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -322783681, now seen corresponding path program 1 times [2021-12-22 13:14:33,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:33,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115052885] [2021-12-22 13:14:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:33,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:33,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:33,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115052885] [2021-12-22 13:14:33,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115052885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:33,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:33,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:33,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410306490] [2021-12-22 13:14:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:33,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:33,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:33,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:33,799 INFO L87 Difference]: Start difference. First operand has 484 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 433 states have internal predecessors, (699), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) 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) [2021-12-22 13:14:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:34,750 INFO L93 Difference]: Finished difference Result 1076 states and 1722 transitions. [2021-12-22 13:14:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:14:34,752 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 [2021-12-22 13:14:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:34,763 INFO L225 Difference]: With dead ends: 1076 [2021-12-22 13:14:34,764 INFO L226 Difference]: Without dead ends: 610 [2021-12-22 13:14:34,768 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 [2021-12-22 13:14:34,771 INFO L933 BasicCegarLoop]: 754 mSDtfsCounter, 1210 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:34,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1215 Valid, 2567 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 13:14:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-12-22 13:14:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 570. [2021-12-22 13:14:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 501 states have internal predecessors, (754), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-22 13:14:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 860 transitions. [2021-12-22 13:14:34,835 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 860 transitions. Word has length 59 [2021-12-22 13:14:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:34,836 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 860 transitions. [2021-12-22 13:14:34,836 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) [2021-12-22 13:14:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 860 transitions. [2021-12-22 13:14:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:34,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:34,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:34,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:14:34,839 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1605489021, now seen corresponding path program 1 times [2021-12-22 13:14:34,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:34,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494079161] [2021-12-22 13:14:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:34,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:34,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:34,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494079161] [2021-12-22 13:14:34,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494079161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:34,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:34,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:34,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819920726] [2021-12-22 13:14:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:34,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:34,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:34,962 INFO L87 Difference]: Start difference. First operand 570 states and 860 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) [2021-12-22 13:14:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:35,842 INFO L93 Difference]: Finished difference Result 919 states and 1339 transitions. [2021-12-22 13:14:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:14:35,843 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 [2021-12-22 13:14:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:35,848 INFO L225 Difference]: With dead ends: 919 [2021-12-22 13:14:35,848 INFO L226 Difference]: Without dead ends: 741 [2021-12-22 13:14:35,851 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 [2021-12-22 13:14:35,853 INFO L933 BasicCegarLoop]: 776 mSDtfsCounter, 1433 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:35,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1465 Valid, 2747 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 13:14:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-12-22 13:14:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 666. [2021-12-22 13:14:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 579 states have internal predecessors, (858), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2021-12-22 13:14:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 994 transitions. [2021-12-22 13:14:35,893 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 994 transitions. Word has length 59 [2021-12-22 13:14:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:35,894 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 994 transitions. [2021-12-22 13:14:35,894 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) [2021-12-22 13:14:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 994 transitions. [2021-12-22 13:14:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:35,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:35,896 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] [2021-12-22 13:14:35,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:14:35,897 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1795991937, now seen corresponding path program 1 times [2021-12-22 13:14:35,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:35,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84280087] [2021-12-22 13:14:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:35,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:35,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84280087] [2021-12-22 13:14:36,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84280087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:36,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:36,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:36,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807785415] [2021-12-22 13:14:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:36,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:36,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:36,002 INFO L87 Difference]: Start difference. First operand 666 states and 994 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) [2021-12-22 13:14:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:37,022 INFO L93 Difference]: Finished difference Result 968 states and 1409 transitions. [2021-12-22 13:14:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:14:37,024 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 [2021-12-22 13:14:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:37,029 INFO L225 Difference]: With dead ends: 968 [2021-12-22 13:14:37,029 INFO L226 Difference]: Without dead ends: 700 [2021-12-22 13:14:37,031 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 [2021-12-22 13:14:37,035 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 968 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:37,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 3010 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-22 13:14:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-12-22 13:14:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 671. [2021-12-22 13:14:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 583 states have internal predecessors, (860), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2021-12-22 13:14:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 997 transitions. [2021-12-22 13:14:37,064 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 997 transitions. Word has length 59 [2021-12-22 13:14:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:37,064 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 997 transitions. [2021-12-22 13:14:37,064 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) [2021-12-22 13:14:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 997 transitions. [2021-12-22 13:14:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:37,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:37,066 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] [2021-12-22 13:14:37,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:14:37,067 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1521232323, now seen corresponding path program 1 times [2021-12-22 13:14:37,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:37,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934365571] [2021-12-22 13:14:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:37,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:37,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:37,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934365571] [2021-12-22 13:14:37,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934365571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:37,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:37,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:14:37,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804664009] [2021-12-22 13:14:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:37,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:14:37,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:14:37,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:37,156 INFO L87 Difference]: Start difference. First operand 671 states and 997 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) [2021-12-22 13:14:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:38,637 INFO L93 Difference]: Finished difference Result 2007 states and 2803 transitions. [2021-12-22 13:14:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 13:14:38,638 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 [2021-12-22 13:14:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:38,645 INFO L225 Difference]: With dead ends: 2007 [2021-12-22 13:14:38,645 INFO L226 Difference]: Without dead ends: 1716 [2021-12-22 13:14:38,647 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 [2021-12-22 13:14:38,651 INFO L933 BasicCegarLoop]: 821 mSDtfsCounter, 3618 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3632 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:38,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3632 Valid, 3010 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-22 13:14:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2021-12-22 13:14:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1572. [2021-12-22 13:14:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1313 states have internal predecessors, (1799), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2021-12-22 13:14:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2138 transitions. [2021-12-22 13:14:38,712 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2138 transitions. Word has length 59 [2021-12-22 13:14:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:38,712 INFO L470 AbstractCegarLoop]: Abstraction has 1572 states and 2138 transitions. [2021-12-22 13:14:38,713 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) [2021-12-22 13:14:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2138 transitions. [2021-12-22 13:14:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:38,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:38,717 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] [2021-12-22 13:14:38,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:14:38,717 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1802060286, now seen corresponding path program 1 times [2021-12-22 13:14:38,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:38,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780418320] [2021-12-22 13:14:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:38,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:38,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780418320] [2021-12-22 13:14:38,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780418320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:38,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:38,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:38,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879109135] [2021-12-22 13:14:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:38,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:38,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:38,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:38,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:38,824 INFO L87 Difference]: Start difference. First operand 1572 states and 2138 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) [2021-12-22 13:14:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:39,811 INFO L93 Difference]: Finished difference Result 2864 states and 3812 transitions. [2021-12-22 13:14:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:14:39,812 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 [2021-12-22 13:14:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:39,818 INFO L225 Difference]: With dead ends: 2864 [2021-12-22 13:14:39,818 INFO L226 Difference]: Without dead ends: 1678 [2021-12-22 13:14:39,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:14:39,822 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 969 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:39,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 2990 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-22 13:14:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2021-12-22 13:14:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1602. [2021-12-22 13:14:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1337 states have internal predecessors, (1815), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2021-12-22 13:14:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2160 transitions. [2021-12-22 13:14:39,889 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2160 transitions. Word has length 59 [2021-12-22 13:14:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:39,890 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 2160 transitions. [2021-12-22 13:14:39,890 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) [2021-12-22 13:14:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2160 transitions. [2021-12-22 13:14:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:39,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:39,891 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] [2021-12-22 13:14:39,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:14:39,891 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash -3378048, now seen corresponding path program 1 times [2021-12-22 13:14:39,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893044281] [2021-12-22 13:14:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:39,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:39,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893044281] [2021-12-22 13:14:39,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893044281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:39,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:39,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:39,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681939456] [2021-12-22 13:14:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:39,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:39,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:39,973 INFO L87 Difference]: Start difference. First operand 1602 states and 2160 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) [2021-12-22 13:14:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:40,739 INFO L93 Difference]: Finished difference Result 2859 states and 3709 transitions. [2021-12-22 13:14:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:14:40,740 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 [2021-12-22 13:14:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:40,746 INFO L225 Difference]: With dead ends: 2859 [2021-12-22 13:14:40,746 INFO L226 Difference]: Without dead ends: 1866 [2021-12-22 13:14:40,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:14:40,749 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 1784 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:40,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1813 Valid, 2120 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 13:14:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2021-12-22 13:14:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1544. [2021-12-22 13:14:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1290 states have internal predecessors, (1754), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2021-12-22 13:14:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2078 transitions. [2021-12-22 13:14:40,826 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2078 transitions. Word has length 59 [2021-12-22 13:14:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:40,826 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 2078 transitions. [2021-12-22 13:14:40,827 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) [2021-12-22 13:14:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2078 transitions. [2021-12-22 13:14:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:40,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:40,828 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] [2021-12-22 13:14:40,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:14:40,828 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1997522754, now seen corresponding path program 1 times [2021-12-22 13:14:40,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:40,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357784484] [2021-12-22 13:14:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:40,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:40,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:14:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:40,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:14:40,875 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:14:40,875 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 13:14:40,877 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 13:14:40,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:14:40,879 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:40,882 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:14:40,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:14:40 BoogieIcfgContainer [2021-12-22 13:14:40,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:14:40,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:14:40,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:14:40,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:14:40,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:33" (3/4) ... [2021-12-22 13:14:40,964 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:14:41,031 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:14:41,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:14:41,032 INFO L158 Benchmark]: Toolchain (without parser) took 9074.82ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 75.3MB in the beginning and 162.0MB in the end (delta: -86.6MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,032 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 42.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:14:41,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.52ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 70.6MB in the end (delta: 4.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.34ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 65.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,033 INFO L158 Benchmark]: Boogie Preprocessor took 50.63ms. Allocated memory is still 107.0MB. Free memory was 65.9MB in the beginning and 61.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,033 INFO L158 Benchmark]: RCFGBuilder took 821.12ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 56.1MB in the end (delta: 5.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,033 INFO L158 Benchmark]: TraceAbstraction took 7599.21ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 55.6MB in the beginning and 184.0MB in the end (delta: -128.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,034 INFO L158 Benchmark]: Witness Printer took 69.71ms. Allocated memory is still 249.6MB. Free memory was 184.0MB in the beginning and 162.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:41,035 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 42.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.52ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 70.6MB in the end (delta: 4.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.34ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 65.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.63ms. Allocated memory is still 107.0MB. Free memory was 65.9MB in the beginning and 61.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 821.12ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 56.1MB in the end (delta: 5.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7599.21ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 55.6MB in the beginning and 184.0MB in the end (delta: -128.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 69.71ms. Allocated memory is still 249.6MB. Free memory was 184.0MB in the beginning and 162.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.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 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int t9_pc = 0; [L510] int t10_pc = 0; [L511] int t11_pc = 0; [L512] int t12_pc = 0; [L513] int m_st ; [L514] int t1_st ; [L515] int t2_st ; [L516] int t3_st ; [L517] int t4_st ; [L518] int t5_st ; [L519] int t6_st ; [L520] int t7_st ; [L521] int t8_st ; [L522] int t9_st ; [L523] int t10_st ; [L524] int t11_st ; [L525] int t12_st ; [L526] int m_i ; [L527] int t1_i ; [L528] int t2_i ; [L529] int t3_i ; [L530] int t4_i ; [L531] int t5_i ; [L532] int t6_i ; [L533] int t7_i ; [L534] int t8_i ; [L535] int t9_i ; [L536] int t10_i ; [L537] int t11_i ; [L538] int t12_i ; [L539] int M_E = 2; [L540] int T1_E = 2; [L541] int T2_E = 2; [L542] int T3_E = 2; [L543] int T4_E = 2; [L544] int T5_E = 2; [L545] int T6_E = 2; [L546] int T7_E = 2; [L547] int T8_E = 2; [L548] int T9_E = 2; [L549] int T10_E = 2; [L550] int T11_E = 2; [L551] int T12_E = 2; [L552] int E_M = 2; [L553] int E_1 = 2; [L554] int E_2 = 2; [L555] int E_3 = 2; [L556] int E_4 = 2; [L557] int E_5 = 2; [L558] int E_6 = 2; [L559] int E_7 = 2; [L560] int E_8 = 2; [L561] int E_9 = 2; [L562] int E_10 = 2; [L563] int E_11 = 2; [L564] int E_12 = 2; [L579] int token ; [L581] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L2337] COND TRUE __VERIFIER_nondet_int() [L2338] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_10=2, E_11=2, E_12=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T10_E=2, t10_i=0, t10_pc=0, t10_st=0, T11_E=2, t11_i=0, t11_pc=0, t11_st=0, T12_E=2, t12_i=0, t12_pc=0, t12_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, T8_E=2, t8_i=0, t8_pc=0, t8_st=0, T9_E=2, t9_i=0, t9_pc=0, t9_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 484 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10065 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9982 mSDsluCounter, 16444 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11948 mSDsCounter, 1485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8132 IncrementalHoareTripleChecker+Invalid, 9617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1485 mSolverCounterUnsat, 4496 mSDtfsCounter, 8132 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1602occurred in iteration=5, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 686 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-22 13:14:41,092 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE