./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:58:57,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:58:57,878 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 20:58:57,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:58:57,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:58:57,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:58:57,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:58:57,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:58:57,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 20:58:57,943 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 20:58:57,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:58:57,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:58:57,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:58:57,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:58:57,948 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:58:57,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:58:57,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:58:57,950 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:58:57,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:58:57,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:58:57,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:58:57,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:58:57,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:58:57,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:58:57,953 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:58:57,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:58:57,955 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:58:57,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:58:57,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:58:57,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:58:57,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:58:57,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:58:57,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:58:57,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:58:57,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:58:57,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:58:57,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:58:57,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:58:57,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:58:57,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:58:57,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:58:57,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:58:57,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/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_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c [2023-11-21 20:58:58,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:58:58,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:58:58,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:58:58,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:58:58,291 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:58:58,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-21 20:59:01,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:59:01,639 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:59:01,640 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-21 20:59:01,673 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/data/d57bdd3ec/d1d8762663dc41a0a16acbe4ac14866a/FLAG8d5e5079f [2023-11-21 20:59:01,687 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/data/d57bdd3ec/d1d8762663dc41a0a16acbe4ac14866a [2023-11-21 20:59:01,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:59:01,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:59:01,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:01,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:59:01,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:59:01,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:01" (1/1) ... [2023-11-21 20:59:01,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418a4734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:01, skipping insertion in model container [2023-11-21 20:59:01,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:01" (1/1) ... [2023-11-21 20:59:01,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:59:01,963 WARN L240 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_1fddf2d6-1e22-492e-8b63-b92e94c80c32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-21 20:59:02,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:02,333 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:59:02,348 WARN L240 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_1fddf2d6-1e22-492e-8b63-b92e94c80c32/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-21 20:59:02,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:02,499 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 20:59:02,499 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 20:59:02,508 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:59:02,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02 WrapperNode [2023-11-21 20:59:02,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:02,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:02,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:59:02,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:59:02,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,590 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-21 20:59:02,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:02,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:59:02,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:59:02,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:59:02,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,607 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,641 INFO L187 HeapSplitter]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1] [2023-11-21 20:59:02,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:59:02,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:59:02,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:59:02,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:59:02,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (1/1) ... [2023-11-21 20:59:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:02,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:59:02,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:59:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 20:59:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 20:59:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 20:59:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 20:59:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 20:59:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 20:59:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:59:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:59:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:59:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 20:59:02,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 20:59:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 20:59:02,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 20:59:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 20:59:02,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 20:59:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 20:59:02,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 20:59:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 20:59:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 20:59:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 20:59:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 20:59:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 20:59:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 20:59:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:59:02,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:59:02,783 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 20:59:02,993 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:59:02,996 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:59:03,484 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:59:03,772 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:59:03,772 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 20:59:03,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:03 BoogieIcfgContainer [2023-11-21 20:59:03,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:59:03,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:59:03,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:59:03,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:59:03,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:59:01" (1/3) ... [2023-11-21 20:59:03,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf3c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:03, skipping insertion in model container [2023-11-21 20:59:03,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:02" (2/3) ... [2023-11-21 20:59:03,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf3c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:03, skipping insertion in model container [2023-11-21 20:59:03,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:03" (3/3) ... [2023-11-21 20:59:03,786 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-11-21 20:59:03,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 20:59:03,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:59:03,809 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 20:59:03,810 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 20:59:03,886 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 20:59:03,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 20:59:03,989 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-21 20:59:03,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 20:59:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-21 20:59:03,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 20:59:04,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-21 20:59:04,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:59:04,032 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=LoopHeads, 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;@2035d4a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:59:04,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 20:59:04,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 20:59:04,049 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-21 20:59:04,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 20:59:04,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:04,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:04,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:04,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2121325545, now seen corresponding path program 1 times [2023-11-21 20:59:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453566660] [2023-11-21 20:59:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453566660] [2023-11-21 20:59:04,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453566660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:04,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 20:59:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370811956] [2023-11-21 20:59:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:04,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2023-11-21 20:59:04,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-21 20:59:04,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:04,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2023-11-21 20:59:04,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:05,316 INFO L124 PetriNetUnfolderBase]: 1153/1995 cut-off events. [2023-11-21 20:59:05,316 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-21 20:59:05,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1995 events. 1153/1995 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13651 event pairs, 355 based on Foata normal form. 72/1993 useless extension candidates. Maximal degree in co-relation 3705. Up to 1303 conditions per place. [2023-11-21 20:59:05,349 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-21 20:59:05,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 193 flow [2023-11-21 20:59:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-21 20:59:05,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.78 [2023-11-21 20:59:05,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-21 20:59:05,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-21 20:59:05,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:05,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-21 20:59:05,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2023-11-21 20:59:05,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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) [2023-11-21 20:59:05,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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) [2023-11-21 20:59:05,383 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-21 20:59:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 193 flow [2023-11-21 20:59:05,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 20:59:05,396 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-21 20:59:05,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-21 20:59:05,403 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-21 20:59:05,404 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-21 20:59:05,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-21 20:59:05,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:05,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:59:05,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:05,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 44838873, now seen corresponding path program 1 times [2023-11-21 20:59:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245544950] [2023-11-21 20:59:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245544950] [2023-11-21 20:59:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245544950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919509966] [2023-11-21 20:59:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:59:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:59:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:59:05,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 20:59:05,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2023-11-21 20:59:05,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:05,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 20:59:05,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:07,171 INFO L124 PetriNetUnfolderBase]: 4629/7360 cut-off events. [2023-11-21 20:59:07,171 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-11-21 20:59:07,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14272 conditions, 7360 events. 4629/7360 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 52750 event pairs, 663 based on Foata normal form. 240/7319 useless extension candidates. Maximal degree in co-relation 14262. Up to 3569 conditions per place. [2023-11-21 20:59:07,251 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2023-11-21 20:59:07,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2023-11-21 20:59:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:59:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 20:59:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-21 20:59:07,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715 [2023-11-21 20:59:07,254 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-21 20:59:07,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-21 20:59:07,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:07,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-21 20:59:07,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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) [2023-11-21 20:59:07,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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) [2023-11-21 20:59:07,259 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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) [2023-11-21 20:59:07,259 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2023-11-21 20:59:07,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2023-11-21 20:59:07,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:07,263 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2023-11-21 20:59:07,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-21 20:59:07,265 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-21 20:59:07,265 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2023-11-21 20:59:07,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2023-11-21 20:59:07,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:07,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:07,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:59:07,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:07,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1115886921, now seen corresponding path program 1 times [2023-11-21 20:59:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626507067] [2023-11-21 20:59:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:07,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626507067] [2023-11-21 20:59:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626507067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:59:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375342994] [2023-11-21 20:59:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:07,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:59:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:59:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:07,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 20:59:07,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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) [2023-11-21 20:59:07,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:07,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 20:59:07,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:08,639 INFO L124 PetriNetUnfolderBase]: 3853/6124 cut-off events. [2023-11-21 20:59:08,639 INFO L125 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2023-11-21 20:59:08,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 6124 events. 3853/6124 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 42109 event pairs, 249 based on Foata normal form. 228/6139 useless extension candidates. Maximal degree in co-relation 13894. Up to 2561 conditions per place. [2023-11-21 20:59:08,705 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2023-11-21 20:59:08,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2023-11-21 20:59:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:59:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 20:59:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-21 20:59:08,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.728 [2023-11-21 20:59:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-21 20:59:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-21 20:59:08,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-21 20:59:08,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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) [2023-11-21 20:59:08,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:08,712 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:08,713 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2023-11-21 20:59:08,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2023-11-21 20:59:08,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:08,719 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2023-11-21 20:59:08,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-21 20:59:08,721 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-21 20:59:08,721 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2023-11-21 20:59:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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) [2023-11-21 20:59:08,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:08,722 INFO L208 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] [2023-11-21 20:59:08,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:59:08,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:08,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1463919532, now seen corresponding path program 1 times [2023-11-21 20:59:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:08,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678189541] [2023-11-21 20:59:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678189541] [2023-11-21 20:59:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678189541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:09,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258871006] [2023-11-21 20:59:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:09,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:09,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:09,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 20:59:09,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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) [2023-11-21 20:59:09,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:09,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 20:59:09,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:10,108 INFO L124 PetriNetUnfolderBase]: 2645/4124 cut-off events. [2023-11-21 20:59:10,108 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2023-11-21 20:59:10,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10686 conditions, 4124 events. 2645/4124 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24788 event pairs, 115 based on Foata normal form. 172/4182 useless extension candidates. Maximal degree in co-relation 10672. Up to 1100 conditions per place. [2023-11-21 20:59:10,154 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2023-11-21 20:59:10,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2023-11-21 20:59:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-21 20:59:10,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73 [2023-11-21 20:59:10,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-21 20:59:10,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-21 20:59:10,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:10,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-21 20:59:10,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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) [2023-11-21 20:59:10,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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) [2023-11-21 20:59:10,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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) [2023-11-21 20:59:10,165 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2023-11-21 20:59:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2023-11-21 20:59:10,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 20:59:10,188 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2023-11-21 20:59:10,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-21 20:59:10,191 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-21 20:59:10,191 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2023-11-21 20:59:10,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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) [2023-11-21 20:59:10,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:10,192 INFO L208 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] [2023-11-21 20:59:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:59:10,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:10,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -400823527, now seen corresponding path program 1 times [2023-11-21 20:59:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106860252] [2023-11-21 20:59:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:10,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106860252] [2023-11-21 20:59:10,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106860252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:10,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:10,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 20:59:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579798877] [2023-11-21 20:59:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:10,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-21 20:59:10,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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) [2023-11-21 20:59:10,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:10,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-21 20:59:10,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:11,179 INFO L124 PetriNetUnfolderBase]: 1793/2668 cut-off events. [2023-11-21 20:59:11,180 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-11-21 20:59:11,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 2668 events. 1793/2668 cut-off events. For 3624/3624 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13892 event pairs, 77 based on Foata normal form. 80/2698 useless extension candidates. Maximal degree in co-relation 7736. Up to 828 conditions per place. [2023-11-21 20:59:11,204 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2023-11-21 20:59:11,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2023-11-21 20:59:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:59:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 20:59:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-21 20:59:11,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-21 20:59:11,207 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-21 20:59:11,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-21 20:59:11,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:11,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-21 20:59:11,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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) [2023-11-21 20:59:11,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:11,211 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:11,211 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2023-11-21 20:59:11,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2023-11-21 20:59:11,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 20:59:11,241 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2023-11-21 20:59:11,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-21 20:59:11,244 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-21 20:59:11,244 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2023-11-21 20:59:11,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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) [2023-11-21 20:59:11,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:11,245 INFO L208 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] [2023-11-21 20:59:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:59:11,246 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:11,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1378710490, now seen corresponding path program 1 times [2023-11-21 20:59:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781437093] [2023-11-21 20:59:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781437093] [2023-11-21 20:59:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781437093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138488] [2023-11-21 20:59:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:59:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:59:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:11,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2023-11-21 20:59:11,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2023-11-21 20:59:11,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:11,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2023-11-21 20:59:11,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:13,361 INFO L124 PetriNetUnfolderBase]: 6763/10473 cut-off events. [2023-11-21 20:59:13,362 INFO L125 PetriNetUnfolderBase]: For 3761/3947 co-relation queries the response was YES. [2023-11-21 20:59:13,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23968 conditions, 10473 events. 6763/10473 cut-off events. For 3761/3947 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 70782 event pairs, 2183 based on Foata normal form. 16/10049 useless extension candidates. Maximal degree in co-relation 23952. Up to 5183 conditions per place. [2023-11-21 20:59:13,492 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 40 selfloop transitions, 9 changer transitions 12/87 dead transitions. [2023-11-21 20:59:13,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 448 flow [2023-11-21 20:59:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:59:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 20:59:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2023-11-21 20:59:13,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.608 [2023-11-21 20:59:13,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 152 transitions. [2023-11-21 20:59:13,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 152 transitions. [2023-11-21 20:59:13,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:13,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 152 transitions. [2023-11-21 20:59:13,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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) [2023-11-21 20:59:13,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:13,500 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:13,500 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 5 states and 152 transitions. [2023-11-21 20:59:13,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 448 flow [2023-11-21 20:59:13,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 342 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-21 20:59:13,671 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 226 flow [2023-11-21 20:59:13,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-11-21 20:59:13,675 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-11-21 20:59:13,675 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 226 flow [2023-11-21 20:59:13,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2023-11-21 20:59:13,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:13,676 INFO L208 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] [2023-11-21 20:59:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 20:59:13,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:13,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1420164654, now seen corresponding path program 2 times [2023-11-21 20:59:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905260506] [2023-11-21 20:59:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905260506] [2023-11-21 20:59:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905260506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:14,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:59:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056450425] [2023-11-21 20:59:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:14,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 20:59:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 20:59:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:59:14,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-21 20:59:14,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 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) [2023-11-21 20:59:14,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:14,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-21 20:59:14,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:16,408 INFO L124 PetriNetUnfolderBase]: 6091/10756 cut-off events. [2023-11-21 20:59:16,409 INFO L125 PetriNetUnfolderBase]: For 1343/1524 co-relation queries the response was YES. [2023-11-21 20:59:16,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22921 conditions, 10756 events. 6091/10756 cut-off events. For 1343/1524 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 86676 event pairs, 1620 based on Foata normal form. 62/9725 useless extension candidates. Maximal degree in co-relation 22906. Up to 2714 conditions per place. [2023-11-21 20:59:16,506 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 49 selfloop transitions, 9 changer transitions 14/112 dead transitions. [2023-11-21 20:59:16,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 490 flow [2023-11-21 20:59:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 20:59:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 20:59:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 295 transitions. [2023-11-21 20:59:16,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2023-11-21 20:59:16,509 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 295 transitions. [2023-11-21 20:59:16,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 295 transitions. [2023-11-21 20:59:16,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:16,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 295 transitions. [2023-11-21 20:59:16,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 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) [2023-11-21 20:59:16,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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) [2023-11-21 20:59:16,513 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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) [2023-11-21 20:59:16,513 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 226 flow. Second operand 9 states and 295 transitions. [2023-11-21 20:59:16,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 490 flow [2023-11-21 20:59:16,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 462 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-21 20:59:16,523 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 270 flow [2023-11-21 20:59:16,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2023-11-21 20:59:16,525 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2023-11-21 20:59:16,525 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 270 flow [2023-11-21 20:59:16,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 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) [2023-11-21 20:59:16,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:16,526 INFO L208 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] [2023-11-21 20:59:16,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 20:59:16,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:16,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1318668764, now seen corresponding path program 3 times [2023-11-21 20:59:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861410741] [2023-11-21 20:59:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:16,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861410741] [2023-11-21 20:59:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861410741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:16,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909398765] [2023-11-21 20:59:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:59:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:59:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:16,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-21 20:59:16,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2023-11-21 20:59:16,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:16,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-21 20:59:16,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:18,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L787: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_40 256) 0))) (let ((.cse9 (not .cse8)) (.cse1 (and .cse11 .cse8)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_51 256) 0) .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_58 256) 0))) (let ((.cse5 (or .cse1 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_57 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_50 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse4 (ite .cse5 v_~y~0_49 (ite .cse6 v_~y$w_buff0~0_29 v_~y$w_buff1~0_28)))) (and (= v_~y~0_49 v_~y$mem_tmp~0_20) (= v_~y$w_buff1_used~0_50 (ite .cse0 v_~y$w_buff1_used~0_51 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_51 0))) (= v_~y$w_buff0~0_29 v_~y$w_buff0~0_28) (= v_~__unbuffered_p1_EBX~0_18 .cse4) (= v_~y$w_buff0_used~0_57 (ite .cse0 v_~y$w_buff0_used~0_58 (ite .cse5 v_~y$w_buff0_used~0_58 (ite .cse6 0 v_~y$w_buff0_used~0_58)))) (= v_~y$r_buff0_thd2~0_39 (ite .cse0 v_~y$r_buff0_thd2~0_40 (ite (or .cse1 .cse2 (and .cse7 .cse8)) v_~y$r_buff0_thd2~0_40 (ite (and .cse9 (not .cse2)) 0 v_~y$r_buff0_thd2~0_40)))) (= v_~y$w_buff1~0_28 v_~y$w_buff1~0_27) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_39 256) 0))) (or .cse2 (and .cse7 .cse10) (and .cse11 .cse10))) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~y~0_48 (ite .cse0 v_~y$mem_tmp~0_20 .cse4)) (= 0 v_~y$flush_delayed~0_33)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_40, ~y~0=v_~y~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_57, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~y~0=v_~y~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_50} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][54], [16#L832true, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 34#L761true, 15#L787true, 160#true, P1Thread1of1ForFork1InUse, Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,376 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,377 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,377 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,377 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L835-->L842: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_89 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$r_buff0_thd4~0_29 (ite .cse1 0 v_~y$r_buff0_thd4~0_30)) (= v_~y$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_56 (ite .cse0 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_39 v_~y~0_57))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][71], [139#(= ~y$r_buff0_thd2~0 0), 33#L842true, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 36#L768true, 38#P2EXITtrue, 34#L761true, 160#true, P1Thread1of1ForFork1InUse, Black: 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,390 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,391 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 20:59:18,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L787: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_40 256) 0))) (let ((.cse9 (not .cse8)) (.cse1 (and .cse11 .cse8)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_51 256) 0) .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_58 256) 0))) (let ((.cse5 (or .cse1 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_57 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_50 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse4 (ite .cse5 v_~y~0_49 (ite .cse6 v_~y$w_buff0~0_29 v_~y$w_buff1~0_28)))) (and (= v_~y~0_49 v_~y$mem_tmp~0_20) (= v_~y$w_buff1_used~0_50 (ite .cse0 v_~y$w_buff1_used~0_51 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_51 0))) (= v_~y$w_buff0~0_29 v_~y$w_buff0~0_28) (= v_~__unbuffered_p1_EBX~0_18 .cse4) (= v_~y$w_buff0_used~0_57 (ite .cse0 v_~y$w_buff0_used~0_58 (ite .cse5 v_~y$w_buff0_used~0_58 (ite .cse6 0 v_~y$w_buff0_used~0_58)))) (= v_~y$r_buff0_thd2~0_39 (ite .cse0 v_~y$r_buff0_thd2~0_40 (ite (or .cse1 .cse2 (and .cse7 .cse8)) v_~y$r_buff0_thd2~0_40 (ite (and .cse9 (not .cse2)) 0 v_~y$r_buff0_thd2~0_40)))) (= v_~y$w_buff1~0_28 v_~y$w_buff1~0_27) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_39 256) 0))) (or .cse2 (and .cse7 .cse10) (and .cse11 .cse10))) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~y~0_48 (ite .cse0 v_~y$mem_tmp~0_20 .cse4)) (= 0 v_~y$flush_delayed~0_33)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_40, ~y~0=v_~y~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_57, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~y~0=v_~y~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_50} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][54], [37#P0EXITtrue, 16#L832true, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 15#L787true, 160#true, P1Thread1of1ForFork1InUse, Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,539 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,539 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,539 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,540 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L835-->L842: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_89 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$r_buff0_thd4~0_29 (ite .cse1 0 v_~y$r_buff0_thd4~0_30)) (= v_~y$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_56 (ite .cse0 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_39 v_~y~0_57))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][71], [139#(= ~y$r_buff0_thd2~0 0), 33#L842true, 41#L867true, 3#L771true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 34#L761true, 160#true, P1Thread1of1ForFork1InUse, Black: 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,558 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L787: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_40 256) 0))) (let ((.cse9 (not .cse8)) (.cse1 (and .cse11 .cse8)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_51 256) 0) .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_58 256) 0))) (let ((.cse5 (or .cse1 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_57 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_50 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse4 (ite .cse5 v_~y~0_49 (ite .cse6 v_~y$w_buff0~0_29 v_~y$w_buff1~0_28)))) (and (= v_~y~0_49 v_~y$mem_tmp~0_20) (= v_~y$w_buff1_used~0_50 (ite .cse0 v_~y$w_buff1_used~0_51 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_51 0))) (= v_~y$w_buff0~0_29 v_~y$w_buff0~0_28) (= v_~__unbuffered_p1_EBX~0_18 .cse4) (= v_~y$w_buff0_used~0_57 (ite .cse0 v_~y$w_buff0_used~0_58 (ite .cse5 v_~y$w_buff0_used~0_58 (ite .cse6 0 v_~y$w_buff0_used~0_58)))) (= v_~y$r_buff0_thd2~0_39 (ite .cse0 v_~y$r_buff0_thd2~0_40 (ite (or .cse1 .cse2 (and .cse7 .cse8)) v_~y$r_buff0_thd2~0_40 (ite (and .cse9 (not .cse2)) 0 v_~y$r_buff0_thd2~0_40)))) (= v_~y$w_buff1~0_28 v_~y$w_buff1~0_27) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_39 256) 0))) (or .cse2 (and .cse7 .cse10) (and .cse11 .cse10))) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~y~0_48 (ite .cse0 v_~y$mem_tmp~0_20 .cse4)) (= 0 v_~y$flush_delayed~0_33)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_40, ~y~0=v_~y~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_57, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~y~0=v_~y~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_50} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][54], [41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 5#L835true, 34#L761true, 15#L787true, 160#true, P1Thread1of1ForFork1InUse, Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,559 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,559 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,560 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,560 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L835-->L842: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_89 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$r_buff0_thd4~0_29 (ite .cse1 0 v_~y$r_buff0_thd4~0_30)) (= v_~y$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_56 (ite .cse0 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_39 v_~y~0_57))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][71], [139#(= ~y$r_buff0_thd2~0 0), 37#P0EXITtrue, 33#L842true, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 36#L768true, 38#P2EXITtrue, 160#true, P1Thread1of1ForFork1InUse, Black: 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,568 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 20:59:18,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L835-->L842: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_89 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$r_buff0_thd4~0_29 (ite .cse1 0 v_~y$r_buff0_thd4~0_30)) (= v_~y$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_56 (ite .cse0 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_39 v_~y~0_57))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][71], [139#(= ~y$r_buff0_thd2~0 0), 37#P0EXITtrue, 33#L842true, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 3#L771true, 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 160#true, P1Thread1of1ForFork1InUse, Black: 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,708 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,708 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,708 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,708 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L787: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_40 256) 0))) (let ((.cse9 (not .cse8)) (.cse1 (and .cse11 .cse8)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_51 256) 0) .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_58 256) 0))) (let ((.cse5 (or .cse1 .cse3 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_57 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_50 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse4 (ite .cse5 v_~y~0_49 (ite .cse6 v_~y$w_buff0~0_29 v_~y$w_buff1~0_28)))) (and (= v_~y~0_49 v_~y$mem_tmp~0_20) (= v_~y$w_buff1_used~0_50 (ite .cse0 v_~y$w_buff1_used~0_51 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_51 0))) (= v_~y$w_buff0~0_29 v_~y$w_buff0~0_28) (= v_~__unbuffered_p1_EBX~0_18 .cse4) (= v_~y$w_buff0_used~0_57 (ite .cse0 v_~y$w_buff0_used~0_58 (ite .cse5 v_~y$w_buff0_used~0_58 (ite .cse6 0 v_~y$w_buff0_used~0_58)))) (= v_~y$r_buff0_thd2~0_39 (ite .cse0 v_~y$r_buff0_thd2~0_40 (ite (or .cse1 .cse2 (and .cse7 .cse8)) v_~y$r_buff0_thd2~0_40 (ite (and .cse9 (not .cse2)) 0 v_~y$r_buff0_thd2~0_40)))) (= v_~y$w_buff1~0_28 v_~y$w_buff1~0_27) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_39 256) 0))) (or .cse2 (and .cse7 .cse10) (and .cse11 .cse10))) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~y~0_48 (ite .cse0 v_~y$mem_tmp~0_20 .cse4)) (= 0 v_~y$flush_delayed~0_33)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_40, ~y~0=v_~y~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_57, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~y~0=v_~y~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_50} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][54], [37#P0EXITtrue, 41#L867true, Black: 125#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 38#P2EXITtrue, 5#L835true, 146#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 15#L787true, 160#true, P1Thread1of1ForFork1InUse, Black: 140#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), P3Thread1of1ForFork0InUse, Black: 141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 148#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1)), P0Thread1of1ForFork3InUse, Black: 152#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), Black: 150#(and (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EBX~0 1)), P2Thread1of1ForFork2InUse]) [2023-11-21 20:59:18,709 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,709 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,709 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:18,710 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 20:59:20,081 INFO L124 PetriNetUnfolderBase]: 12254/21003 cut-off events. [2023-11-21 20:59:20,082 INFO L125 PetriNetUnfolderBase]: For 9957/10442 co-relation queries the response was YES. [2023-11-21 20:59:20,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49179 conditions, 21003 events. 12254/21003 cut-off events. For 9957/10442 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 179831 event pairs, 4712 based on Foata normal form. 75/18885 useless extension candidates. Maximal degree in co-relation 49160. Up to 8033 conditions per place. [2023-11-21 20:59:20,241 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 53 selfloop transitions, 4 changer transitions 14/107 dead transitions. [2023-11-21 20:59:20,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 550 flow [2023-11-21 20:59:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:59:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 20:59:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-21 20:59:20,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672 [2023-11-21 20:59:20,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-21 20:59:20,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-21 20:59:20,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:20,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-21 20:59:20,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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) [2023-11-21 20:59:20,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:20,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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) [2023-11-21 20:59:20,246 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 270 flow. Second operand 5 states and 168 transitions. [2023-11-21 20:59:20,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 550 flow [2023-11-21 20:59:20,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 543 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-21 20:59:20,320 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 295 flow [2023-11-21 20:59:20,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2023-11-21 20:59:20,323 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2023-11-21 20:59:20,323 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 295 flow [2023-11-21 20:59:20,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2023-11-21 20:59:20,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:20,324 INFO L208 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] [2023-11-21 20:59:20,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:59:20,324 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1742551102, now seen corresponding path program 4 times [2023-11-21 20:59:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327004262] [2023-11-21 20:59:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327004262] [2023-11-21 20:59:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327004262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 20:59:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919444415] [2023-11-21 20:59:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:20,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:20,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-21 20:59:20,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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) [2023-11-21 20:59:20,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:20,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-21 20:59:20,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:24,832 INFO L124 PetriNetUnfolderBase]: 21137/33699 cut-off events. [2023-11-21 20:59:24,832 INFO L125 PetriNetUnfolderBase]: For 17641/17641 co-relation queries the response was YES. [2023-11-21 20:59:24,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83827 conditions, 33699 events. 21137/33699 cut-off events. For 17641/17641 co-relation queries the response was YES. Maximal size of possible extension queue 1960. Compared 274265 event pairs, 4439 based on Foata normal form. 16/31898 useless extension candidates. Maximal degree in co-relation 83807. Up to 12992 conditions per place. [2023-11-21 20:59:25,051 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 88 selfloop transitions, 25 changer transitions 17/155 dead transitions. [2023-11-21 20:59:25,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 155 transitions, 883 flow [2023-11-21 20:59:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 20:59:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 20:59:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2023-11-21 20:59:25,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6314285714285715 [2023-11-21 20:59:25,054 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 221 transitions. [2023-11-21 20:59:25,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 221 transitions. [2023-11-21 20:59:25,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:25,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 221 transitions. [2023-11-21 20:59:25,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 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) [2023-11-21 20:59:25,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:25,057 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:25,058 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 295 flow. Second operand 7 states and 221 transitions. [2023-11-21 20:59:25,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 155 transitions, 883 flow [2023-11-21 20:59:25,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 155 transitions, 871 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-21 20:59:25,234 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 482 flow [2023-11-21 20:59:25,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2023-11-21 20:59:25,235 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-21 20:59:25,235 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 482 flow [2023-11-21 20:59:25,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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) [2023-11-21 20:59:25,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:25,236 INFO L208 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] [2023-11-21 20:59:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:59:25,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:25,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1986590066, now seen corresponding path program 5 times [2023-11-21 20:59:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226271029] [2023-11-21 20:59:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226271029] [2023-11-21 20:59:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226271029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:25,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:25,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:59:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758988150] [2023-11-21 20:59:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:25,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:25,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-21 20:59:25,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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) [2023-11-21 20:59:25,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:25,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-21 20:59:25,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:31,350 INFO L124 PetriNetUnfolderBase]: 29936/48077 cut-off events. [2023-11-21 20:59:31,351 INFO L125 PetriNetUnfolderBase]: For 46932/46932 co-relation queries the response was YES. [2023-11-21 20:59:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131592 conditions, 48077 events. 29936/48077 cut-off events. For 46932/46932 co-relation queries the response was YES. Maximal size of possible extension queue 2943. Compared 418331 event pairs, 6299 based on Foata normal form. 16/45274 useless extension candidates. Maximal degree in co-relation 131568. Up to 16307 conditions per place. [2023-11-21 20:59:31,694 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 71 selfloop transitions, 17 changer transitions 68/181 dead transitions. [2023-11-21 20:59:31,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 181 transitions, 1204 flow [2023-11-21 20:59:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 20:59:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 20:59:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2023-11-21 20:59:31,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6325 [2023-11-21 20:59:31,699 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 253 transitions. [2023-11-21 20:59:31,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 253 transitions. [2023-11-21 20:59:31,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:31,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 253 transitions. [2023-11-21 20:59:31,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 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) [2023-11-21 20:59:31,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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) [2023-11-21 20:59:31,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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) [2023-11-21 20:59:31,705 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 482 flow. Second operand 8 states and 253 transitions. [2023-11-21 20:59:31,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 181 transitions, 1204 flow [2023-11-21 20:59:32,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 181 transitions, 1196 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:32,048 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 414 flow [2023-11-21 20:59:32,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2023-11-21 20:59:32,049 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-21 20:59:32,049 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 414 flow [2023-11-21 20:59:32,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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) [2023-11-21 20:59:32,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:32,050 INFO L208 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] [2023-11-21 20:59:32,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:59:32,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:32,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1900824392, now seen corresponding path program 6 times [2023-11-21 20:59:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458031818] [2023-11-21 20:59:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458031818] [2023-11-21 20:59:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458031818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 20:59:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451179737] [2023-11-21 20:59:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:32,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:32,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2023-11-21 20:59:32,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2023-11-21 20:59:32,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:32,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2023-11-21 20:59:32,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:36,383 INFO L124 PetriNetUnfolderBase]: 19456/32522 cut-off events. [2023-11-21 20:59:36,383 INFO L125 PetriNetUnfolderBase]: For 40093/40153 co-relation queries the response was YES. [2023-11-21 20:59:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90243 conditions, 32522 events. 19456/32522 cut-off events. For 40093/40153 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 284461 event pairs, 6212 based on Foata normal form. 16/30343 useless extension candidates. Maximal degree in co-relation 90216. Up to 15328 conditions per place. [2023-11-21 20:59:36,598 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 42 selfloop transitions, 5 changer transitions 60/134 dead transitions. [2023-11-21 20:59:36,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 917 flow [2023-11-21 20:59:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2023-11-21 20:59:36,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2023-11-21 20:59:36,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 186 transitions. [2023-11-21 20:59:36,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 186 transitions. [2023-11-21 20:59:36,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:36,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 186 transitions. [2023-11-21 20:59:36,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 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) [2023-11-21 20:59:36,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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) [2023-11-21 20:59:36,604 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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) [2023-11-21 20:59:36,605 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 414 flow. Second operand 6 states and 186 transitions. [2023-11-21 20:59:36,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 917 flow [2023-11-21 20:59:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 812 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-11-21 20:59:36,872 INFO L231 Difference]: Finished difference. Result has 83 places, 61 transitions, 263 flow [2023-11-21 20:59:36,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=83, PETRI_TRANSITIONS=61} [2023-11-21 20:59:36,873 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2023-11-21 20:59:36,874 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 61 transitions, 263 flow [2023-11-21 20:59:36,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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) [2023-11-21 20:59:36,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:36,874 INFO L208 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] [2023-11-21 20:59:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:59:36,874 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:36,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -180254760, now seen corresponding path program 7 times [2023-11-21 20:59:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90970480] [2023-11-21 20:59:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:38,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:38,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90970480] [2023-11-21 20:59:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90970480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:38,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 20:59:38,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130913418] [2023-11-21 20:59:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:38,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 20:59:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 20:59:38,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 20:59:38,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2023-11-21 20:59:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 61 transitions, 263 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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) [2023-11-21 20:59:38,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:38,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2023-11-21 20:59:38,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:39,426 INFO L124 PetriNetUnfolderBase]: 3971/6779 cut-off events. [2023-11-21 20:59:39,426 INFO L125 PetriNetUnfolderBase]: For 5456/5486 co-relation queries the response was YES. [2023-11-21 20:59:39,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17213 conditions, 6779 events. 3971/6779 cut-off events. For 5456/5486 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 48577 event pairs, 1154 based on Foata normal form. 16/6224 useless extension candidates. Maximal degree in co-relation 17188. Up to 2554 conditions per place. [2023-11-21 20:59:39,481 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 38 selfloop transitions, 9 changer transitions 41/115 dead transitions. [2023-11-21 20:59:39,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 115 transitions, 637 flow [2023-11-21 20:59:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:59:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 20:59:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 264 transitions. [2023-11-21 20:59:39,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528 [2023-11-21 20:59:39,484 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 264 transitions. [2023-11-21 20:59:39,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 264 transitions. [2023-11-21 20:59:39,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:39,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 264 transitions. [2023-11-21 20:59:39,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 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) [2023-11-21 20:59:39,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 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) [2023-11-21 20:59:39,488 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 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) [2023-11-21 20:59:39,488 INFO L175 Difference]: Start difference. First operand has 83 places, 61 transitions, 263 flow. Second operand 10 states and 264 transitions. [2023-11-21 20:59:39,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 115 transitions, 637 flow [2023-11-21 20:59:39,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 563 flow, removed 14 selfloop flow, removed 10 redundant places. [2023-11-21 20:59:39,502 INFO L231 Difference]: Finished difference. Result has 85 places, 59 transitions, 244 flow [2023-11-21 20:59:39,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=85, PETRI_TRANSITIONS=59} [2023-11-21 20:59:39,503 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2023-11-21 20:59:39,503 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 59 transitions, 244 flow [2023-11-21 20:59:39,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 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) [2023-11-21 20:59:39,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:39,504 INFO L208 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] [2023-11-21 20:59:39,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:59:39,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 20:59:39,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -348204820, now seen corresponding path program 8 times [2023-11-21 20:59:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92289188] [2023-11-21 20:59:39,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:59:39,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:59:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:59:39,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:59:39,630 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 20:59:39,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-21 20:59:39,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-21 20:59:39,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-21 20:59:39,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-21 20:59:39,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-21 20:59:39,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-21 20:59:39,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-21 20:59:39,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 20:59:39,635 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1] [2023-11-21 20:59:39,642 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 20:59:39,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 20:59:39,715 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 20:59:39,722 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 20:59:39,725 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 20:59:39,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 20:59:39,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:59:39 BasicIcfg [2023-11-21 20:59:39,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 20:59:39,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 20:59:39,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 20:59:39,782 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 20:59:39,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:03" (3/4) ... [2023-11-21 20:59:39,783 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 20:59:39,833 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 20:59:39,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 20:59:39,836 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 20:59:39,836 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 20:59:39,941 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 20:59:39,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 20:59:39,942 INFO L158 Benchmark]: Toolchain (without parser) took 38251.01ms. Allocated memory was 161.5MB in the beginning and 11.1GB in the end (delta: 10.9GB). Free memory was 125.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-21 20:59:39,942 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 20:59:39,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.38ms. Allocated memory is still 161.5MB. Free memory was 125.2MB in the beginning and 101.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 20:59:39,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.95ms. Allocated memory is still 161.5MB. Free memory was 101.6MB in the beginning and 98.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 20:59:39,943 INFO L158 Benchmark]: Boogie Preprocessor took 86.78ms. Allocated memory is still 161.5MB. Free memory was 98.6MB in the beginning and 95.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 20:59:39,944 INFO L158 Benchmark]: RCFGBuilder took 1088.19ms. Allocated memory is still 161.5MB. Free memory was 95.3MB in the beginning and 92.3MB in the end (delta: 3.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 20:59:39,944 INFO L158 Benchmark]: TraceAbstraction took 36002.61ms. Allocated memory was 161.5MB in the beginning and 11.1GB in the end (delta: 10.9GB). Free memory was 91.2MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-21 20:59:39,945 INFO L158 Benchmark]: Witness Printer took 160.18ms. Allocated memory is still 11.1GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 20:59:39,950 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.38ms. Allocated memory is still 161.5MB. Free memory was 125.2MB in the beginning and 101.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.95ms. Allocated memory is still 161.5MB. Free memory was 101.6MB in the beginning and 98.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.78ms. Allocated memory is still 161.5MB. Free memory was 98.6MB in the beginning and 95.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1088.19ms. Allocated memory is still 161.5MB. Free memory was 95.3MB in the beginning and 92.3MB in the end (delta: 3.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 36002.61ms. Allocated memory was 161.5MB in the beginning and 11.1GB in the end (delta: 10.9GB). Free memory was 91.2MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 160.18ms. Allocated memory is still 11.1GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 868 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 775 mSDsluCounter, 605 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2064 IncrementalHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 98 mSDtfsCounter, 2064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=9, InterpolantAutomatonStates: 75, 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.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 2593 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! [2023-11-21 20:59:40,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fddf2d6-1e22-492e-8b63-b92e94c80c32/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE