./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:33:10,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:33:10,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:33:10,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:33:10,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:33:10,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:33:10,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:33:10,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:33:10,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:33:10,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:33:10,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:33:10,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:33:10,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:33:10,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:33:10,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:33:10,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:33:10,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:33:10,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:33:10,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:33:10,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:33:10,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:33:10,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:33:10,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:33:10,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:33:10,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:33:10,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:33:10,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:33:10,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:33:10,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:33:10,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:33:10,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:33:10,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:33:10,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:33:10,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:33:10,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:33:10,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:33:10,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:33:10,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:33:10,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:33:10,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:33:10,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:33:10,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:33:10,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:33:10,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:33:10,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:33:10,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:33:10,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:33:10,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:33:10,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:33:10,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:33:10,240 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:33:10,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:33:10,241 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:33:10,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:33:10,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:33:10,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:33:10,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:33:10,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:33:10,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:33:10,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:33:10,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:33:10,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:33:10,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:33:10,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:33:10,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:33:10,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:33:10,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:33:10,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:33:10,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:33:10,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:33:10,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:33:10,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:33:10,246 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:33:10,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:33:10,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:33:10,247 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 [2022-11-18 19:33:10,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:33:10,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:33:10,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:33:10,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:33:10,564 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:33:10,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-11-18 19:33:10,653 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/data/2aa1a9ab0/af9d22da0d40469ba5473de1a49a5a34/FLAG9ee52ea4e [2022-11-18 19:33:11,145 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:33:11,146 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-11-18 19:33:11,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/data/2aa1a9ab0/af9d22da0d40469ba5473de1a49a5a34/FLAG9ee52ea4e [2022-11-18 19:33:11,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/data/2aa1a9ab0/af9d22da0d40469ba5473de1a49a5a34 [2022-11-18 19:33:11,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:33:11,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:33:11,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:33:11,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:33:11,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:33:11,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:33:11" (1/1) ... [2022-11-18 19:33:11,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768be453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:11, skipping insertion in model container [2022-11-18 19:33:11,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:33:11" (1/1) ... [2022-11-18 19:33:11,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:33:11,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:33:11,903 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[914,927] [2022-11-18 19:33:11,975 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[7125,7138] [2022-11-18 19:33:12,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:33:12,102 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:33:12,127 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[914,927] [2022-11-18 19:33:12,147 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[7125,7138] [2022-11-18 19:33:12,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:33:12,230 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:33:12,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12 WrapperNode [2022-11-18 19:33:12,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:33:12,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:33:12,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:33:12,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:33:12,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,364 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 983 [2022-11-18 19:33:12,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:33:12,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:33:12,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:33:12,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:33:12,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:33:12,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:33:12,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:33:12,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:33:12,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (1/1) ... [2022-11-18 19:33:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:33:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:12,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:33:12,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:33:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:33:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-18 19:33:12,530 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-18 19:33:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-18 19:33:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-18 19:33:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-18 19:33:12,533 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-18 19:33:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-18 19:33:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-18 19:33:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-18 19:33:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-18 19:33:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-18 19:33:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-18 19:33:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-18 19:33:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-18 19:33:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-18 19:33:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-18 19:33:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-18 19:33:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-18 19:33:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-18 19:33:12,536 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-18 19:33:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-18 19:33:12,537 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-18 19:33:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:33:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-18 19:33:12,537 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-18 19:33:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-18 19:33:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-18 19:33:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:33:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:33:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-18 19:33:12,539 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-18 19:33:12,719 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:33:12,721 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:33:13,931 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:33:13,943 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:33:13,943 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-18 19:33:13,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:13 BoogieIcfgContainer [2022-11-18 19:33:13,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:33:13,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:33:13,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:33:13,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:33:13,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:33:11" (1/3) ... [2022-11-18 19:33:13,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b5fb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:33:13, skipping insertion in model container [2022-11-18 19:33:13,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:33:12" (2/3) ... [2022-11-18 19:33:13,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b5fb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:33:13, skipping insertion in model container [2022-11-18 19:33:13,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:13" (3/3) ... [2022-11-18 19:33:13,955 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2022-11-18 19:33:13,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:33:13,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:33:14,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:33:14,054 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3294c7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:33:14,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 19:33:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-18 19:33:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:14,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:14,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:14,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2137736078, now seen corresponding path program 1 times [2022-11-18 19:33:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205838232] [2022-11-18 19:33:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205838232] [2022-11-18 19:33:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205838232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:14,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:14,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:33:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131554848] [2022-11-18 19:33:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:14,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:33:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:33:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:33:14,695 INFO L87 Difference]: Start difference. First operand has 459 states, 402 states have (on average 1.63681592039801) internal successors, (658), 409 states have internal predecessors, (658), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:16,543 INFO L93 Difference]: Finished difference Result 1027 states and 1638 transitions. [2022-11-18 19:33:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:33:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-11-18 19:33:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:16,562 INFO L225 Difference]: With dead ends: 1027 [2022-11-18 19:33:16,562 INFO L226 Difference]: Without dead ends: 585 [2022-11-18 19:33:16,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:33:16,572 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 1477 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:16,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1700 Invalid, 1536 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [243 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:33:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-11-18 19:33:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 545. [2022-11-18 19:33:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 470 states have (on average 1.5212765957446808) internal successors, (715), 477 states have internal predecessors, (715), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-11-18 19:33:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 819 transitions. [2022-11-18 19:33:16,674 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 819 transitions. Word has length 59 [2022-11-18 19:33:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:16,675 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 819 transitions. [2022-11-18 19:33:16,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 819 transitions. [2022-11-18 19:33:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:16,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:16,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:16,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:33:16,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1917902258, now seen corresponding path program 1 times [2022-11-18 19:33:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385763161] [2022-11-18 19:33:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:16,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:16,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385763161] [2022-11-18 19:33:16,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385763161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:16,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:16,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:33:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020811406] [2022-11-18 19:33:16,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:16,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:33:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:33:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:33:16,975 INFO L87 Difference]: Start difference. First operand 545 states and 819 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:18,648 INFO L93 Difference]: Finished difference Result 894 states and 1298 transitions. [2022-11-18 19:33:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:33:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-11-18 19:33:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:18,655 INFO L225 Difference]: With dead ends: 894 [2022-11-18 19:33:18,655 INFO L226 Difference]: Without dead ends: 716 [2022-11-18 19:33:18,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:33:18,658 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 1341 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:18,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 2245 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:33:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-11-18 19:33:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 641. [2022-11-18 19:33:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 546 states have (on average 1.5) internal successors, (819), 555 states have internal predecessors, (819), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-11-18 19:33:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2022-11-18 19:33:18,720 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 59 [2022-11-18 19:33:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:18,720 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2022-11-18 19:33:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2022-11-18 19:33:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:18,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:18,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:33:18,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1024415920, now seen corresponding path program 1 times [2022-11-18 19:33:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:18,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855379235] [2022-11-18 19:33:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:18,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855379235] [2022-11-18 19:33:18,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855379235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:18,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:18,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:33:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737004011] [2022-11-18 19:33:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:18,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:33:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:33:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:33:18,946 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 19:33:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:20,571 INFO L93 Difference]: Finished difference Result 943 states and 1368 transitions. [2022-11-18 19:33:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:33:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-11-18 19:33:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:20,576 INFO L225 Difference]: With dead ends: 943 [2022-11-18 19:33:20,576 INFO L226 Difference]: Without dead ends: 675 [2022-11-18 19:33:20,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:33:20,579 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 616 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:20,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2693 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:33:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-11-18 19:33:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 646. [2022-11-18 19:33:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 559 states have internal predecessors, (821), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2022-11-18 19:33:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 956 transitions. [2022-11-18 19:33:20,626 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 956 transitions. Word has length 59 [2022-11-18 19:33:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:20,627 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 956 transitions. [2022-11-18 19:33:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 19:33:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 956 transitions. [2022-11-18 19:33:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:20,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:20,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:20,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:33:20,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -749656306, now seen corresponding path program 1 times [2022-11-18 19:33:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:20,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359880320] [2022-11-18 19:33:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359880320] [2022-11-18 19:33:20,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359880320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:20,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:20,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:33:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678494258] [2022-11-18 19:33:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:20,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:33:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:33:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:33:20,832 INFO L87 Difference]: Start difference. First operand 646 states and 956 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 19:33:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:23,393 INFO L93 Difference]: Finished difference Result 1982 states and 2762 transitions. [2022-11-18 19:33:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 19:33:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-11-18 19:33:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:23,403 INFO L225 Difference]: With dead ends: 1982 [2022-11-18 19:33:23,403 INFO L226 Difference]: Without dead ends: 1691 [2022-11-18 19:33:23,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 19:33:23,406 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 3489 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:23,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3503 Valid, 2505 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-18 19:33:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-11-18 19:33:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1547. [2022-11-18 19:33:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1265 states have (on average 1.391304347826087) internal successors, (1760), 1289 states have internal predecessors, (1760), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2022-11-18 19:33:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2097 transitions. [2022-11-18 19:33:23,556 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2097 transitions. Word has length 59 [2022-11-18 19:33:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:23,557 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2097 transitions. [2022-11-18 19:33:23,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 19:33:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2097 transitions. [2022-11-18 19:33:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:23,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:23,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:23,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:33:23,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1721330993, now seen corresponding path program 1 times [2022-11-18 19:33:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426211237] [2022-11-18 19:33:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:23,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426211237] [2022-11-18 19:33:23,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426211237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:23,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:23,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:33:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135960734] [2022-11-18 19:33:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:23,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:33:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:33:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:33:23,783 INFO L87 Difference]: Start difference. First operand 1547 states and 2097 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 19:33:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:25,531 INFO L93 Difference]: Finished difference Result 2839 states and 3771 transitions. [2022-11-18 19:33:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:33:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-11-18 19:33:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:25,540 INFO L225 Difference]: With dead ends: 2839 [2022-11-18 19:33:25,540 INFO L226 Difference]: Without dead ends: 1653 [2022-11-18 19:33:25,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:33:25,549 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 618 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:25,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2690 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:33:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-11-18 19:33:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1577. [2022-11-18 19:33:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1289 states have (on average 1.377812257564003) internal successors, (1776), 1313 states have internal predecessors, (1776), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2022-11-18 19:33:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2119 transitions. [2022-11-18 19:33:25,717 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2119 transitions. Word has length 59 [2022-11-18 19:33:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:25,717 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2119 transitions. [2022-11-18 19:33:25,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 19:33:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2119 transitions. [2022-11-18 19:33:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:25,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:25,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:25,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:33:25,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash 768197969, now seen corresponding path program 1 times [2022-11-18 19:33:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:25,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791259306] [2022-11-18 19:33:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-18 19:33:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 19:33:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:33:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:33:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 19:33:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 19:33:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 19:33:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791259306] [2022-11-18 19:33:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791259306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:25,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:25,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:33:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161711303] [2022-11-18 19:33:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:25,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:33:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:33:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:33:25,965 INFO L87 Difference]: Start difference. First operand 1577 states and 2119 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:27,479 INFO L93 Difference]: Finished difference Result 2834 states and 3668 transitions. [2022-11-18 19:33:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:33:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-11-18 19:33:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:27,490 INFO L225 Difference]: With dead ends: 2834 [2022-11-18 19:33:27,490 INFO L226 Difference]: Without dead ends: 1841 [2022-11-18 19:33:27,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:33:27,504 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 1686 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:27,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1673 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 19:33:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-11-18 19:33:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1519. [2022-11-18 19:33:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1247 states have (on average 1.3753007217321571) internal successors, (1715), 1266 states have internal predecessors, (1715), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2022-11-18 19:33:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2037 transitions. [2022-11-18 19:33:27,611 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2037 transitions. Word has length 59 [2022-11-18 19:33:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:27,613 INFO L495 AbstractCegarLoop]: Abstraction has 1519 states and 2037 transitions. [2022-11-18 19:33:27,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 19:33:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2037 transitions. [2022-11-18 19:33:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:33:27,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:27,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:27,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:33:27,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1225946737, now seen corresponding path program 1 times [2022-11-18 19:33:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53576979] [2022-11-18 19:33:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:33:27,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:33:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:33:27,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:33:27,716 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:33:27,717 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-18 19:33:27,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-18 19:33:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:33:27,725 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:27,734 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:33:27,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:33:27 BoogieIcfgContainer [2022-11-18 19:33:27,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:33:27,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:33:27,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:33:27,856 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:33:27,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:33:13" (3/4) ... [2022-11-18 19:33:27,863 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:33:27,974 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:33:27,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:33:27,975 INFO L158 Benchmark]: Toolchain (without parser) took 16323.16ms. Allocated memory was 94.4MB in the beginning and 239.1MB in the end (delta: 144.7MB). Free memory was 57.7MB in the beginning and 171.1MB in the end (delta: -113.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,976 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 67.5MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:33:27,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.67ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 98.4MB in the end (delta: -41.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.19ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 93.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,977 INFO L158 Benchmark]: Boogie Preprocessor took 70.68ms. Allocated memory is still 136.3MB. Free memory was 93.3MB in the beginning and 89.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,977 INFO L158 Benchmark]: RCFGBuilder took 1509.54ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 100.4MB in the end (delta: -11.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,978 INFO L158 Benchmark]: TraceAbstraction took 13907.40ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 100.1MB in the beginning and 185.8MB in the end (delta: -85.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,978 INFO L158 Benchmark]: Witness Printer took 118.89ms. Allocated memory is still 239.1MB. Free memory was 185.8MB in the beginning and 171.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 19:33:27,980 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.28ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 67.5MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.67ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 98.4MB in the end (delta: -41.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.19ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 93.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.68ms. Allocated memory is still 136.3MB. Free memory was 93.3MB in the beginning and 89.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1509.54ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 100.4MB in the end (delta: -11.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13907.40ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 100.1MB in the beginning and 185.8MB in the end (delta: -85.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 118.89ms. Allocated memory is still 239.1MB. Free memory was 185.8MB in the beginning and 171.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: [L540] int T4_E = 2; [L518] int t6_st ; [L538] int T2_E = 2; [L35] int q_read_ev ; [L535] int t11_i ; [L503] int t3_pc = 0; [L38] int q_ev ; [L547] int T11_E = 2; [L66] int c_dr_st ; [L68] int c_dr_i ; [L544] int T8_E = 2; [L542] int T6_E = 2; [L507] int t7_pc = 0; [L524] int m_i ; [L172] static int a_t ; [L530] int t6_i ; [L515] int t3_st ; [L532] int t8_i ; [L526] int t2_i ; [L62] int p_dw_pc ; [L528] int t4_i ; [L519] int t7_st ; [L63] int p_dw_i ; [L510] int t10_pc = 0; [L504] int t4_pc = 0; [L67] int c_dr_pc ; [L508] int t8_pc = 0; [L522] int t10_st ; [L549] int E_1 = 2; [L500] int m_pc = 0; [L551] int E_3 = 2; [L550] int E_2 = 2; [L553] int E_5 = 2; [L516] int t4_st ; [L552] int E_4 = 2; [L555] int E_7 = 2; [L64] int c_num_read ; [L554] int E_6 = 2; [L557] int E_9 = 2; [L556] int E_8 = 2; [L541] int T5_E = 2; [L512] int m_st ; [L520] int t8_st ; [L511] int t11_pc = 0; [L539] int T3_E = 2; [L34] int q_free ; [L534] int t10_i ; [L537] int T1_E = 2; [L37] int q_req_up ; [L545] int T9_E = 2; [L505] int t5_pc = 0; [L33] int q_buf_0 ; [L543] int T7_E = 2; [L575] int local ; [L501] int t1_pc = 0; [L546] int T10_E = 2; [L523] int t11_st ; [L59] int p_num_write ; [L525] int t1_i ; [L536] int M_E = 2; [L548] int E_M = 2; [L509] int t9_pc = 0; [L531] int t7_i ; [L513] int t1_st ; [L533] int t9_i ; [L527] int t3_i ; [L36] int q_write_ev ; [L529] int t5_i ; [L517] int t5_st ; [L521] int t9_st ; [L506] int t6_pc = 0; [L502] int t2_pc = 0; [L573] int token ; [L61] int p_dw_st ; [L65] int c_last_read ; [L514] int t2_st ; [L558] int E_10 = 2; [L559] int E_11 = 2; [L60] int p_last_write ; 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_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, 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] [L2212] COND TRUE __VERIFIER_nondet_int() [L2213] 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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, 459 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9307 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9227 mSDsluCounter, 13506 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11089 mSDsCounter, 1339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10207 IncrementalHoareTripleChecker+Invalid, 11546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1339 mSolverCounterUnsat, 2417 mSDtfsCounter, 10207 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1577occurred 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.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 686 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 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! [2022-11-18 19:33:28,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9ee53ff-25a3-4c33-bbde-06849a9fdf46/bin/uautomizer-TMbwUNV5ro/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