./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:43:55,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:43:55,595 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:43:55,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:43:55,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:43:55,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:43:55,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:43:55,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:43:55,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:43:55,627 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:43:55,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:43:55,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:43:55,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:43:55,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:43:55,629 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:43:55,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:43:55,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:43:55,631 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:43:55,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:43:55,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:43:55,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:43:55,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:43:55,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:43:55,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:43:55,635 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:43:55,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:43:55,635 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:43:55,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:43:55,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:43:55,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:43:55,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:43:55,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:43:55,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:43:55,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:43:55,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:43:55,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:43:55,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:43:55,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:43:55,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:43:55,639 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:43:55,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:43:55,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:43:55,640 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_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/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_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2023-11-29 06:43:55,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:43:55,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:43:55,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:43:55,878 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:43:55,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:43:55,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 06:43:58,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:43:58,765 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:43:58,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 06:43:58,781 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/data/9b2f633af/21482aeec7aa4ab790178a30b0b95fd4/FLAG6ae829518 [2023-11-29 06:43:58,795 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/data/9b2f633af/21482aeec7aa4ab790178a30b0b95fd4 [2023-11-29 06:43:58,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:43:58,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:43:58,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:43:58,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:43:58,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:43:58,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:58" (1/1) ... [2023-11-29 06:43:58,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22aad045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:58, skipping insertion in model container [2023-11-29 06:43:58,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:58" (1/1) ... [2023-11-29 06:43:58,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:43:59,014 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_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-29 06:43:59,195 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:43:59,206 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:43:59,217 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_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-29 06:43:59,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:43:59,302 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:43:59,302 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:43:59,310 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:43:59,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59 WrapperNode [2023-11-29 06:43:59,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:43:59,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:43:59,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:43:59,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:43:59,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,368 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-29 06:43:59,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:43:59,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:43:59,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:43:59,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:43:59,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,400 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 06:43:59,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:43:59,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:43:59,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:43:59,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:43:59,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (1/1) ... [2023-11-29 06:43:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:43:59,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:59,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:43:59,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:43:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:43:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:43:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:43:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:43:59,497 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:43:59,626 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:43:59,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:43:59,949 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:44:00,190 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:44:00,190 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:44:00,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:44:00 BoogieIcfgContainer [2023-11-29 06:44:00,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:44:00,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:44:00,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:44:00,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:44:00,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:43:58" (1/3) ... [2023-11-29 06:44:00,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ead1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:44:00, skipping insertion in model container [2023-11-29 06:44:00,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:59" (2/3) ... [2023-11-29 06:44:00,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ead1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:44:00, skipping insertion in model container [2023-11-29 06:44:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:44:00" (3/3) ... [2023-11-29 06:44:00,198 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 06:44:00,205 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 06:44:00,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:44:00,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 06:44:00,214 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:44:00,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:44:00,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-29 06:44:00,302 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-29 06:44:00,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:44:00,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-29 06:44:00,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-29 06:44:00,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-29 06:44:00,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:44:00,322 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;@573c4106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:44:00,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 06:44:00,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:44:00,326 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 06:44:00,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:44:00,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:00,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 06:44:00,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:00,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 13232445, now seen corresponding path program 1 times [2023-11-29 06:44:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981800139] [2023-11-29 06:44:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:00,668 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-29 06:44:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981800139] [2023-11-29 06:44:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981800139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:44:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330080232] [2023-11-29 06:44:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:00,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:44:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:44:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:44:00,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2023-11-29 06:44:00,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-29 06:44:00,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:00,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2023-11-29 06:44:00,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:01,211 INFO L124 PetriNetUnfolderBase]: 912/1625 cut-off events. [2023-11-29 06:44:01,211 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 06:44:01,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 1625 events. 912/1625 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9835 event pairs, 292 based on Foata normal form. 60/1660 useless extension candidates. Maximal degree in co-relation 3018. Up to 1108 conditions per place. [2023-11-29 06:44:01,231 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-29 06:44:01,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 189 flow [2023-11-29 06:44:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:44:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:44:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-29 06:44:01,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2023-11-29 06:44:01,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-29 06:44:01,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-29 06:44:01,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:01,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-29 06:44:01,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-29 06:44:01,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-29 06:44:01,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-29 06:44:01,257 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2023-11-29 06:44:01,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 189 flow [2023-11-29 06:44:01,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:44:01,263 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-29 06:44:01,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-29 06:44:01,269 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 06:44:01,269 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-29 06:44:01,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-29 06:44:01,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:01,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:44:01,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:01,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 754446492, now seen corresponding path program 1 times [2023-11-29 06:44:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:01,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440633745] [2023-11-29 06:44:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,500 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-29 06:44:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440633745] [2023-11-29 06:44:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440633745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:02,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:02,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:44:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763337317] [2023-11-29 06:44:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:02,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:44:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:44:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:44:02,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:02,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-29 06:44:02,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:02,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:02,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:03,234 INFO L124 PetriNetUnfolderBase]: 1775/2823 cut-off events. [2023-11-29 06:44:03,234 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2023-11-29 06:44:03,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5715 conditions, 2823 events. 1775/2823 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16676 event pairs, 279 based on Foata normal form. 0/2733 useless extension candidates. Maximal degree in co-relation 5705. Up to 1457 conditions per place. [2023-11-29 06:44:03,248 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 29 selfloop transitions, 2 changer transitions 47/88 dead transitions. [2023-11-29 06:44:03,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 354 flow [2023-11-29 06:44:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:44:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:44:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2023-11-29 06:44:03,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2023-11-29 06:44:03,251 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 184 transitions. [2023-11-29 06:44:03,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 184 transitions. [2023-11-29 06:44:03,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:03,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 184 transitions. [2023-11-29 06:44:03,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 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-29 06:44:03,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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-29 06:44:03,256 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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-29 06:44:03,256 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 184 transitions. [2023-11-29 06:44:03,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 354 flow [2023-11-29 06:44:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:44:03,260 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2023-11-29 06:44:03,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2023-11-29 06:44:03,261 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-29 06:44:03,261 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2023-11-29 06:44:03,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-29 06:44:03,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:03,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:03,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:44:03,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:03,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash 407120253, now seen corresponding path program 1 times [2023-11-29 06:44:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325670105] [2023-11-29 06:44:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:04,013 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-29 06:44:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325670105] [2023-11-29 06:44:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325670105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:44:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786302423] [2023-11-29 06:44:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:04,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:44:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:44:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:44:04,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:04,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-29 06:44:04,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:04,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:04,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:04,675 INFO L124 PetriNetUnfolderBase]: 1263/2219 cut-off events. [2023-11-29 06:44:04,675 INFO L125 PetriNetUnfolderBase]: For 536/536 co-relation queries the response was YES. [2023-11-29 06:44:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 2219 events. 1263/2219 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13609 event pairs, 213 based on Foata normal form. 64/2277 useless extension candidates. Maximal degree in co-relation 4663. Up to 1315 conditions per place. [2023-11-29 06:44:04,693 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 32 selfloop transitions, 2 changer transitions 33/77 dead transitions. [2023-11-29 06:44:04,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 325 flow [2023-11-29 06:44:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2023-11-29 06:44:04,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860805860805861 [2023-11-29 06:44:04,696 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 160 transitions. [2023-11-29 06:44:04,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 160 transitions. [2023-11-29 06:44:04,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:04,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 160 transitions. [2023-11-29 06:44:04,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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-29 06:44:04,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:04,699 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:04,699 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 7 states and 160 transitions. [2023-11-29 06:44:04,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 325 flow [2023-11-29 06:44:04,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 303 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 06:44:04,716 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2023-11-29 06:44:04,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-11-29 06:44:04,717 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-29 06:44:04,718 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2023-11-29 06:44:04,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-29 06:44:04,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:04,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:04,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:44:04,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:04,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 675965150, now seen corresponding path program 1 times [2023-11-29 06:44:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66538809] [2023-11-29 06:44:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:05,482 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-29 06:44:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66538809] [2023-11-29 06:44:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66538809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:05,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:05,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:44:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709809439] [2023-11-29 06:44:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:05,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:44:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:05,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:44:05,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:44:05,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:05,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-29 06:44:05,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:05,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:05,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:06,585 INFO L124 PetriNetUnfolderBase]: 1729/2837 cut-off events. [2023-11-29 06:44:06,586 INFO L125 PetriNetUnfolderBase]: For 902/902 co-relation queries the response was YES. [2023-11-29 06:44:06,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6301 conditions, 2837 events. 1729/2837 cut-off events. For 902/902 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16993 event pairs, 211 based on Foata normal form. 71/2903 useless extension candidates. Maximal degree in co-relation 6285. Up to 1301 conditions per place. [2023-11-29 06:44:06,602 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 50 selfloop transitions, 16 changer transitions 56/131 dead transitions. [2023-11-29 06:44:06,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 131 transitions, 587 flow [2023-11-29 06:44:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:44:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:44:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 282 transitions. [2023-11-29 06:44:06,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5562130177514792 [2023-11-29 06:44:06,605 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 282 transitions. [2023-11-29 06:44:06,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 282 transitions. [2023-11-29 06:44:06,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:06,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 282 transitions. [2023-11-29 06:44:06,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 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-29 06:44:06,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 39.0) internal successors, (546), 14 states have internal predecessors, (546), 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-29 06:44:06,609 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 39.0) internal successors, (546), 14 states have internal predecessors, (546), 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-29 06:44:06,610 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 13 states and 282 transitions. [2023-11-29 06:44:06,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 131 transitions, 587 flow [2023-11-29 06:44:06,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 131 transitions, 547 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-11-29 06:44:06,617 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 243 flow [2023-11-29 06:44:06,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=243, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-11-29 06:44:06,618 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-11-29 06:44:06,618 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 243 flow [2023-11-29 06:44:06,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-29 06:44:06,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:06,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:06,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:44:06,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:06,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2078636842, now seen corresponding path program 2 times [2023-11-29 06:44:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150797202] [2023-11-29 06:44:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:06,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:07,296 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-29 06:44:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150797202] [2023-11-29 06:44:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150797202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:07,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:44:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184113409] [2023-11-29 06:44:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:07,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:44:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:44:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:44:07,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:07,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-29 06:44:07,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:07,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:07,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:08,119 INFO L124 PetriNetUnfolderBase]: 1917/3189 cut-off events. [2023-11-29 06:44:08,119 INFO L125 PetriNetUnfolderBase]: For 10906/10908 co-relation queries the response was YES. [2023-11-29 06:44:08,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13065 conditions, 3189 events. 1917/3189 cut-off events. For 10906/10908 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19809 event pairs, 307 based on Foata normal form. 62/3241 useless extension candidates. Maximal degree in co-relation 13042. Up to 1220 conditions per place. [2023-11-29 06:44:08,147 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 3 changer transitions 48/105 dead transitions. [2023-11-29 06:44:08,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 864 flow [2023-11-29 06:44:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:44:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:44:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2023-11-29 06:44:08,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2023-11-29 06:44:08,149 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 180 transitions. [2023-11-29 06:44:08,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 180 transitions. [2023-11-29 06:44:08,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:08,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 180 transitions. [2023-11-29 06:44:08,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 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-29 06:44:08,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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-29 06:44:08,151 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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-29 06:44:08,151 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 243 flow. Second operand 8 states and 180 transitions. [2023-11-29 06:44:08,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 864 flow [2023-11-29 06:44:08,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 838 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 06:44:08,165 INFO L231 Difference]: Finished difference. Result has 64 places, 35 transitions, 193 flow [2023-11-29 06:44:08,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=64, PETRI_TRANSITIONS=35} [2023-11-29 06:44:08,166 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-11-29 06:44:08,167 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 35 transitions, 193 flow [2023-11-29 06:44:08,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-29 06:44:08,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:08,167 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-29 06:44:08,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:44:08,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:08,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1995944069, now seen corresponding path program 1 times [2023-11-29 06:44:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800863469] [2023-11-29 06:44:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:08,390 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-29 06:44:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800863469] [2023-11-29 06:44:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800863469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:44:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637988985] [2023-11-29 06:44:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:44:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:44:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:44:08,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 06:44:08,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 35 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-29 06:44:08,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:08,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 06:44:08,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:08,714 INFO L124 PetriNetUnfolderBase]: 688/1192 cut-off events. [2023-11-29 06:44:08,714 INFO L125 PetriNetUnfolderBase]: For 4139/4143 co-relation queries the response was YES. [2023-11-29 06:44:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 1192 events. 688/1192 cut-off events. For 4139/4143 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6719 event pairs, 205 based on Foata normal form. 36/1206 useless extension candidates. Maximal degree in co-relation 5079. Up to 610 conditions per place. [2023-11-29 06:44:08,727 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 30 selfloop transitions, 2 changer transitions 25/68 dead transitions. [2023-11-29 06:44:08,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 549 flow [2023-11-29 06:44:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-29 06:44:08,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2023-11-29 06:44:08,728 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-29 06:44:08,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-29 06:44:08,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:08,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-29 06:44:08,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-29 06:44:08,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:08,730 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:08,730 INFO L175 Difference]: Start difference. First operand has 64 places, 35 transitions, 193 flow. Second operand 7 states and 154 transitions. [2023-11-29 06:44:08,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 549 flow [2023-11-29 06:44:08,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 507 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-29 06:44:08,738 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 179 flow [2023-11-29 06:44:08,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2023-11-29 06:44:08,739 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-11-29 06:44:08,739 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 179 flow [2023-11-29 06:44:08,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-29 06:44:08,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:08,739 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] [2023-11-29 06:44:08,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:44:08,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:08,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -721397572, now seen corresponding path program 1 times [2023-11-29 06:44:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107904325] [2023-11-29 06:44:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:09,691 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-29 06:44:09,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107904325] [2023-11-29 06:44:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107904325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:09,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:09,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:44:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329837169] [2023-11-29 06:44:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:09,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:44:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:44:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:44:09,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:09,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:09,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:09,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:09,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:10,219 INFO L124 PetriNetUnfolderBase]: 1289/2135 cut-off events. [2023-11-29 06:44:10,220 INFO L125 PetriNetUnfolderBase]: For 6675/6675 co-relation queries the response was YES. [2023-11-29 06:44:10,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8747 conditions, 2135 events. 1289/2135 cut-off events. For 6675/6675 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12111 event pairs, 209 based on Foata normal form. 36/2160 useless extension candidates. Maximal degree in co-relation 8723. Up to 983 conditions per place. [2023-11-29 06:44:10,234 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 41 selfloop transitions, 8 changer transitions 23/82 dead transitions. [2023-11-29 06:44:10,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 600 flow [2023-11-29 06:44:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2023-11-29 06:44:10,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2023-11-29 06:44:10,236 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 164 transitions. [2023-11-29 06:44:10,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 164 transitions. [2023-11-29 06:44:10,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:10,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 164 transitions. [2023-11-29 06:44:10,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-29 06:44:10,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:10,239 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:10,239 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 179 flow. Second operand 7 states and 164 transitions. [2023-11-29 06:44:10,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 600 flow [2023-11-29 06:44:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 572 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-29 06:44:10,253 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 215 flow [2023-11-29 06:44:10,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-11-29 06:44:10,253 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2023-11-29 06:44:10,254 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 215 flow [2023-11-29 06:44:10,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:10,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:10,254 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] [2023-11-29 06:44:10,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:44:10,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:10,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 380736518, now seen corresponding path program 2 times [2023-11-29 06:44:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413899007] [2023-11-29 06:44:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:10,840 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-29 06:44:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413899007] [2023-11-29 06:44:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413899007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:10,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982092610] [2023-11-29 06:44:10,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:44:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:44:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:44:10,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:10,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-29 06:44:10,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:10,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:10,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:11,299 INFO L124 PetriNetUnfolderBase]: 976/1644 cut-off events. [2023-11-29 06:44:11,300 INFO L125 PetriNetUnfolderBase]: For 4820/4874 co-relation queries the response was YES. [2023-11-29 06:44:11,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7095 conditions, 1644 events. 976/1644 cut-off events. For 4820/4874 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8959 event pairs, 208 based on Foata normal form. 45/1681 useless extension candidates. Maximal degree in co-relation 7072. Up to 983 conditions per place. [2023-11-29 06:44:11,316 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 42 selfloop transitions, 9 changer transitions 20/81 dead transitions. [2023-11-29 06:44:11,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 611 flow [2023-11-29 06:44:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2023-11-29 06:44:11,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2023-11-29 06:44:11,317 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 161 transitions. [2023-11-29 06:44:11,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 161 transitions. [2023-11-29 06:44:11,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:11,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 161 transitions. [2023-11-29 06:44:11,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-29 06:44:11,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:11,319 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:11,320 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 215 flow. Second operand 7 states and 161 transitions. [2023-11-29 06:44:11,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 611 flow [2023-11-29 06:44:11,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 577 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-29 06:44:11,328 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 240 flow [2023-11-29 06:44:11,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-11-29 06:44:11,329 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2023-11-29 06:44:11,329 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 240 flow [2023-11-29 06:44:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-29 06:44:11,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:11,329 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] [2023-11-29 06:44:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:44:11,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:11,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2098636310, now seen corresponding path program 3 times [2023-11-29 06:44:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232976238] [2023-11-29 06:44:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:12,304 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-29 06:44:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232976238] [2023-11-29 06:44:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232976238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:12,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:12,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118147512] [2023-11-29 06:44:12,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:12,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:44:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:12,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:44:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:44:12,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:12,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-29 06:44:12,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:12,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:12,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:12,953 INFO L124 PetriNetUnfolderBase]: 1517/2519 cut-off events. [2023-11-29 06:44:12,953 INFO L125 PetriNetUnfolderBase]: For 8428/8428 co-relation queries the response was YES. [2023-11-29 06:44:12,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10861 conditions, 2519 events. 1517/2519 cut-off events. For 8428/8428 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14614 event pairs, 412 based on Foata normal form. 36/2554 useless extension candidates. Maximal degree in co-relation 10837. Up to 1145 conditions per place. [2023-11-29 06:44:12,965 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 44 selfloop transitions, 8 changer transitions 20/81 dead transitions. [2023-11-29 06:44:12,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 664 flow [2023-11-29 06:44:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2023-11-29 06:44:12,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567765567765568 [2023-11-29 06:44:12,967 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 152 transitions. [2023-11-29 06:44:12,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 152 transitions. [2023-11-29 06:44:12,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:12,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 152 transitions. [2023-11-29 06:44:12,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 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-29 06:44:12,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:12,968 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:12,968 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 240 flow. Second operand 7 states and 152 transitions. [2023-11-29 06:44:12,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 664 flow [2023-11-29 06:44:12,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 630 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 06:44:12,978 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 280 flow [2023-11-29 06:44:12,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2023-11-29 06:44:12,978 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-11-29 06:44:12,979 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 280 flow [2023-11-29 06:44:12,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-29 06:44:12,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:12,979 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] [2023-11-29 06:44:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:44:12,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:12,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1806732520, now seen corresponding path program 4 times [2023-11-29 06:44:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540523528] [2023-11-29 06:44:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:13,298 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-29 06:44:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540523528] [2023-11-29 06:44:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540523528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:13,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:13,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:44:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395237969] [2023-11-29 06:44:13,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:13,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:44:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:13,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:44:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:44:13,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:13,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-29 06:44:13,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:13,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:13,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:13,759 INFO L124 PetriNetUnfolderBase]: 1511/2550 cut-off events. [2023-11-29 06:44:13,759 INFO L125 PetriNetUnfolderBase]: For 9369/9529 co-relation queries the response was YES. [2023-11-29 06:44:13,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11537 conditions, 2550 events. 1511/2550 cut-off events. For 9369/9529 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15675 event pairs, 569 based on Foata normal form. 40/2561 useless extension candidates. Maximal degree in co-relation 11512. Up to 1181 conditions per place. [2023-11-29 06:44:13,773 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 40 selfloop transitions, 4 changer transitions 23/77 dead transitions. [2023-11-29 06:44:13,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 653 flow [2023-11-29 06:44:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:44:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:44:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2023-11-29 06:44:13,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2023-11-29 06:44:13,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 138 transitions. [2023-11-29 06:44:13,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 138 transitions. [2023-11-29 06:44:13,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:13,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 138 transitions. [2023-11-29 06:44:13,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-29 06:44:13,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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-29 06:44:13,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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-29 06:44:13,776 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 280 flow. Second operand 6 states and 138 transitions. [2023-11-29 06:44:13,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 653 flow [2023-11-29 06:44:13,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 638 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:13,787 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 239 flow [2023-11-29 06:44:13,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2023-11-29 06:44:13,788 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-11-29 06:44:13,788 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 239 flow [2023-11-29 06:44:13,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-29 06:44:13,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:13,788 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] [2023-11-29 06:44:13,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:44:13,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 151394768, now seen corresponding path program 5 times [2023-11-29 06:44:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265944667] [2023-11-29 06:44:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:14,773 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-29 06:44:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265944667] [2023-11-29 06:44:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265944667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:14,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:44:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630824042] [2023-11-29 06:44:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:44:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:44:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:44:14,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:14,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 239 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:14,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:14,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:14,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:15,375 INFO L124 PetriNetUnfolderBase]: 918/1562 cut-off events. [2023-11-29 06:44:15,375 INFO L125 PetriNetUnfolderBase]: For 6889/6919 co-relation queries the response was YES. [2023-11-29 06:44:15,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7337 conditions, 1562 events. 918/1562 cut-off events. For 6889/6919 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8380 event pairs, 114 based on Foata normal form. 55/1614 useless extension candidates. Maximal degree in co-relation 7311. Up to 912 conditions per place. [2023-11-29 06:44:15,384 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 43 selfloop transitions, 12 changer transitions 22/87 dead transitions. [2023-11-29 06:44:15,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 741 flow [2023-11-29 06:44:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:44:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:44:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2023-11-29 06:44:15,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5498575498575499 [2023-11-29 06:44:15,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 193 transitions. [2023-11-29 06:44:15,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 193 transitions. [2023-11-29 06:44:15,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:15,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 193 transitions. [2023-11-29 06:44:15,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.444444444444443) internal successors, (193), 9 states have internal predecessors, (193), 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-29 06:44:15,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 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-29 06:44:15,388 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 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-29 06:44:15,388 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 239 flow. Second operand 9 states and 193 transitions. [2023-11-29 06:44:15,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 741 flow [2023-11-29 06:44:15,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 672 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-11-29 06:44:15,397 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 316 flow [2023-11-29 06:44:15,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-11-29 06:44:15,398 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-11-29 06:44:15,398 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 316 flow [2023-11-29 06:44:15,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:15,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:15,398 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] [2023-11-29 06:44:15,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:44:15,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:15,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 233415228, now seen corresponding path program 6 times [2023-11-29 06:44:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325176966] [2023-11-29 06:44:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:15,810 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-29 06:44:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325176966] [2023-11-29 06:44:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325176966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043045912] [2023-11-29 06:44:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:44:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:44:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:44:15,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:15,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 316 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-29 06:44:15,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:15,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:15,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:16,264 INFO L124 PetriNetUnfolderBase]: 972/1687 cut-off events. [2023-11-29 06:44:16,265 INFO L125 PetriNetUnfolderBase]: For 7811/7911 co-relation queries the response was YES. [2023-11-29 06:44:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7982 conditions, 1687 events. 972/1687 cut-off events. For 7811/7911 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9536 event pairs, 157 based on Foata normal form. 41/1719 useless extension candidates. Maximal degree in co-relation 7956. Up to 1007 conditions per place. [2023-11-29 06:44:16,274 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 44 selfloop transitions, 8 changer transitions 21/83 dead transitions. [2023-11-29 06:44:16,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 756 flow [2023-11-29 06:44:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2023-11-29 06:44:16,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604395604395604 [2023-11-29 06:44:16,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 153 transitions. [2023-11-29 06:44:16,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 153 transitions. [2023-11-29 06:44:16,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:16,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 153 transitions. [2023-11-29 06:44:16,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-29 06:44:16,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:16,278 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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-29 06:44:16,278 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 316 flow. Second operand 7 states and 153 transitions. [2023-11-29 06:44:16,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 756 flow [2023-11-29 06:44:16,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 713 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-11-29 06:44:16,286 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 330 flow [2023-11-29 06:44:16,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-11-29 06:44:16,287 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-11-29 06:44:16,287 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 330 flow [2023-11-29 06:44:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-29 06:44:16,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:16,287 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] [2023-11-29 06:44:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:44:16,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:16,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -151609412, now seen corresponding path program 7 times [2023-11-29 06:44:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517438224] [2023-11-29 06:44:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:16,743 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-29 06:44:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517438224] [2023-11-29 06:44:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517438224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:44:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740346303] [2023-11-29 06:44:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:16,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:44:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:44:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:44:16,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:16,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 330 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:16,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:16,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:16,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:17,344 INFO L124 PetriNetUnfolderBase]: 985/1731 cut-off events. [2023-11-29 06:44:17,344 INFO L125 PetriNetUnfolderBase]: For 8591/8670 co-relation queries the response was YES. [2023-11-29 06:44:17,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8295 conditions, 1731 events. 985/1731 cut-off events. For 8591/8670 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9951 event pairs, 182 based on Foata normal form. 55/1783 useless extension candidates. Maximal degree in co-relation 8268. Up to 965 conditions per place. [2023-11-29 06:44:17,355 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 45 selfloop transitions, 15 changer transitions 32/102 dead transitions. [2023-11-29 06:44:17,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 957 flow [2023-11-29 06:44:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:44:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 06:44:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2023-11-29 06:44:17,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2023-11-29 06:44:17,357 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 214 transitions. [2023-11-29 06:44:17,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 214 transitions. [2023-11-29 06:44:17,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:17,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 214 transitions. [2023-11-29 06:44:17,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-29 06:44:17,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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-29 06:44:17,358 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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-29 06:44:17,359 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 330 flow. Second operand 10 states and 214 transitions. [2023-11-29 06:44:17,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 957 flow [2023-11-29 06:44:17,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 941 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:17,367 INFO L231 Difference]: Finished difference. Result has 78 places, 50 transitions, 443 flow [2023-11-29 06:44:17,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=443, PETRI_PLACES=78, PETRI_TRANSITIONS=50} [2023-11-29 06:44:17,368 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-11-29 06:44:17,368 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 50 transitions, 443 flow [2023-11-29 06:44:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-29 06:44:17,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:17,368 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] [2023-11-29 06:44:17,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:44:17,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:17,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash -485917046, now seen corresponding path program 1 times [2023-11-29 06:44:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220523065] [2023-11-29 06:44:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:18,679 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-29 06:44:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220523065] [2023-11-29 06:44:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220523065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:44:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605863355] [2023-11-29 06:44:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:18,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:44:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:44:18,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:44:18,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:18,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 50 transitions, 443 flow. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 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-29 06:44:18,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:18,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:18,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:20,372 INFO L124 PetriNetUnfolderBase]: 2495/4503 cut-off events. [2023-11-29 06:44:20,373 INFO L125 PetriNetUnfolderBase]: For 30553/30553 co-relation queries the response was YES. [2023-11-29 06:44:20,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22108 conditions, 4503 events. 2495/4503 cut-off events. For 30553/30553 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 33489 event pairs, 464 based on Foata normal form. 131/4602 useless extension candidates. Maximal degree in co-relation 22077. Up to 1559 conditions per place. [2023-11-29 06:44:20,395 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 86 selfloop transitions, 36 changer transitions 126/257 dead transitions. [2023-11-29 06:44:20,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 257 transitions, 2868 flow [2023-11-29 06:44:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 06:44:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 06:44:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 541 transitions. [2023-11-29 06:44:20,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335305719921104 [2023-11-29 06:44:20,398 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 541 transitions. [2023-11-29 06:44:20,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 541 transitions. [2023-11-29 06:44:20,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:20,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 541 transitions. [2023-11-29 06:44:20,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 20.807692307692307) internal successors, (541), 26 states have internal predecessors, (541), 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-29 06:44:20,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 39.0) internal successors, (1053), 27 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:20,403 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 39.0) internal successors, (1053), 27 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:20,403 INFO L175 Difference]: Start difference. First operand has 78 places, 50 transitions, 443 flow. Second operand 26 states and 541 transitions. [2023-11-29 06:44:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 257 transitions, 2868 flow [2023-11-29 06:44:20,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 2744 flow, removed 35 selfloop flow, removed 7 redundant places. [2023-11-29 06:44:20,432 INFO L231 Difference]: Finished difference. Result has 116 places, 69 transitions, 882 flow [2023-11-29 06:44:20,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=882, PETRI_PLACES=116, PETRI_TRANSITIONS=69} [2023-11-29 06:44:20,433 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places. [2023-11-29 06:44:20,433 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 69 transitions, 882 flow [2023-11-29 06:44:20,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 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-29 06:44:20,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:20,434 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] [2023-11-29 06:44:20,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:44:20,434 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:20,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1542158696, now seen corresponding path program 2 times [2023-11-29 06:44:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:20,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808365192] [2023-11-29 06:44:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:20,905 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-29 06:44:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808365192] [2023-11-29 06:44:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808365192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:20,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414885982] [2023-11-29 06:44:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:20,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:44:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:44:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:44:20,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:20,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 69 transitions, 882 flow. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 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-29 06:44:20,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:20,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:20,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:21,687 INFO L124 PetriNetUnfolderBase]: 1579/3017 cut-off events. [2023-11-29 06:44:21,687 INFO L125 PetriNetUnfolderBase]: For 48293/48346 co-relation queries the response was YES. [2023-11-29 06:44:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19102 conditions, 3017 events. 1579/3017 cut-off events. For 48293/48346 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 21836 event pairs, 766 based on Foata normal form. 59/3073 useless extension candidates. Maximal degree in co-relation 19050. Up to 1977 conditions per place. [2023-11-29 06:44:21,739 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 55 selfloop transitions, 33 changer transitions 46/146 dead transitions. [2023-11-29 06:44:21,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 146 transitions, 2245 flow [2023-11-29 06:44:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:44:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 06:44:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2023-11-29 06:44:21,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2023-11-29 06:44:21,741 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 215 transitions. [2023-11-29 06:44:21,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 215 transitions. [2023-11-29 06:44:21,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:21,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 215 transitions. [2023-11-29 06:44:21,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 21.5) internal successors, (215), 10 states have internal predecessors, (215), 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-29 06:44:21,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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-29 06:44:21,744 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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-29 06:44:21,744 INFO L175 Difference]: Start difference. First operand has 116 places, 69 transitions, 882 flow. Second operand 10 states and 215 transitions. [2023-11-29 06:44:21,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 146 transitions, 2245 flow [2023-11-29 06:44:21,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 146 transitions, 1999 flow, removed 120 selfloop flow, removed 20 redundant places. [2023-11-29 06:44:21,874 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 1220 flow [2023-11-29 06:44:21,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1220, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-11-29 06:44:21,874 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2023-11-29 06:44:21,875 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 1220 flow [2023-11-29 06:44:21,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 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-29 06:44:21,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:21,875 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] [2023-11-29 06:44:21,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:44:21,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:21,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1934636689, now seen corresponding path program 1 times [2023-11-29 06:44:21,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188481539] [2023-11-29 06:44:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:23,054 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-29 06:44:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188481539] [2023-11-29 06:44:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188481539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:23,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:23,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:44:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350601041] [2023-11-29 06:44:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:23,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:44:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:23,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:44:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:44:23,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:23,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 1220 flow. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 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-29 06:44:23,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:23,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:23,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:24,001 INFO L124 PetriNetUnfolderBase]: 1421/2687 cut-off events. [2023-11-29 06:44:24,001 INFO L125 PetriNetUnfolderBase]: For 32154/32212 co-relation queries the response was YES. [2023-11-29 06:44:24,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16014 conditions, 2687 events. 1421/2687 cut-off events. For 32154/32212 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18855 event pairs, 407 based on Foata normal form. 45/2722 useless extension candidates. Maximal degree in co-relation 15974. Up to 1500 conditions per place. [2023-11-29 06:44:24,020 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 74 selfloop transitions, 42 changer transitions 35/163 dead transitions. [2023-11-29 06:44:24,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 163 transitions, 2528 flow [2023-11-29 06:44:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:44:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 06:44:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2023-11-29 06:44:24,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2023-11-29 06:44:24,022 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 284 transitions. [2023-11-29 06:44:24,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 284 transitions. [2023-11-29 06:44:24,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:24,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 284 transitions. [2023-11-29 06:44:24,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 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-29 06:44:24,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 39.0) internal successors, (585), 15 states have internal predecessors, (585), 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-29 06:44:24,024 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 39.0) internal successors, (585), 15 states have internal predecessors, (585), 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-29 06:44:24,024 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 1220 flow. Second operand 14 states and 284 transitions. [2023-11-29 06:44:24,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 163 transitions, 2528 flow [2023-11-29 06:44:24,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 163 transitions, 2321 flow, removed 101 selfloop flow, removed 6 redundant places. [2023-11-29 06:44:24,105 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 1563 flow [2023-11-29 06:44:24,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1563, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2023-11-29 06:44:24,106 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2023-11-29 06:44:24,106 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 1563 flow [2023-11-29 06:44:24,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 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-29 06:44:24,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:24,106 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] [2023-11-29 06:44:24,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:44:24,106 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1798398823, now seen corresponding path program 1 times [2023-11-29 06:44:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183468191] [2023-11-29 06:44:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:24,261 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-29 06:44:24,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183468191] [2023-11-29 06:44:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183468191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:44:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627722746] [2023-11-29 06:44:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:24,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:44:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:44:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:44:24,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:24,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 1563 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-29 06:44:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:24,969 INFO L124 PetriNetUnfolderBase]: 3103/4983 cut-off events. [2023-11-29 06:44:24,969 INFO L125 PetriNetUnfolderBase]: For 74703/74874 co-relation queries the response was YES. [2023-11-29 06:44:24,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26877 conditions, 4983 events. 3103/4983 cut-off events. For 74703/74874 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28855 event pairs, 362 based on Foata normal form. 365/5332 useless extension candidates. Maximal degree in co-relation 26832. Up to 2731 conditions per place. [2023-11-29 06:44:25,003 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 101 selfloop transitions, 5 changer transitions 1/117 dead transitions. [2023-11-29 06:44:25,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 2210 flow [2023-11-29 06:44:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:44:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:44:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2023-11-29 06:44:25,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2023-11-29 06:44:25,004 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 99 transitions. [2023-11-29 06:44:25,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 99 transitions. [2023-11-29 06:44:25,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:25,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 99 transitions. [2023-11-29 06:44:25,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-29 06:44:25,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-29 06:44:25,005 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-29 06:44:25,005 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 1563 flow. Second operand 4 states and 99 transitions. [2023-11-29 06:44:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 2210 flow [2023-11-29 06:44:25,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 1575 flow, removed 241 selfloop flow, removed 24 redundant places. [2023-11-29 06:44:25,047 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 633 flow [2023-11-29 06:44:25,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=633, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-11-29 06:44:25,047 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-29 06:44:25,047 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 633 flow [2023-11-29 06:44:25,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-29 06:44:25,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:25,048 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] [2023-11-29 06:44:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:44:25,048 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:25,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2146177766, now seen corresponding path program 1 times [2023-11-29 06:44:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:25,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469760782] [2023-11-29 06:44:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:25,176 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-29 06:44:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469760782] [2023-11-29 06:44:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469760782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:44:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740034775] [2023-11-29 06:44:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:44:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:44:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:44:25,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:25,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-29 06:44:25,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:25,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:25,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:25,740 INFO L124 PetriNetUnfolderBase]: 2189/3597 cut-off events. [2023-11-29 06:44:25,741 INFO L125 PetriNetUnfolderBase]: For 23584/23682 co-relation queries the response was YES. [2023-11-29 06:44:25,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15669 conditions, 3597 events. 2189/3597 cut-off events. For 23584/23682 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19847 event pairs, 125 based on Foata normal form. 278/3859 useless extension candidates. Maximal degree in co-relation 15639. Up to 1457 conditions per place. [2023-11-29 06:44:25,760 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 106 selfloop transitions, 8 changer transitions 1/125 dead transitions. [2023-11-29 06:44:25,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 1654 flow [2023-11-29 06:44:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:44:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:44:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2023-11-29 06:44:25,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2023-11-29 06:44:25,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 125 transitions. [2023-11-29 06:44:25,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 125 transitions. [2023-11-29 06:44:25,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:25,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 125 transitions. [2023-11-29 06:44:25,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-29 06:44:25,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-29 06:44:25,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-29 06:44:25,762 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 633 flow. Second operand 5 states and 125 transitions. [2023-11-29 06:44:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 1654 flow [2023-11-29 06:44:25,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1568 flow, removed 39 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:25,775 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 616 flow [2023-11-29 06:44:25,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-11-29 06:44:25,775 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-29 06:44:25,775 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 616 flow [2023-11-29 06:44:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-29 06:44:25,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:25,775 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] [2023-11-29 06:44:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:44:25,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:25,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 655480347, now seen corresponding path program 1 times [2023-11-29 06:44:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337205367] [2023-11-29 06:44:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:25,932 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-29 06:44:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337205367] [2023-11-29 06:44:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337205367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:25,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:44:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703506230] [2023-11-29 06:44:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:25,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:44:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:44:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:44:25,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 06:44:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-29 06:44:25,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:25,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 06:44:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:26,310 INFO L124 PetriNetUnfolderBase]: 1276/2102 cut-off events. [2023-11-29 06:44:26,311 INFO L125 PetriNetUnfolderBase]: For 13135/13191 co-relation queries the response was YES. [2023-11-29 06:44:26,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9102 conditions, 2102 events. 1276/2102 cut-off events. For 13135/13191 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10137 event pairs, 88 based on Foata normal form. 156/2242 useless extension candidates. Maximal degree in co-relation 9072. Up to 820 conditions per place. [2023-11-29 06:44:26,321 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 91 selfloop transitions, 11 changer transitions 1/113 dead transitions. [2023-11-29 06:44:26,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 113 transitions, 1377 flow [2023-11-29 06:44:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:44:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:44:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2023-11-29 06:44:26,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683760683760684 [2023-11-29 06:44:26,322 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 133 transitions. [2023-11-29 06:44:26,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 133 transitions. [2023-11-29 06:44:26,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:26,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 133 transitions. [2023-11-29 06:44:26,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-29 06:44:26,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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-29 06:44:26,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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-29 06:44:26,324 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 616 flow. Second operand 6 states and 133 transitions. [2023-11-29 06:44:26,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 113 transitions, 1377 flow [2023-11-29 06:44:26,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 1246 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-11-29 06:44:26,335 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 556 flow [2023-11-29 06:44:26,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=556, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-11-29 06:44:26,336 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-11-29 06:44:26,336 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 556 flow [2023-11-29 06:44:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-29 06:44:26,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:26,336 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] [2023-11-29 06:44:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:44:26,336 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:26,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1467283948, now seen corresponding path program 1 times [2023-11-29 06:44:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956527756] [2023-11-29 06:44:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:27,967 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-29 06:44:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956527756] [2023-11-29 06:44:27,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956527756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:27,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:27,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 06:44:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777829584] [2023-11-29 06:44:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:27,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:44:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:44:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:44:27,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 06:44:27,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 556 flow. Second operand has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 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-29 06:44:27,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:27,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 06:44:27,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:28,647 INFO L124 PetriNetUnfolderBase]: 739/1419 cut-off events. [2023-11-29 06:44:28,647 INFO L125 PetriNetUnfolderBase]: For 4216/4238 co-relation queries the response was YES. [2023-11-29 06:44:28,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5113 conditions, 1419 events. 739/1419 cut-off events. For 4216/4238 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7667 event pairs, 248 based on Foata normal form. 16/1389 useless extension candidates. Maximal degree in co-relation 5083. Up to 517 conditions per place. [2023-11-29 06:44:28,654 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 32 selfloop transitions, 7 changer transitions 52/107 dead transitions. [2023-11-29 06:44:28,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 107 transitions, 902 flow [2023-11-29 06:44:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:44:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 06:44:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2023-11-29 06:44:28,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104895104895105 [2023-11-29 06:44:28,656 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 219 transitions. [2023-11-29 06:44:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 219 transitions. [2023-11-29 06:44:28,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:28,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 219 transitions. [2023-11-29 06:44:28,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 11 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-29 06:44:28,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 39.0) internal successors, (468), 12 states have internal predecessors, (468), 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-29 06:44:28,657 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 39.0) internal successors, (468), 12 states have internal predecessors, (468), 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-29 06:44:28,657 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 556 flow. Second operand 11 states and 219 transitions. [2023-11-29 06:44:28,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 107 transitions, 902 flow [2023-11-29 06:44:28,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 726 flow, removed 70 selfloop flow, removed 11 redundant places. [2023-11-29 06:44:28,678 INFO L231 Difference]: Finished difference. Result has 83 places, 47 transitions, 290 flow [2023-11-29 06:44:28,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=83, PETRI_TRANSITIONS=47} [2023-11-29 06:44:28,679 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2023-11-29 06:44:28,679 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 47 transitions, 290 flow [2023-11-29 06:44:28,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 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-29 06:44:28,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:28,679 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] [2023-11-29 06:44:28,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 06:44:28,679 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 06:44:28,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1411525126, now seen corresponding path program 2 times [2023-11-29 06:44:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227596533] [2023-11-29 06:44:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:44:28,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:44:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:44:28,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:44:28,815 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:44:28,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 06:44:28,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 06:44:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 06:44:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 06:44:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 06:44:28,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 06:44:28,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:44:28,818 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:28,824 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:44:28,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:44:28,869 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:44:28,871 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:44:28,872 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 06:44:28,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:44:28 BasicIcfg [2023-11-29 06:44:28,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:44:28,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:44:28,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:44:28,898 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:44:28,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:44:00" (3/4) ... [2023-11-29 06:44:28,898 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 06:44:28,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:44:28,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:44:28,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 06:44:28,979 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:44:28,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:44:28,980 INFO L158 Benchmark]: Toolchain (without parser) took 30180.86ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 141.0MB in the beginning and 468.7MB in the end (delta: -327.6MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,980 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:44:28,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.31ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 124.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 122.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,981 INFO L158 Benchmark]: Boogie Preprocessor took 52.12ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 117.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,982 INFO L158 Benchmark]: RCFGBuilder took 768.81ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 119.5MB in the end (delta: -1.7MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,982 INFO L158 Benchmark]: TraceAbstraction took 28704.41ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 118.5MB in the beginning and 481.2MB in the end (delta: -362.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,983 INFO L158 Benchmark]: Witness Printer took 81.75ms. Allocated memory is still 616.6MB. Free memory was 481.2MB in the beginning and 468.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:44:28,984 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.14ms. Allocated memory is still 121.6MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.31ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 124.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 122.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.12ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 117.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 768.81ms. Allocated memory is still 176.2MB. Free memory was 117.8MB in the beginning and 119.5MB in the end (delta: -1.7MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28704.41ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 118.5MB in the beginning and 481.2MB in the end (delta: -362.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 81.75ms. Allocated memory is still 616.6MB. Free memory was 481.2MB in the beginning and 468.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 851]: 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: 849]: 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: 847]: 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 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1423 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1383 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3861 IncrementalHoareTripleChecker+Invalid, 4117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 78 mSDtfsCounter, 3861 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1563occurred in iteration=16, InterpolantAutomatonStates: 175, 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.4s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 5039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-29 06:44:29,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9fce84-e190-4bb8-b1f6-1b4f100140a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE