./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- 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 12:13:19,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:13:19,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:13:19,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:13:19,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:13:19,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:13:19,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:13:19,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:13:19,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:13:19,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:13:19,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:13:19,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:13:19,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:13:19,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:13:19,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:13:19,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:13:19,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:13:19,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:13:19,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:13:19,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:13:19,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:13:19,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:13:19,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:13:19,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:13:19,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:13:19,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:13:19,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:13:19,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:13:19,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:13:19,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:13:19,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:13:19,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:13:19,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:13:19,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:13:19,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:13:19,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:13:19,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:13:19,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:13:19,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:13:19,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:13:19,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:13:19,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:13:19,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:13:19,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:13:19,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:13:19,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:13:19,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:13:19,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:13:19,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:13:19,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:13:19,905 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:13:19,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:13:19,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:13:19,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:13:19,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:13:19,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:13:19,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:13:19,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:13:19,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:13:19,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:13:19,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:13:19,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:13:19,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:13:19,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:13:19,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:13:19,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:13:19,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:13:19,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:13:19,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:13:19,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:13:19,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:13:19,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:13:19,911 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:13:19,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:13:19,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:13:19,911 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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2022-11-20 12:13:20,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:13:20,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:13:20,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:13:20,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:13:20,244 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:13:20,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-20 12:13:23,182 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:13:23,561 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:13:23,570 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-20 12:13:23,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/data/90e8d6ea7/640e5036d1484ac1a96681f6fade2aaf/FLAGfb6a635b1 [2022-11-20 12:13:23,611 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/data/90e8d6ea7/640e5036d1484ac1a96681f6fade2aaf [2022-11-20 12:13:23,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:13:23,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:13:23,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:13:23,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:13:23,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:13:23,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:13:23" (1/1) ... [2022-11-20 12:13:23,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa7f0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:23, skipping insertion in model container [2022-11-20 12:13:23,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:13:23" (1/1) ... [2022-11-20 12:13:23,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:13:23,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:13:23,858 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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-20 12:13:24,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:13:24,103 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:13:24,120 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_1d604d29-93d4-4e4b-80f2-b7f0325f5894/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-20 12:13:24,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:13:24,198 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:13:24,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24 WrapperNode [2022-11-20 12:13:24,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:13:24,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:13:24,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:13:24,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:13:24,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,291 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-20 12:13:24,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:13:24,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:13:24,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:13:24,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:13:24,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:13:24,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:13:24,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:13:24,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:13:24,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (1/1) ... [2022-11-20 12:13:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:13:24,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:13:24,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:13:24,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:13:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:13:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:13:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:13:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:13:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:13:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:13:24,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:13:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:13:24,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:13:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:13:24,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:13:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:13:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:13:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:13:24,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:13:24,465 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 12:13:24,684 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:13:24,686 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:13:25,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:13:25,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:13:25,207 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:13:25,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:25 BoogieIcfgContainer [2022-11-20 12:13:25,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:13:25,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:13:25,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:13:25,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:13:25,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:13:23" (1/3) ... [2022-11-20 12:13:25,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bc0ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:13:25, skipping insertion in model container [2022-11-20 12:13:25,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:24" (2/3) ... [2022-11-20 12:13:25,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bc0ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:13:25, skipping insertion in model container [2022-11-20 12:13:25,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:25" (3/3) ... [2022-11-20 12:13:25,231 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-11-20 12:13:25,242 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:13:25,253 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:13:25,253 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:13:25,253 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:13:25,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:13:25,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-20 12:13:25,463 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-20 12:13:25,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:13:25,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-20 12:13:25,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-20 12:13:25,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-20 12:13:25,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:13:25,499 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;@5de0fea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:13:25,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:13:25,516 INFO L130 PetriNetUnfolder]: 0/61 cut-off events. [2022-11-20 12:13:25,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:13:25,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:25,517 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] [2022-11-20 12:13:25,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -236879405, now seen corresponding path program 1 times [2022-11-20 12:13:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213361039] [2022-11-20 12:13:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:26,223 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 12:13:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:26,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213361039] [2022-11-20 12:13:26,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213361039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:26,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:26,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:13:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382967383] [2022-11-20 12:13:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:26,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:13:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:13:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:13:26,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2022-11-20 12:13:26,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 12:13:26,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:26,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2022-11-20 12:13:26,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:26,509 INFO L130 PetriNetUnfolder]: 57/490 cut-off events. [2022-11-20 12:13:26,509 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-20 12:13:26,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 490 events. 57/490 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2553 event pairs, 31 based on Foata normal form. 16/476 useless extension candidates. Maximal degree in co-relation 561. Up to 75 conditions per place. [2022-11-20 12:13:26,516 INFO L137 encePairwiseOnDemand]: 114/119 looper letters, 13 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-11-20 12:13:26,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 276 flow [2022-11-20 12:13:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:13:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:13:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2022-11-20 12:13:26,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2022-11-20 12:13:26,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2022-11-20 12:13:26,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2022-11-20 12:13:26,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:26,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2022-11-20 12:13:26,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 12:13:26,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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 12:13:26,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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 12:13:26,561 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 241 flow. Second operand 3 states and 335 transitions. [2022-11-20 12:13:26,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 276 flow [2022-11-20 12:13:26,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:13:26,571 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2022-11-20 12:13:26,573 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-11-20 12:13:26,579 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2022-11-20 12:13:26,579 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2022-11-20 12:13:26,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 12:13:26,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:26,581 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] [2022-11-20 12:13:26,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:13:26,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2021103738, now seen corresponding path program 1 times [2022-11-20 12:13:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:26,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083316458] [2022-11-20 12:13:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:26,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:27,575 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 12:13:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083316458] [2022-11-20 12:13:27,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083316458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:27,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:27,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:13:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368935057] [2022-11-20 12:13:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:13:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:13:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:13:27,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-20 12:13:27,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 12:13:27,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:27,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-20 12:13:27,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:28,529 INFO L130 PetriNetUnfolder]: 1114/2911 cut-off events. [2022-11-20 12:13:28,530 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-11-20 12:13:28,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 2911 events. 1114/2911 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22724 event pairs, 186 based on Foata normal form. 0/2834 useless extension candidates. Maximal degree in co-relation 4717. Up to 878 conditions per place. [2022-11-20 12:13:28,547 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 32 selfloop transitions, 2 changer transitions 60/166 dead transitions. [2022-11-20 12:13:28,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 166 transitions, 522 flow [2022-11-20 12:13:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:13:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:13:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2022-11-20 12:13:28,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020541549953315 [2022-11-20 12:13:28,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2022-11-20 12:13:28,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2022-11-20 12:13:28,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:28,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2022-11-20 12:13:28,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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 12:13:28,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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 12:13:28,559 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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 12:13:28,559 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 9 states and 859 transitions. [2022-11-20 12:13:28,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 166 transitions, 522 flow [2022-11-20 12:13:28,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 166 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:13:28,563 INFO L231 Difference]: Finished difference. Result has 134 places, 100 transitions, 226 flow [2022-11-20 12:13:28,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=134, PETRI_TRANSITIONS=100} [2022-11-20 12:13:28,564 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2022-11-20 12:13:28,564 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 100 transitions, 226 flow [2022-11-20 12:13:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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 12:13:28,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:28,565 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] [2022-11-20 12:13:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:13:28,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -811427260, now seen corresponding path program 1 times [2022-11-20 12:13:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112866385] [2022-11-20 12:13:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:29,735 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 12:13:29,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112866385] [2022-11-20 12:13:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112866385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:29,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:29,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:13:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596550686] [2022-11-20 12:13:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:29,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:13:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:13:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:13:29,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-20 12:13:29,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 100 transitions, 226 flow. Second operand has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 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 12:13:29,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:29,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-20 12:13:29,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:30,947 INFO L130 PetriNetUnfolder]: 856/1667 cut-off events. [2022-11-20 12:13:30,947 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-11-20 12:13:30,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 1667 events. 856/1667 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9576 event pairs, 120 based on Foata normal form. 40/1670 useless extension candidates. Maximal degree in co-relation 3417. Up to 798 conditions per place. [2022-11-20 12:13:30,957 INFO L137 encePairwiseOnDemand]: 100/119 looper letters, 33 selfloop transitions, 20 changer transitions 74/199 dead transitions. [2022-11-20 12:13:30,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 199 transitions, 735 flow [2022-11-20 12:13:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:13:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 12:13:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1851 transitions. [2022-11-20 12:13:30,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7777310924369748 [2022-11-20 12:13:30,963 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1851 transitions. [2022-11-20 12:13:30,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1851 transitions. [2022-11-20 12:13:30,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:30,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1851 transitions. [2022-11-20 12:13:30,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 92.55) internal successors, (1851), 20 states have internal predecessors, (1851), 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 12:13:30,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 119.0) internal successors, (2499), 21 states have internal predecessors, (2499), 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 12:13:30,976 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 119.0) internal successors, (2499), 21 states have internal predecessors, (2499), 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 12:13:30,977 INFO L175 Difference]: Start difference. First operand has 134 places, 100 transitions, 226 flow. Second operand 20 states and 1851 transitions. [2022-11-20 12:13:30,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 199 transitions, 735 flow [2022-11-20 12:13:30,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 199 transitions, 681 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-20 12:13:30,995 INFO L231 Difference]: Finished difference. Result has 142 places, 113 transitions, 379 flow [2022-11-20 12:13:30,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=379, PETRI_PLACES=142, PETRI_TRANSITIONS=113} [2022-11-20 12:13:30,996 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places. [2022-11-20 12:13:30,997 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 113 transitions, 379 flow [2022-11-20 12:13:30,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 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 12:13:30,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:30,998 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] [2022-11-20 12:13:30,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:13:30,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash 922740464, now seen corresponding path program 1 times [2022-11-20 12:13:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:30,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494517962] [2022-11-20 12:13:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:32,029 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 12:13:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:32,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494517962] [2022-11-20 12:13:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494517962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:32,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:32,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:13:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481854825] [2022-11-20 12:13:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:32,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:13:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:13:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:32,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 119 [2022-11-20 12:13:32,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 113 transitions, 379 flow. Second operand has 11 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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 12:13:32,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:32,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 119 [2022-11-20 12:13:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:32,888 INFO L130 PetriNetUnfolder]: 500/1118 cut-off events. [2022-11-20 12:13:32,888 INFO L131 PetriNetUnfolder]: For 5245/5865 co-relation queries the response was YES. [2022-11-20 12:13:32,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 1118 events. 500/1118 cut-off events. For 5245/5865 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6499 event pairs, 173 based on Foata normal form. 54/1122 useless extension candidates. Maximal degree in co-relation 4679. Up to 445 conditions per place. [2022-11-20 12:13:32,899 INFO L137 encePairwiseOnDemand]: 104/119 looper letters, 34 selfloop transitions, 23 changer transitions 47/185 dead transitions. [2022-11-20 12:13:32,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 185 transitions, 1211 flow [2022-11-20 12:13:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:13:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 12:13:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1764 transitions. [2022-11-20 12:13:32,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2022-11-20 12:13:32,904 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1764 transitions. [2022-11-20 12:13:32,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1764 transitions. [2022-11-20 12:13:32,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:32,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1764 transitions. [2022-11-20 12:13:32,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 98.0) internal successors, (1764), 18 states have internal predecessors, (1764), 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 12:13:32,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 119.0) internal successors, (2261), 19 states have internal predecessors, (2261), 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 12:13:32,922 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 119.0) internal successors, (2261), 19 states have internal predecessors, (2261), 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 12:13:32,922 INFO L175 Difference]: Start difference. First operand has 142 places, 113 transitions, 379 flow. Second operand 18 states and 1764 transitions. [2022-11-20 12:13:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 185 transitions, 1211 flow [2022-11-20 12:13:32,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 185 transitions, 1169 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-11-20 12:13:32,936 INFO L231 Difference]: Finished difference. Result has 150 places, 130 transitions, 639 flow [2022-11-20 12:13:32,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=639, PETRI_PLACES=150, PETRI_TRANSITIONS=130} [2022-11-20 12:13:32,938 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 26 predicate places. [2022-11-20 12:13:32,943 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 130 transitions, 639 flow [2022-11-20 12:13:32,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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 12:13:32,944 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:32,944 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] [2022-11-20 12:13:32,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:13:32,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1271774078, now seen corresponding path program 2 times [2022-11-20 12:13:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:32,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652612684] [2022-11-20 12:13:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:34,301 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 12:13:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652612684] [2022-11-20 12:13:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652612684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:34,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:13:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779727451] [2022-11-20 12:13:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:13:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:13:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:13:34,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2022-11-20 12:13:34,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 130 transitions, 639 flow. Second operand has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 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 12:13:34,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:34,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2022-11-20 12:13:34,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:35,399 INFO L130 PetriNetUnfolder]: 742/1576 cut-off events. [2022-11-20 12:13:35,399 INFO L131 PetriNetUnfolder]: For 12133/12783 co-relation queries the response was YES. [2022-11-20 12:13:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8010 conditions, 1576 events. 742/1576 cut-off events. For 12133/12783 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9042 event pairs, 226 based on Foata normal form. 50/1561 useless extension candidates. Maximal degree in co-relation 7914. Up to 715 conditions per place. [2022-11-20 12:13:35,417 INFO L137 encePairwiseOnDemand]: 100/119 looper letters, 46 selfloop transitions, 34 changer transitions 44/196 dead transitions. [2022-11-20 12:13:35,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 196 transitions, 1604 flow [2022-11-20 12:13:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:13:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:13:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1482 transitions. [2022-11-20 12:13:35,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7783613445378151 [2022-11-20 12:13:35,422 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1482 transitions. [2022-11-20 12:13:35,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1482 transitions. [2022-11-20 12:13:35,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:35,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1482 transitions. [2022-11-20 12:13:35,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.625) internal successors, (1482), 16 states have internal predecessors, (1482), 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 12:13:35,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 12:13:35,432 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 12:13:35,433 INFO L175 Difference]: Start difference. First operand has 150 places, 130 transitions, 639 flow. Second operand 16 states and 1482 transitions. [2022-11-20 12:13:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 196 transitions, 1604 flow [2022-11-20 12:13:35,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 196 transitions, 1530 flow, removed 33 selfloop flow, removed 7 redundant places. [2022-11-20 12:13:35,486 INFO L231 Difference]: Finished difference. Result has 156 places, 136 transitions, 800 flow [2022-11-20 12:13:35,487 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=800, PETRI_PLACES=156, PETRI_TRANSITIONS=136} [2022-11-20 12:13:35,487 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 32 predicate places. [2022-11-20 12:13:35,488 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 136 transitions, 800 flow [2022-11-20 12:13:35,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 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 12:13:35,488 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:35,488 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] [2022-11-20 12:13:35,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:13:35,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:35,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2010876260, now seen corresponding path program 1 times [2022-11-20 12:13:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:35,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302387174] [2022-11-20 12:13:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:36,483 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 12:13:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:36,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302387174] [2022-11-20 12:13:36,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302387174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:36,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:36,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:13:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104002193] [2022-11-20 12:13:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:36,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:13:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:13:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:13:36,486 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2022-11-20 12:13:36,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 136 transitions, 800 flow. Second operand has 14 states, 14 states have (on average 93.35714285714286) internal successors, (1307), 14 states have internal predecessors, (1307), 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 12:13:36,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:36,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2022-11-20 12:13:36,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:37,247 INFO L130 PetriNetUnfolder]: 329/849 cut-off events. [2022-11-20 12:13:37,247 INFO L131 PetriNetUnfolder]: For 11423/12046 co-relation queries the response was YES. [2022-11-20 12:13:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 849 events. 329/849 cut-off events. For 11423/12046 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4634 event pairs, 115 based on Foata normal form. 67/860 useless extension candidates. Maximal degree in co-relation 5021. Up to 357 conditions per place. [2022-11-20 12:13:37,261 INFO L137 encePairwiseOnDemand]: 106/119 looper letters, 53 selfloop transitions, 19 changer transitions 25/177 dead transitions. [2022-11-20 12:13:37,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 1607 flow [2022-11-20 12:13:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:13:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 12:13:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1722 transitions. [2022-11-20 12:13:37,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2022-11-20 12:13:37,266 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1722 transitions. [2022-11-20 12:13:37,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1722 transitions. [2022-11-20 12:13:37,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:37,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1722 transitions. [2022-11-20 12:13:37,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 95.66666666666667) internal successors, (1722), 18 states have internal predecessors, (1722), 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 12:13:37,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 119.0) internal successors, (2261), 19 states have internal predecessors, (2261), 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 12:13:37,277 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 119.0) internal successors, (2261), 19 states have internal predecessors, (2261), 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 12:13:37,277 INFO L175 Difference]: Start difference. First operand has 156 places, 136 transitions, 800 flow. Second operand 18 states and 1722 transitions. [2022-11-20 12:13:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 1607 flow [2022-11-20 12:13:37,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 177 transitions, 1492 flow, removed 27 selfloop flow, removed 11 redundant places. [2022-11-20 12:13:37,307 INFO L231 Difference]: Finished difference. Result has 166 places, 139 transitions, 837 flow [2022-11-20 12:13:37,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=837, PETRI_PLACES=166, PETRI_TRANSITIONS=139} [2022-11-20 12:13:37,310 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 42 predicate places. [2022-11-20 12:13:37,310 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 139 transitions, 837 flow [2022-11-20 12:13:37,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 93.35714285714286) internal successors, (1307), 14 states have internal predecessors, (1307), 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 12:13:37,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:37,311 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] [2022-11-20 12:13:37,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:13:37,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 834659795, now seen corresponding path program 1 times [2022-11-20 12:13:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995145023] [2022-11-20 12:13:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:37,572 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 12:13:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:37,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995145023] [2022-11-20 12:13:37,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995145023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:37,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:37,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:13:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270020829] [2022-11-20 12:13:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:37,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:13:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:13:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:13:37,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-20 12:13:37,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 139 transitions, 837 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 12:13:37,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:37,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-20 12:13:37,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:38,580 INFO L130 PetriNetUnfolder]: 1559/3053 cut-off events. [2022-11-20 12:13:38,580 INFO L131 PetriNetUnfolder]: For 72853/74201 co-relation queries the response was YES. [2022-11-20 12:13:38,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17561 conditions, 3053 events. 1559/3053 cut-off events. For 72853/74201 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20974 event pairs, 103 based on Foata normal form. 145/3076 useless extension candidates. Maximal degree in co-relation 17461. Up to 823 conditions per place. [2022-11-20 12:13:38,622 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 111 selfloop transitions, 15 changer transitions 56/268 dead transitions. [2022-11-20 12:13:38,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 268 transitions, 2843 flow [2022-11-20 12:13:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:13:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:13:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2022-11-20 12:13:38,627 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8672268907563025 [2022-11-20 12:13:38,627 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2022-11-20 12:13:38,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2022-11-20 12:13:38,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:38,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2022-11-20 12:13:38,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 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 12:13:38,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 12:13:38,636 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 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 12:13:38,636 INFO L175 Difference]: Start difference. First operand has 166 places, 139 transitions, 837 flow. Second operand 10 states and 1032 transitions. [2022-11-20 12:13:38,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 268 transitions, 2843 flow [2022-11-20 12:13:38,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 268 transitions, 2481 flow, removed 156 selfloop flow, removed 18 redundant places. [2022-11-20 12:13:38,682 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 755 flow [2022-11-20 12:13:38,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=755, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2022-11-20 12:13:38,684 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 30 predicate places. [2022-11-20 12:13:38,684 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 755 flow [2022-11-20 12:13:38,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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 12:13:38,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:38,685 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] [2022-11-20 12:13:38,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:13:38,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1427518258, now seen corresponding path program 1 times [2022-11-20 12:13:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:38,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248642214] [2022-11-20 12:13:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:38,961 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 12:13:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:38,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248642214] [2022-11-20 12:13:38,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248642214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:38,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:38,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:13:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547119219] [2022-11-20 12:13:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:38,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:13:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:38,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:13:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:13:38,965 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-20 12:13:38,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 755 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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 12:13:38,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:38,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-20 12:13:38,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:39,900 INFO L130 PetriNetUnfolder]: 1274/2692 cut-off events. [2022-11-20 12:13:39,900 INFO L131 PetriNetUnfolder]: For 40527/41704 co-relation queries the response was YES. [2022-11-20 12:13:39,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 2692 events. 1274/2692 cut-off events. For 40527/41704 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19596 event pairs, 70 based on Foata normal form. 153/2775 useless extension candidates. Maximal degree in co-relation 13972. Up to 645 conditions per place. [2022-11-20 12:13:39,926 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 101 selfloop transitions, 30 changer transitions 66/283 dead transitions. [2022-11-20 12:13:39,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 283 transitions, 2855 flow [2022-11-20 12:13:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:13:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:13:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1342 transitions. [2022-11-20 12:13:39,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8674854557207499 [2022-11-20 12:13:39,930 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1342 transitions. [2022-11-20 12:13:39,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1342 transitions. [2022-11-20 12:13:39,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:39,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1342 transitions. [2022-11-20 12:13:39,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.23076923076923) internal successors, (1342), 13 states have internal predecessors, (1342), 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 12:13:39,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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 12:13:39,938 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 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 12:13:39,939 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 755 flow. Second operand 13 states and 1342 transitions. [2022-11-20 12:13:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 283 transitions, 2855 flow [2022-11-20 12:13:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 283 transitions, 2831 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-20 12:13:39,970 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 964 flow [2022-11-20 12:13:39,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=964, PETRI_PLACES=168, PETRI_TRANSITIONS=158} [2022-11-20 12:13:39,972 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 44 predicate places. [2022-11-20 12:13:39,972 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 964 flow [2022-11-20 12:13:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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 12:13:39,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:39,973 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 12:13:39,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:13:39,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1463880304, now seen corresponding path program 1 times [2022-11-20 12:13:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:39,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867768246] [2022-11-20 12:13:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:40,471 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 12:13:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:40,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867768246] [2022-11-20 12:13:40,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867768246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:40,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:40,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:13:40,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066484300] [2022-11-20 12:13:40,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:40,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:13:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:40,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:13:40,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:13:40,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2022-11-20 12:13:40,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 964 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 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 12:13:40,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:40,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2022-11-20 12:13:40,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:41,197 INFO L130 PetriNetUnfolder]: 562/2196 cut-off events. [2022-11-20 12:13:41,197 INFO L131 PetriNetUnfolder]: For 8699/8877 co-relation queries the response was YES. [2022-11-20 12:13:41,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7986 conditions, 2196 events. 562/2196 cut-off events. For 8699/8877 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20727 event pairs, 33 based on Foata normal form. 11/2101 useless extension candidates. Maximal degree in co-relation 7880. Up to 398 conditions per place. [2022-11-20 12:13:41,230 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 101 selfloop transitions, 5 changer transitions 23/232 dead transitions. [2022-11-20 12:13:41,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 232 transitions, 2074 flow [2022-11-20 12:13:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:13:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:13:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 750 transitions. [2022-11-20 12:13:41,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7878151260504201 [2022-11-20 12:13:41,233 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 750 transitions. [2022-11-20 12:13:41,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 750 transitions. [2022-11-20 12:13:41,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:41,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 750 transitions. [2022-11-20 12:13:41,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.75) internal successors, (750), 8 states have internal predecessors, (750), 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 12:13:41,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 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 12:13:41,238 INFO L81 ComplementDD]: Finished complementDD. Result has 9 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 12:13:41,238 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 964 flow. Second operand 8 states and 750 transitions. [2022-11-20 12:13:41,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 232 transitions, 2074 flow [2022-11-20 12:13:41,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 232 transitions, 1963 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-11-20 12:13:41,298 INFO L231 Difference]: Finished difference. Result has 174 places, 159 transitions, 888 flow [2022-11-20 12:13:41,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=174, PETRI_TRANSITIONS=159} [2022-11-20 12:13:41,300 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 50 predicate places. [2022-11-20 12:13:41,300 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 159 transitions, 888 flow [2022-11-20 12:13:41,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 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 12:13:41,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:41,301 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 12:13:41,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:13:41,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1166115892, now seen corresponding path program 2 times [2022-11-20 12:13:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459919721] [2022-11-20 12:13:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:43,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 12:13:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:43,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459919721] [2022-11-20 12:13:43,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459919721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:43,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:43,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 12:13:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661498434] [2022-11-20 12:13:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:43,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 12:13:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 12:13:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:13:43,009 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2022-11-20 12:13:43,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 159 transitions, 888 flow. Second operand has 15 states, 15 states have (on average 85.8) internal successors, (1287), 15 states have internal predecessors, (1287), 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 12:13:43,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:43,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2022-11-20 12:13:43,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:44,230 INFO L130 PetriNetUnfolder]: 590/2519 cut-off events. [2022-11-20 12:13:44,231 INFO L131 PetriNetUnfolder]: For 8256/8309 co-relation queries the response was YES. [2022-11-20 12:13:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7876 conditions, 2519 events. 590/2519 cut-off events. For 8256/8309 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25379 event pairs, 38 based on Foata normal form. 9/2417 useless extension candidates. Maximal degree in co-relation 7765. Up to 335 conditions per place. [2022-11-20 12:13:44,261 INFO L137 encePairwiseOnDemand]: 100/119 looper letters, 55 selfloop transitions, 28 changer transitions 23/209 dead transitions. [2022-11-20 12:13:44,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 209 transitions, 1667 flow [2022-11-20 12:13:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:13:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 12:13:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1761 transitions. [2022-11-20 12:13:44,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7399159663865547 [2022-11-20 12:13:44,266 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1761 transitions. [2022-11-20 12:13:44,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1761 transitions. [2022-11-20 12:13:44,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:44,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1761 transitions. [2022-11-20 12:13:44,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 88.05) internal successors, (1761), 20 states have internal predecessors, (1761), 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 12:13:44,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 119.0) internal successors, (2499), 21 states have internal predecessors, (2499), 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 12:13:44,278 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 119.0) internal successors, (2499), 21 states have internal predecessors, (2499), 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 12:13:44,279 INFO L175 Difference]: Start difference. First operand has 174 places, 159 transitions, 888 flow. Second operand 20 states and 1761 transitions. [2022-11-20 12:13:44,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 209 transitions, 1667 flow [2022-11-20 12:13:44,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 209 transitions, 1638 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-20 12:13:44,332 INFO L231 Difference]: Finished difference. Result has 196 places, 168 transitions, 1110 flow [2022-11-20 12:13:44,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1110, PETRI_PLACES=196, PETRI_TRANSITIONS=168} [2022-11-20 12:13:44,334 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 72 predicate places. [2022-11-20 12:13:44,335 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 168 transitions, 1110 flow [2022-11-20 12:13:44,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 85.8) internal successors, (1287), 15 states have internal predecessors, (1287), 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 12:13:44,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:44,336 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 12:13:44,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:13:44,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:44,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 502051581, now seen corresponding path program 1 times [2022-11-20 12:13:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:44,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068824549] [2022-11-20 12:13:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:44,575 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 12:13:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:44,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068824549] [2022-11-20 12:13:44,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068824549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:44,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:44,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:13:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183988224] [2022-11-20 12:13:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:44,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:13:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:44,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:13:44,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:13:44,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2022-11-20 12:13:44,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 168 transitions, 1110 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 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 12:13:44,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:44,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2022-11-20 12:13:44,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:45,486 INFO L130 PetriNetUnfolder]: 875/3508 cut-off events. [2022-11-20 12:13:45,486 INFO L131 PetriNetUnfolder]: For 17304/17475 co-relation queries the response was YES. [2022-11-20 12:13:45,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12111 conditions, 3508 events. 875/3508 cut-off events. For 17304/17475 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 38338 event pairs, 59 based on Foata normal form. 31/3354 useless extension candidates. Maximal degree in co-relation 11996. Up to 399 conditions per place. [2022-11-20 12:13:45,527 INFO L137 encePairwiseOnDemand]: 113/119 looper letters, 58 selfloop transitions, 3 changer transitions 34/217 dead transitions. [2022-11-20 12:13:45,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 217 transitions, 2151 flow [2022-11-20 12:13:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:13:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:13:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2022-11-20 12:13:45,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8607442977190877 [2022-11-20 12:13:45,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2022-11-20 12:13:45,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2022-11-20 12:13:45,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:45,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2022-11-20 12:13:45,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 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 12:13:45,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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 12:13:45,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 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 12:13:45,534 INFO L175 Difference]: Start difference. First operand has 196 places, 168 transitions, 1110 flow. Second operand 7 states and 717 transitions. [2022-11-20 12:13:45,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 217 transitions, 2151 flow [2022-11-20 12:13:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 217 transitions, 2100 flow, removed 16 selfloop flow, removed 13 redundant places. [2022-11-20 12:13:45,617 INFO L231 Difference]: Finished difference. Result has 185 places, 164 transitions, 1038 flow [2022-11-20 12:13:45,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1038, PETRI_PLACES=185, PETRI_TRANSITIONS=164} [2022-11-20 12:13:45,618 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 61 predicate places. [2022-11-20 12:13:45,619 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 164 transitions, 1038 flow [2022-11-20 12:13:45,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 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 12:13:45,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:45,628 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 12:13:45,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:13:45,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1078802263, now seen corresponding path program 2 times [2022-11-20 12:13:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297645907] [2022-11-20 12:13:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:13:45,887 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 12:13:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:13:45,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297645907] [2022-11-20 12:13:45,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297645907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:13:45,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:13:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:13:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156162689] [2022-11-20 12:13:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:13:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:13:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:13:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:13:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:13:45,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2022-11-20 12:13:45,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 164 transitions, 1038 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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 12:13:45,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:13:45,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2022-11-20 12:13:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:13:47,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([369] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24) v_~x$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~x$w_buff0_used~0_122) v_~x$w_buff0_used~0_121) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_26) v_~x$r_buff0_thd3~0_25) (= (ite .cse4 v_~x$w_buff0~0_45 (ite .cse0 v_~x$w_buff1~0_40 v_~x~0_72)) v_~x~0_71)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][175], [P0Thread1of1ForFork1InUse, 56#L758true, Black: 384#(= ~a~0 1), Black: 136#(= ~__unbuffered_p2_EAX~0 0), 96#L777true, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 259#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 52#L3true, 391#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 424#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 436#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 420#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 412#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), 453#(= ~y~0 1), Black: 161#(= ~x~0 0), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 296#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 209#true, Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 463#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), 489#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 465#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 459#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 98#L813true, Black: 346#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 409#(and (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 334#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 331#true, 159#true, Black: 225#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 235#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 229#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 221#(and (= ~x~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 376#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 223#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 372#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork2InUse, Black: 354#true, Black: 358#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 342#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 12:13:47,270 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-20 12:13:47,270 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 12:13:47,270 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 12:13:47,270 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-20 12:13:47,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([360] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_129 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_130 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_107 256) 0)) .cse1)) (.cse4 (and .cse5 .cse2))) (and (= v_~x$w_buff0_used~0_129 (ite .cse0 0 v_~x$w_buff0_used~0_130)) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse0 v_~x$w_buff0~0_51 (ite .cse3 v_~x$w_buff1~0_46 v_~x~0_80)) v_~x~0_79) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_33) v_~x$r_buff0_thd2~0_32)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_79, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][183], [P0Thread1of1ForFork1InUse, 86#L806true, 56#L758true, 459#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 384#(= ~a~0 1), Black: 136#(= ~__unbuffered_p2_EAX~0 0), Black: 271#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 259#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 108#L787true, 52#L3true, 391#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 424#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 436#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 420#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 412#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 161#(= ~x~0 0), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 296#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 209#true, Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 463#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), 489#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 465#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 453#(= ~y~0 1), Black: 346#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 409#(and (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 334#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 331#true, 159#true, Black: 225#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 235#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 229#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 221#(and (= ~x~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 376#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 223#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 372#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork2InUse, Black: 354#true, Black: 358#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 342#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 12:13:47,670 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,671 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,671 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,671 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([369] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24) v_~x$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~x$w_buff0_used~0_122) v_~x$w_buff0_used~0_121) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_26) v_~x$r_buff0_thd3~0_25) (= (ite .cse4 v_~x$w_buff0~0_45 (ite .cse0 v_~x$w_buff1~0_40 v_~x~0_72)) v_~x~0_71)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][175], [P0Thread1of1ForFork1InUse, 56#L758true, Black: 384#(= ~a~0 1), Black: 136#(= ~__unbuffered_p2_EAX~0 0), 96#L777true, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 259#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 391#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 424#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 436#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 420#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 412#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), 453#(= ~y~0 1), Black: 161#(= ~x~0 0), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 296#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 209#true, 119#L3-1true, Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 463#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), 489#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 465#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 459#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 98#L813true, 409#(and (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 346#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 334#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 331#true, 159#true, Black: 225#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 235#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 229#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 221#(and (= ~x~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 376#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 223#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 372#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, Black: 354#true, Black: 358#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 342#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 12:13:47,678 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,678 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,678 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:47,679 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-20 12:13:48,047 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([360] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_129 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_130 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_107 256) 0)) .cse1)) (.cse4 (and .cse5 .cse2))) (and (= v_~x$w_buff0_used~0_129 (ite .cse0 0 v_~x$w_buff0_used~0_130)) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse0 v_~x$w_buff0~0_51 (ite .cse3 v_~x$w_buff1~0_46 v_~x~0_80)) v_~x~0_79) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_33) v_~x$r_buff0_thd2~0_32)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_79, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][183], [P0Thread1of1ForFork1InUse, 86#L806true, 56#L758true, 459#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 384#(= ~a~0 1), Black: 136#(= ~__unbuffered_p2_EAX~0 0), Black: 271#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 259#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (not (= ~x~0 ~x$w_buff0~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 108#L787true, 391#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 424#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 436#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 420#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 412#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd3~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0)), Black: 161#(= ~x~0 0), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 296#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 209#true, 119#L3-1true, Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 463#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), 489#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 465#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 453#(= ~y~0 1), 409#(and (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 346#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 334#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 331#true, 159#true, Black: 225#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 235#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 229#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 221#(and (= ~x~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 376#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 223#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x~0)) (<= (div ~main$tmp_guard1~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (not (= 2 ~x$w_buff1~0))), Black: 372#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, Black: 354#true, Black: 358#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 342#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-20 12:13:48,047 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-20 12:13:48,048 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 12:13:48,048 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 12:13:48,048 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-20 12:13:48,512 INFO L130 PetriNetUnfolder]: 4388/8835 cut-off events. [2022-11-20 12:13:48,512 INFO L131 PetriNetUnfolder]: For 216407/221033 co-relation queries the response was YES. [2022-11-20 12:13:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54676 conditions, 8835 events. 4388/8835 cut-off events. For 216407/221033 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 81390 event pairs, 224 based on Foata normal form. 568/8965 useless extension candidates. Maximal degree in co-relation 54623. Up to 2686 conditions per place. [2022-11-20 12:13:48,564 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 34 selfloop transitions, 14 changer transitions 173/306 dead transitions. [2022-11-20 12:13:48,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 306 transitions, 3452 flow [2022-11-20 12:13:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:13:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:13:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1618 transitions. [2022-11-20 12:13:48,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8497899159663865 [2022-11-20 12:13:48,568 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1618 transitions. [2022-11-20 12:13:48,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1618 transitions. [2022-11-20 12:13:48,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:13:48,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1618 transitions. [2022-11-20 12:13:48,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.125) internal successors, (1618), 16 states have internal predecessors, (1618), 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 12:13:48,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 12:13:48,575 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 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 12:13:48,575 INFO L175 Difference]: Start difference. First operand has 185 places, 164 transitions, 1038 flow. Second operand 16 states and 1618 transitions. [2022-11-20 12:13:48,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 306 transitions, 3452 flow [2022-11-20 12:13:49,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 306 transitions, 3302 flow, removed 60 selfloop flow, removed 9 redundant places. [2022-11-20 12:13:49,068 INFO L231 Difference]: Finished difference. Result has 194 places, 122 transitions, 642 flow [2022-11-20 12:13:49,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=642, PETRI_PLACES=194, PETRI_TRANSITIONS=122} [2022-11-20 12:13:49,069 INFO L288 CegarLoopForPetriNet]: 124 programPoint places, 70 predicate places. [2022-11-20 12:13:49,069 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 122 transitions, 642 flow [2022-11-20 12:13:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 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 12:13:49,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:13:49,070 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] [2022-11-20 12:13:49,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:13:49,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:13:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:13:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1781132618, now seen corresponding path program 1 times [2022-11-20 12:13:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:13:49,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876766293] [2022-11-20 12:13:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:13:49,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:13:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:13:49,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:13:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:13:49,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:13:49,243 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:13:49,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 12:13:49,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 12:13:49,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 12:13:49,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 12:13:49,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 12:13:49,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 12:13:49,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:13:49,249 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:49,257 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:13:49,257 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:13:49,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:13:49 BasicIcfg [2022-11-20 12:13:49,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:13:49,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:13:49,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:13:49,418 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:13:49,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:25" (3/4) ... [2022-11-20 12:13:49,420 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:13:49,564 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:13:49,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:13:49,565 INFO L158 Benchmark]: Toolchain (without parser) took 25948.12ms. Allocated memory was 127.9MB in the beginning and 792.7MB in the end (delta: 664.8MB). Free memory was 95.1MB in the beginning and 469.0MB in the end (delta: -373.9MB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,565 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 127.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:13:49,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.68ms. Allocated memory is still 127.9MB. Free memory was 94.7MB in the beginning and 71.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.74ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 68.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,566 INFO L158 Benchmark]: Boogie Preprocessor took 68.94ms. Allocated memory is still 127.9MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,567 INFO L158 Benchmark]: RCFGBuilder took 848.23ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 67.0MB in the beginning and 112.9MB in the end (delta: -45.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,567 INFO L158 Benchmark]: TraceAbstraction took 24204.97ms. Allocated memory was 167.8MB in the beginning and 792.7MB in the end (delta: 625.0MB). Free memory was 111.9MB in the beginning and 494.2MB in the end (delta: -382.3MB). Peak memory consumption was 243.6MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,568 INFO L158 Benchmark]: Witness Printer took 147.08ms. Allocated memory is still 792.7MB. Free memory was 494.2MB in the beginning and 469.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 12:13:49,570 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.26ms. Allocated memory is still 127.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.68ms. Allocated memory is still 127.9MB. Free memory was 94.7MB in the beginning and 71.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.74ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 68.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.94ms. Allocated memory is still 127.9MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 848.23ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 67.0MB in the beginning and 112.9MB in the end (delta: -45.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24204.97ms. Allocated memory was 167.8MB in the beginning and 792.7MB in the end (delta: 625.0MB). Free memory was 111.9MB in the beginning and 494.2MB in the end (delta: -382.3MB). Peak memory consumption was 243.6MB. Max. memory is 16.1GB. * Witness Printer took 147.08ms. Allocated memory is still 792.7MB. Free memory was 494.2MB in the beginning and 469.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] 0 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 833]: 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: 835]: 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: 831]: 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 7 procedures, 148 locations, 6 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: 23.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1009 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1009 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 781 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1816 IncrementalHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 191 mSDtfsCounter, 1816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1110occurred in iteration=10, InterpolantAutomatonStates: 158, 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.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 6778 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 12:13:49,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d604d29-93d4-4e4b-80f2-b7f0325f5894/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