./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN --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 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --- 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-6b4ec56 [2022-11-20 10:54:21,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:54:21,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:54:21,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:54:21,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:54:21,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:54:21,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:54:21,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:54:21,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:54:21,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:54:21,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:54:21,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:54:21,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:54:21,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:54:21,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:54:21,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:54:21,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:54:21,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:54:21,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:54:21,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:54:21,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:54:21,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:54:21,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:54:21,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:54:21,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:54:21,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:54:21,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:54:21,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:54:21,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:54:21,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:54:21,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:54:21,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:54:21,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:54:21,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:54:21,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:54:21,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:54:21,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:54:21,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:54:21,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:54:21,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:54:21,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:54:21,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:54:21,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:54:21,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:54:21,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:54:21,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:54:21,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:54:21,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:54:21,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:54:21,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:54:21,665 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:54:21,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:54:21,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:54:21,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:54:21,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:54:21,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:54:21,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:54:21,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:54:21,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:54:21,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:54:21,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:54:21,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:54:21,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:54:21,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:54:21,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:54:21,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:54:21,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:54:21,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:54:21,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:54:21,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:54:21,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:54:21,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:54:21,671 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:54:21,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:54:21,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:54:21,672 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_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/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_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 [2022-11-20 10:54:21,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:54:21,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:54:21,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:54:21,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:54:21,998 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:54:21,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2022-11-20 10:54:24,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:54:25,252 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:54:25,253 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2022-11-20 10:54:25,278 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/data/5d38ff827/c5d4e710200d42bcbbd4a4beb0d88f98/FLAG6a81048e2 [2022-11-20 10:54:25,295 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/data/5d38ff827/c5d4e710200d42bcbbd4a4beb0d88f98 [2022-11-20 10:54:25,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:54:25,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:54:25,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:54:25,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:54:25,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:54:25,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d1c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25, skipping insertion in model container [2022-11-20 10:54:25,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:54:25,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:54:25,535 WARN L237 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_2b3a0a00-b25c-44f8-930e-4f899728fb27/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2022-11-20 10:54:25,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:54:25,837 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:54:25,849 WARN L237 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_2b3a0a00-b25c-44f8-930e-4f899728fb27/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2022-11-20 10:54:25,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:54:25,928 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:54:25,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25 WrapperNode [2022-11-20 10:54:25,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:54:25,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:54:25,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:54:25,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:54:25,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,978 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-20 10:54:25,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:54:25,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:54:25,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:54:25,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:54:25,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:25,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:54:26,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:54:26,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:54:26,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:54:26,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (1/1) ... [2022-11-20 10:54:26,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:54:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:54:26,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:54:26,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:54:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:54:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:54:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:54:26,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:54:26,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:54:26,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:54:26,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:54:26,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:54:26,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:54:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:54:26,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:54:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 10:54:26,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 10:54:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:54:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:54:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:54:26,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:54:26,112 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:54:26,351 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:54:26,359 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:54:26,828 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:54:27,124 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:54:27,124 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:54:27,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:54:27 BoogieIcfgContainer [2022-11-20 10:54:27,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:54:27,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:54:27,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:54:27,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:54:27,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:54:25" (1/3) ... [2022-11-20 10:54:27,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:54:27, skipping insertion in model container [2022-11-20 10:54:27,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:25" (2/3) ... [2022-11-20 10:54:27,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:54:27, skipping insertion in model container [2022-11-20 10:54:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:54:27" (3/3) ... [2022-11-20 10:54:27,136 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2022-11-20 10:54:27,146 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:54:27,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:54:27,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:54:27,158 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:54:27,224 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:54:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-11-20 10:54:27,330 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-20 10:54:27,333 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:54:27,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-20 10:54:27,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2022-11-20 10:54:27,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2022-11-20 10:54:27,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:54:27,362 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;@f8083c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:54:27,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 10:54:27,377 INFO L130 PetriNetUnfolder]: 0/53 cut-off events. [2022-11-20 10:54:27,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:54:27,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:27,379 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-20 10:54:27,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -236676231, now seen corresponding path program 1 times [2022-11-20 10:54:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:27,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890613595] [2022-11-20 10:54:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:27,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:54:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:28,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890613595] [2022-11-20 10:54:28,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890613595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:28,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:28,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:54:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541009735] [2022-11-20 10:54:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:54:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:54:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:54:28,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 141 [2022-11-20 10:54:28,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:28,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:28,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 141 [2022-11-20 10:54:28,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:28,449 INFO L130 PetriNetUnfolder]: 162/551 cut-off events. [2022-11-20 10:54:28,450 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-20 10:54:28,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 551 events. 162/551 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2903 event pairs, 34 based on Foata normal form. 53/577 useless extension candidates. Maximal degree in co-relation 797. Up to 191 conditions per place. [2022-11-20 10:54:28,464 INFO L137 encePairwiseOnDemand]: 136/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2022-11-20 10:54:28,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 343 flow [2022-11-20 10:54:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:54:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:54:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2022-11-20 10:54:28,486 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2022-11-20 10:54:28,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2022-11-20 10:54:28,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2022-11-20 10:54:28,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:28,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2022-11-20 10:54:28,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:28,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:28,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:28,509 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 286 flow. Second operand 3 states and 400 transitions. [2022-11-20 10:54:28,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 343 flow [2022-11-20 10:54:28,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:54:28,520 INFO L231 Difference]: Finished difference. Result has 144 places, 133 transitions, 278 flow [2022-11-20 10:54:28,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=144, PETRI_TRANSITIONS=133} [2022-11-20 10:54:28,528 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-11-20 10:54:28,529 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 133 transitions, 278 flow [2022-11-20 10:54:28,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:28,529 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:28,530 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 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-20 10:54:28,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:54:28,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 769733276, now seen corresponding path program 1 times [2022-11-20 10:54:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:28,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465130528] [2022-11-20 10:54:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:29,254 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-20 10:54:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:29,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465130528] [2022-11-20 10:54:29,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465130528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:29,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:29,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:54:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280974182] [2022-11-20 10:54:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:29,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:54:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:54:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:54:29,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-20 10:54:29,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:29,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:29,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-20 10:54:29,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:32,459 INFO L130 PetriNetUnfolder]: 6164/13885 cut-off events. [2022-11-20 10:54:32,460 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2022-11-20 10:54:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23043 conditions, 13885 events. 6164/13885 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 131796 event pairs, 868 based on Foata normal form. 0/13643 useless extension candidates. Maximal degree in co-relation 22979. Up to 4372 conditions per place. [2022-11-20 10:54:32,558 INFO L137 encePairwiseOnDemand]: 133/141 looper letters, 33 selfloop transitions, 4 changer transitions 80/208 dead transitions. [2022-11-20 10:54:32,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 208 transitions, 650 flow [2022-11-20 10:54:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:54:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:54:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1186 transitions. [2022-11-20 10:54:32,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8411347517730496 [2022-11-20 10:54:32,562 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1186 transitions. [2022-11-20 10:54:32,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1186 transitions. [2022-11-20 10:54:32,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:32,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1186 transitions. [2022-11-20 10:54:32,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.6) internal successors, (1186), 10 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:32,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:32,571 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:32,572 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 10 states and 1186 transitions. [2022-11-20 10:54:32,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 208 transitions, 650 flow [2022-11-20 10:54:32,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 208 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:54:32,580 INFO L231 Difference]: Finished difference. Result has 158 places, 119 transitions, 270 flow [2022-11-20 10:54:32,580 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2022-11-20 10:54:32,581 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 10 predicate places. [2022-11-20 10:54:32,581 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 270 flow [2022-11-20 10:54:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:32,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:32,583 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:32,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:54:32,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1868264631, now seen corresponding path program 1 times [2022-11-20 10:54:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:32,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302336972] [2022-11-20 10:54:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:54:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302336972] [2022-11-20 10:54:33,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302336972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:33,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:33,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:54:33,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859140131] [2022-11-20 10:54:33,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:33,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:54:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:54:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:54:33,012 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-20 10:54:33,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:33,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:33,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-20 10:54:33,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:34,777 INFO L130 PetriNetUnfolder]: 4069/6558 cut-off events. [2022-11-20 10:54:34,778 INFO L131 PetriNetUnfolder]: For 1489/1489 co-relation queries the response was YES. [2022-11-20 10:54:34,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13913 conditions, 6558 events. 4069/6558 cut-off events. For 1489/1489 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 41816 event pairs, 544 based on Foata normal form. 144/6606 useless extension candidates. Maximal degree in co-relation 13840. Up to 3239 conditions per place. [2022-11-20 10:54:34,840 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 37 selfloop transitions, 2 changer transitions 58/188 dead transitions. [2022-11-20 10:54:34,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 188 transitions, 627 flow [2022-11-20 10:54:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:54:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:54:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2022-11-20 10:54:34,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2022-11-20 10:54:34,847 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2022-11-20 10:54:34,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2022-11-20 10:54:34,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:34,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2022-11-20 10:54:34,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:34,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:34,855 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:34,856 INFO L175 Difference]: Start difference. First operand has 158 places, 119 transitions, 270 flow. Second operand 9 states and 1071 transitions. [2022-11-20 10:54:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 188 transitions, 627 flow [2022-11-20 10:54:34,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 188 transitions, 589 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-20 10:54:34,965 INFO L231 Difference]: Finished difference. Result has 144 places, 119 transitions, 270 flow [2022-11-20 10:54:34,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=144, PETRI_TRANSITIONS=119} [2022-11-20 10:54:34,968 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-11-20 10:54:34,968 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 119 transitions, 270 flow [2022-11-20 10:54:34,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:34,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:34,970 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:34,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:54:34,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash 123450827, now seen corresponding path program 1 times [2022-11-20 10:54:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836842366] [2022-11-20 10:54:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:35,375 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-20 10:54:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:35,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836842366] [2022-11-20 10:54:35,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836842366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:35,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:35,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:54:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821219991] [2022-11-20 10:54:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:35,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:54:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:35,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:54:35,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:54:35,380 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-20 10:54:35,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 119 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:35,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:35,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-20 10:54:35,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:37,101 INFO L130 PetriNetUnfolder]: 4140/7475 cut-off events. [2022-11-20 10:54:37,102 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2022-11-20 10:54:37,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14274 conditions, 7475 events. 4140/7475 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 58027 event pairs, 187 based on Foata normal form. 0/7343 useless extension candidates. Maximal degree in co-relation 14207. Up to 2233 conditions per place. [2022-11-20 10:54:37,146 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 38 selfloop transitions, 7 changer transitions 60/201 dead transitions. [2022-11-20 10:54:37,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 201 transitions, 650 flow [2022-11-20 10:54:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:54:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:54:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1247 transitions. [2022-11-20 10:54:37,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8843971631205674 [2022-11-20 10:54:37,151 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1247 transitions. [2022-11-20 10:54:37,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1247 transitions. [2022-11-20 10:54:37,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:37,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1247 transitions. [2022-11-20 10:54:37,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.7) internal successors, (1247), 10 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:37,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:37,158 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:37,159 INFO L175 Difference]: Start difference. First operand has 144 places, 119 transitions, 270 flow. Second operand 10 states and 1247 transitions. [2022-11-20 10:54:37,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 201 transitions, 650 flow [2022-11-20 10:54:37,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 634 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-20 10:54:37,189 INFO L231 Difference]: Finished difference. Result has 145 places, 122 transitions, 320 flow [2022-11-20 10:54:37,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=145, PETRI_TRANSITIONS=122} [2022-11-20 10:54:37,190 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, -3 predicate places. [2022-11-20 10:54:37,190 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 122 transitions, 320 flow [2022-11-20 10:54:37,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:37,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:37,191 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:37,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:54:37,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1964101702, now seen corresponding path program 1 times [2022-11-20 10:54:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:37,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633016202] [2022-11-20 10:54:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:37,539 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-20 10:54:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633016202] [2022-11-20 10:54:37,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633016202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:37,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:37,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:54:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363299727] [2022-11-20 10:54:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:54:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:54:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:54:37,543 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-20 10:54:37,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 122 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:37,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:37,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-20 10:54:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:38,491 INFO L130 PetriNetUnfolder]: 1872/3837 cut-off events. [2022-11-20 10:54:38,492 INFO L131 PetriNetUnfolder]: For 3742/3790 co-relation queries the response was YES. [2022-11-20 10:54:38,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10233 conditions, 3837 events. 1872/3837 cut-off events. For 3742/3790 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28738 event pairs, 80 based on Foata normal form. 108/3926 useless extension candidates. Maximal degree in co-relation 10165. Up to 1002 conditions per place. [2022-11-20 10:54:38,532 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 46 selfloop transitions, 11 changer transitions 47/200 dead transitions. [2022-11-20 10:54:38,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 200 transitions, 857 flow [2022-11-20 10:54:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:54:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:54:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1246 transitions. [2022-11-20 10:54:38,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2022-11-20 10:54:38,536 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1246 transitions. [2022-11-20 10:54:38,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1246 transitions. [2022-11-20 10:54:38,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:38,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1246 transitions. [2022-11-20 10:54:38,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:38,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:38,544 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:38,544 INFO L175 Difference]: Start difference. First operand has 145 places, 122 transitions, 320 flow. Second operand 10 states and 1246 transitions. [2022-11-20 10:54:38,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 200 transitions, 857 flow [2022-11-20 10:54:38,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 200 transitions, 832 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-20 10:54:38,565 INFO L231 Difference]: Finished difference. Result has 149 places, 126 transitions, 408 flow [2022-11-20 10:54:38,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=408, PETRI_PLACES=149, PETRI_TRANSITIONS=126} [2022-11-20 10:54:38,566 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2022-11-20 10:54:38,566 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 126 transitions, 408 flow [2022-11-20 10:54:38,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:38,567 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:38,567 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:54:38,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1383654234, now seen corresponding path program 1 times [2022-11-20 10:54:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:38,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788680558] [2022-11-20 10:54:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:39,024 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-20 10:54:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:39,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788680558] [2022-11-20 10:54:39,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788680558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:39,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:39,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:54:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666957658] [2022-11-20 10:54:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:39,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:54:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:54:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:54:39,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-20 10:54:39,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 126 transitions, 408 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:39,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:39,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-20 10:54:39,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:39,814 INFO L130 PetriNetUnfolder]: 745/1740 cut-off events. [2022-11-20 10:54:39,814 INFO L131 PetriNetUnfolder]: For 4440/4455 co-relation queries the response was YES. [2022-11-20 10:54:39,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 1740 events. 745/1740 cut-off events. For 4440/4455 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11262 event pairs, 92 based on Foata normal form. 51/1772 useless extension candidates. Maximal degree in co-relation 5391. Up to 429 conditions per place. [2022-11-20 10:54:39,829 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 53 selfloop transitions, 15 changer transitions 47/211 dead transitions. [2022-11-20 10:54:39,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 211 transitions, 1136 flow [2022-11-20 10:54:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:54:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:54:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1371 transitions. [2022-11-20 10:54:39,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8839458413926499 [2022-11-20 10:54:39,834 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1371 transitions. [2022-11-20 10:54:39,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1371 transitions. [2022-11-20 10:54:39,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:39,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1371 transitions. [2022-11-20 10:54:39,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.63636363636364) internal successors, (1371), 11 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:39,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:39,843 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:39,843 INFO L175 Difference]: Start difference. First operand has 149 places, 126 transitions, 408 flow. Second operand 11 states and 1371 transitions. [2022-11-20 10:54:39,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 211 transitions, 1136 flow [2022-11-20 10:54:39,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 211 transitions, 956 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-11-20 10:54:39,864 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 458 flow [2022-11-20 10:54:39,865 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=458, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2022-11-20 10:54:39,865 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 4 predicate places. [2022-11-20 10:54:39,866 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 458 flow [2022-11-20 10:54:39,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:39,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:39,867 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:39,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:54:39,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -354421825, now seen corresponding path program 1 times [2022-11-20 10:54:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:39,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805108192] [2022-11-20 10:54:39,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:41,033 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-20 10:54:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:41,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805108192] [2022-11-20 10:54:41,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805108192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:41,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:41,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:54:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775653796] [2022-11-20 10:54:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:41,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:54:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:54:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:54:41,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 141 [2022-11-20 10:54:41,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 458 flow. Second operand has 10 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:41,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:41,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 141 [2022-11-20 10:54:41,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:41,619 INFO L130 PetriNetUnfolder]: 248/1031 cut-off events. [2022-11-20 10:54:41,620 INFO L131 PetriNetUnfolder]: For 1707/1886 co-relation queries the response was YES. [2022-11-20 10:54:41,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1031 events. 248/1031 cut-off events. For 1707/1886 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6442 event pairs, 36 based on Foata normal form. 36/1042 useless extension candidates. Maximal degree in co-relation 2496. Up to 222 conditions per place. [2022-11-20 10:54:41,629 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 33 selfloop transitions, 11 changer transitions 21/171 dead transitions. [2022-11-20 10:54:41,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 171 transitions, 690 flow [2022-11-20 10:54:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:54:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:54:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1298 transitions. [2022-11-20 10:54:41,634 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8368794326241135 [2022-11-20 10:54:41,634 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1298 transitions. [2022-11-20 10:54:41,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1298 transitions. [2022-11-20 10:54:41,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:41,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1298 transitions. [2022-11-20 10:54:41,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:41,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:41,643 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:41,643 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 458 flow. Second operand 11 states and 1298 transitions. [2022-11-20 10:54:41,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 171 transitions, 690 flow [2022-11-20 10:54:41,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 171 transitions, 605 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-11-20 10:54:41,658 INFO L231 Difference]: Finished difference. Result has 155 places, 139 transitions, 445 flow [2022-11-20 10:54:41,658 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=445, PETRI_PLACES=155, PETRI_TRANSITIONS=139} [2022-11-20 10:54:41,659 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 7 predicate places. [2022-11-20 10:54:41,659 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 139 transitions, 445 flow [2022-11-20 10:54:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:41,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:41,661 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:41,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:54:41,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash -458091965, now seen corresponding path program 2 times [2022-11-20 10:54:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311373205] [2022-11-20 10:54:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:42,840 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-20 10:54:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:42,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311373205] [2022-11-20 10:54:42,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311373205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:42,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:42,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:54:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041533596] [2022-11-20 10:54:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:42,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:54:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:54:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:54:42,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 141 [2022-11-20 10:54:42,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 139 transitions, 445 flow. Second operand has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:42,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:42,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 141 [2022-11-20 10:54:42,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:44,007 INFO L130 PetriNetUnfolder]: 1030/3097 cut-off events. [2022-11-20 10:54:44,007 INFO L131 PetriNetUnfolder]: For 1883/2076 co-relation queries the response was YES. [2022-11-20 10:54:44,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7297 conditions, 3097 events. 1030/3097 cut-off events. For 1883/2076 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 25613 event pairs, 188 based on Foata normal form. 105/3134 useless extension candidates. Maximal degree in co-relation 7209. Up to 506 conditions per place. [2022-11-20 10:54:44,036 INFO L137 encePairwiseOnDemand]: 123/141 looper letters, 67 selfloop transitions, 25 changer transitions 31/217 dead transitions. [2022-11-20 10:54:44,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 217 transitions, 953 flow [2022-11-20 10:54:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:54:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 10:54:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1616 transitions. [2022-11-20 10:54:44,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7640661938534279 [2022-11-20 10:54:44,042 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1616 transitions. [2022-11-20 10:54:44,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1616 transitions. [2022-11-20 10:54:44,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:44,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1616 transitions. [2022-11-20 10:54:44,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 107.73333333333333) internal successors, (1616), 15 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:44,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 141.0) internal successors, (2256), 16 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:44,052 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 141.0) internal successors, (2256), 16 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:44,052 INFO L175 Difference]: Start difference. First operand has 155 places, 139 transitions, 445 flow. Second operand 15 states and 1616 transitions. [2022-11-20 10:54:44,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 217 transitions, 953 flow [2022-11-20 10:54:44,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 217 transitions, 917 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-20 10:54:44,087 INFO L231 Difference]: Finished difference. Result has 169 places, 153 transitions, 600 flow [2022-11-20 10:54:44,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=600, PETRI_PLACES=169, PETRI_TRANSITIONS=153} [2022-11-20 10:54:44,090 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 21 predicate places. [2022-11-20 10:54:44,091 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 153 transitions, 600 flow [2022-11-20 10:54:44,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.0909090909091) internal successors, (1134), 11 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:44,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:44,092 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:44,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:54:44,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -244229949, now seen corresponding path program 3 times [2022-11-20 10:54:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:44,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129031969] [2022-11-20 10:54:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:44,500 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-20 10:54:44,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:44,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129031969] [2022-11-20 10:54:44,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129031969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:44,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:44,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:54:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968131980] [2022-11-20 10:54:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:44,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:54:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:54:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:54:44,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2022-11-20 10:54:44,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 153 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:44,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:44,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2022-11-20 10:54:44,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:45,664 INFO L130 PetriNetUnfolder]: 1803/5377 cut-off events. [2022-11-20 10:54:45,664 INFO L131 PetriNetUnfolder]: For 10009/10502 co-relation queries the response was YES. [2022-11-20 10:54:45,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15798 conditions, 5377 events. 1803/5377 cut-off events. For 10009/10502 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 50417 event pairs, 464 based on Foata normal form. 198/5381 useless extension candidates. Maximal degree in co-relation 15705. Up to 1174 conditions per place. [2022-11-20 10:54:45,705 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 91 selfloop transitions, 6 changer transitions 42/239 dead transitions. [2022-11-20 10:54:45,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 239 transitions, 1439 flow [2022-11-20 10:54:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:54:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:54:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2022-11-20 10:54:45,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825354609929078 [2022-11-20 10:54:45,708 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2022-11-20 10:54:45,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2022-11-20 10:54:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:45,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2022-11-20 10:54:45,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:45,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:45,714 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:45,714 INFO L175 Difference]: Start difference. First operand has 169 places, 153 transitions, 600 flow. Second operand 8 states and 931 transitions. [2022-11-20 10:54:45,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 239 transitions, 1439 flow [2022-11-20 10:54:45,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 239 transitions, 1382 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-11-20 10:54:45,776 INFO L231 Difference]: Finished difference. Result has 169 places, 154 transitions, 604 flow [2022-11-20 10:54:45,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=604, PETRI_PLACES=169, PETRI_TRANSITIONS=154} [2022-11-20 10:54:45,777 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 21 predicate places. [2022-11-20 10:54:45,777 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 154 transitions, 604 flow [2022-11-20 10:54:45,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:45,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:45,778 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:45,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:54:45,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 543021829, now seen corresponding path program 4 times [2022-11-20 10:54:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:45,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607969927] [2022-11-20 10:54:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:46,131 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-20 10:54:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607969927] [2022-11-20 10:54:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607969927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:46,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:54:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979799611] [2022-11-20 10:54:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:46,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:54:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:54:46,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:54:46,135 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-20 10:54:46,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 154 transitions, 604 flow. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:46,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:46,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-20 10:54:46,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:47,084 INFO L130 PetriNetUnfolder]: 1681/4292 cut-off events. [2022-11-20 10:54:47,084 INFO L131 PetriNetUnfolder]: For 6631/6947 co-relation queries the response was YES. [2022-11-20 10:54:47,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12992 conditions, 4292 events. 1681/4292 cut-off events. For 6631/6947 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37327 event pairs, 134 based on Foata normal form. 101/4240 useless extension candidates. Maximal degree in co-relation 12962. Up to 861 conditions per place. [2022-11-20 10:54:47,110 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 69 selfloop transitions, 21 changer transitions 37/227 dead transitions. [2022-11-20 10:54:47,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 227 transitions, 1333 flow [2022-11-20 10:54:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:54:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:54:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1455 transitions. [2022-11-20 10:54:47,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2022-11-20 10:54:47,115 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1455 transitions. [2022-11-20 10:54:47,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1455 transitions. [2022-11-20 10:54:47,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:47,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1455 transitions. [2022-11-20 10:54:47,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.25) internal successors, (1455), 12 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:47,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:47,123 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:47,123 INFO L175 Difference]: Start difference. First operand has 169 places, 154 transitions, 604 flow. Second operand 12 states and 1455 transitions. [2022-11-20 10:54:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 227 transitions, 1333 flow [2022-11-20 10:54:47,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 227 transitions, 1279 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-11-20 10:54:47,179 INFO L231 Difference]: Finished difference. Result has 176 places, 151 transitions, 619 flow [2022-11-20 10:54:47,180 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=619, PETRI_PLACES=176, PETRI_TRANSITIONS=151} [2022-11-20 10:54:47,180 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 28 predicate places. [2022-11-20 10:54:47,180 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 151 transitions, 619 flow [2022-11-20 10:54:47,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:47,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:47,181 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:47,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:54:47,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1316709484, now seen corresponding path program 1 times [2022-11-20 10:54:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375526555] [2022-11-20 10:54:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:47,550 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-20 10:54:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375526555] [2022-11-20 10:54:47,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375526555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:47,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:47,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:54:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072597824] [2022-11-20 10:54:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:47,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:54:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:54:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:54:47,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2022-11-20 10:54:47,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 151 transitions, 619 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:47,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:47,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2022-11-20 10:54:47,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:48,626 INFO L130 PetriNetUnfolder]: 2268/6561 cut-off events. [2022-11-20 10:54:48,626 INFO L131 PetriNetUnfolder]: For 14245/14600 co-relation queries the response was YES. [2022-11-20 10:54:48,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20698 conditions, 6561 events. 2268/6561 cut-off events. For 14245/14600 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 66570 event pairs, 408 based on Foata normal form. 1/6346 useless extension candidates. Maximal degree in co-relation 20605. Up to 1462 conditions per place. [2022-11-20 10:54:48,662 INFO L137 encePairwiseOnDemand]: 131/141 looper letters, 66 selfloop transitions, 6 changer transitions 24/199 dead transitions. [2022-11-20 10:54:48,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 199 transitions, 1089 flow [2022-11-20 10:54:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:54:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:54:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 904 transitions. [2022-11-20 10:54:48,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8014184397163121 [2022-11-20 10:54:48,665 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 904 transitions. [2022-11-20 10:54:48,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 904 transitions. [2022-11-20 10:54:48,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:48,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 904 transitions. [2022-11-20 10:54:48,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:48,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:48,671 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:48,671 INFO L175 Difference]: Start difference. First operand has 176 places, 151 transitions, 619 flow. Second operand 8 states and 904 transitions. [2022-11-20 10:54:48,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 199 transitions, 1089 flow [2022-11-20 10:54:48,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 199 transitions, 988 flow, removed 38 selfloop flow, removed 12 redundant places. [2022-11-20 10:54:48,900 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 524 flow [2022-11-20 10:54:48,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2022-11-20 10:54:48,901 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 25 predicate places. [2022-11-20 10:54:48,902 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 524 flow [2022-11-20 10:54:48,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:48,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:48,902 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:54:48,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1151288464, now seen corresponding path program 2 times [2022-11-20 10:54:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349158176] [2022-11-20 10:54:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:54:50,620 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-20 10:54:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:54:50,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349158176] [2022-11-20 10:54:50,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349158176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:54:50,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:54:50,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:54:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80543711] [2022-11-20 10:54:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:54:50,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:54:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:54:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:54:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:54:50,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 141 [2022-11-20 10:54:50,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 524 flow. Second operand has 15 states, 15 states have (on average 108.93333333333334) internal successors, (1634), 15 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:50,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:54:50,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 141 [2022-11-20 10:54:50,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:54:51,217 INFO L130 PetriNetUnfolder]: 367/1547 cut-off events. [2022-11-20 10:54:51,218 INFO L131 PetriNetUnfolder]: For 1147/1274 co-relation queries the response was YES. [2022-11-20 10:54:51,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1547 events. 367/1547 cut-off events. For 1147/1274 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12489 event pairs, 38 based on Foata normal form. 18/1455 useless extension candidates. Maximal degree in co-relation 3710. Up to 197 conditions per place. [2022-11-20 10:54:51,227 INFO L137 encePairwiseOnDemand]: 128/141 looper letters, 46 selfloop transitions, 13 changer transitions 6/171 dead transitions. [2022-11-20 10:54:51,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 787 flow [2022-11-20 10:54:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:54:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:54:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1550 transitions. [2022-11-20 10:54:51,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7852077001013171 [2022-11-20 10:54:51,231 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1550 transitions. [2022-11-20 10:54:51,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1550 transitions. [2022-11-20 10:54:51,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:54:51,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1550 transitions. [2022-11-20 10:54:51,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.71428571428571) internal successors, (1550), 14 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:51,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:51,240 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:51,240 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 524 flow. Second operand 14 states and 1550 transitions. [2022-11-20 10:54:51,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 787 flow [2022-11-20 10:54:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 171 transitions, 713 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-11-20 10:54:51,259 INFO L231 Difference]: Finished difference. Result has 177 places, 149 transitions, 540 flow [2022-11-20 10:54:51,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=540, PETRI_PLACES=177, PETRI_TRANSITIONS=149} [2022-11-20 10:54:51,260 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 29 predicate places. [2022-11-20 10:54:51,260 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 149 transitions, 540 flow [2022-11-20 10:54:51,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 108.93333333333334) internal successors, (1634), 15 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:51,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:54:51,261 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:54:51,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:54:51,262 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:54:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1820957348, now seen corresponding path program 3 times [2022-11-20 10:54:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628085265] [2022-11-20 10:54:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:51,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:54:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:51,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:54:51,454 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:54:51,455 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-20 10:54:51,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-20 10:54:51,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-20 10:54:51,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-20 10:54:51,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-20 10:54:51,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-20 10:54:51,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-20 10:54:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:54:51,461 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 10:54:51,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:54:51,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:54:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:54:51 BasicIcfg [2022-11-20 10:54:51,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:54:51,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:54:51,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:54:51,665 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:54:51,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:54:27" (3/4) ... [2022-11-20 10:54:51,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:54:51,832 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:54:51,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:54:51,833 INFO L158 Benchmark]: Toolchain (without parser) took 26523.41ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 109.6MB in the beginning and 662.0MB in the end (delta: -552.3MB). Peak memory consumption was 611.6MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,833 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 155.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:54:51,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.85ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 85.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.60ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 82.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,834 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,834 INFO L158 Benchmark]: RCFGBuilder took 1111.80ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 80.6MB in the beginning and 165.0MB in the end (delta: -84.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,835 INFO L158 Benchmark]: TraceAbstraction took 24534.64ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 164.0MB in the beginning and 700.8MB in the end (delta: -536.8MB). Peak memory consumption was 570.5MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,835 INFO L158 Benchmark]: Witness Printer took 167.63ms. Allocated memory is still 1.3GB. Free memory was 700.8MB in the beginning and 662.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 10:54:51,837 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.56ms. Allocated memory is still 155.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.85ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 85.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.60ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 82.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1111.80ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 80.6MB in the beginning and 165.0MB in the end (delta: -84.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24534.64ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 164.0MB in the beginning and 700.8MB in the end (delta: -536.8MB). Peak memory consumption was 570.5MB. Max. memory is 16.1GB. * Witness Printer took 167.63ms. Allocated memory is still 1.3GB. Free memory was 700.8MB in the beginning and 662.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L720] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L722] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L724] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L725] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L726] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L727] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L728] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L729] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L730] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L731] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L732] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L733] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L734] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L735] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L736] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L737] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L738] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L739] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L740] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L741] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L742] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L743] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L744] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L746] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L748] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L750] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t321; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=-3, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=-2, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=-1, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t324; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 808 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2265 IncrementalHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 211 mSDtfsCounter, 2265 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=10, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1272 NumberOfCodeBlocks, 1272 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 7539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-20 10:54:51,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b3a0a00-b25c-44f8-930e-4f899728fb27/bin/uautomizer-ug76WZFUDN/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