./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme --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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:46:35,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:46:35,714 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:46:35,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:46:35,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:46:35,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:46:35,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:46:35,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:46:35,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:46:35,747 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:46:35,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:46:35,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:46:35,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:46:35,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:46:35,750 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:46:35,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:46:35,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:46:35,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:46:35,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:46:35,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:46:35,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:46:35,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:46:35,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:46:35,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:46:35,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:46:35,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:46:35,758 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:46:35,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:46:35,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:46:35,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:46:35,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:46:35,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:35,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:46:35,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:46:35,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:46:35,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:46:35,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:46:35,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:46:35,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:46:35,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:46:35,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:46:35,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:46:35,766 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_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/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_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2023-11-26 10:46:36,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:46:36,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:46:36,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:46:36,052 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:46:36,052 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:46:36,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 10:46:39,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:46:39,708 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:46:39,708 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 10:46:39,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/data/8ae9f256c/1df883df40d84189b405d5a00c8da039/FLAGee52863fd [2023-11-26 10:46:39,744 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/data/8ae9f256c/1df883df40d84189b405d5a00c8da039 [2023-11-26 10:46:39,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:46:39,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:46:39,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:39,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:46:39,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:46:39,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:39" (1/1) ... [2023-11-26 10:46:39,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28479975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:39, skipping insertion in model container [2023-11-26 10:46:39,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:39" (1/1) ... [2023-11-26 10:46:39,812 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:46:40,013 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_089a9ac7-44f9-4fcb-afb1-2e079befaedc/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-26 10:46:40,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:40,335 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:46:40,349 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_089a9ac7-44f9-4fcb-afb1-2e079befaedc/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-26 10:46:40,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:40,529 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:40,530 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:40,538 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:46:40,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40 WrapperNode [2023-11-26 10:46:40,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:40,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:40,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:46:40,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:46:40,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,636 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-26 10:46:40,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:40,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:46:40,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:46:40,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:46:40,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,694 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-26 10:46:40,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:46:40,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:46:40,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:46:40,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:46:40,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (1/1) ... [2023-11-26 10:46:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:40,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:46:40,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:46:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:46:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:46:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:46:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:46:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:46:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:46:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:46:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:46:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:46:40,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:46:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:46:40,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:46:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 10:46:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 10:46:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:46:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:46:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:46:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:46:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:46:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:46:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:46:40,833 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:46:40,988 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:46:40,990 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:46:41,367 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:46:41,590 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:46:41,590 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:46:41,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:41 BoogieIcfgContainer [2023-11-26 10:46:41,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:46:41,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:46:41,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:46:41,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:46:41,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:39" (1/3) ... [2023-11-26 10:46:41,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4100bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:41, skipping insertion in model container [2023-11-26 10:46:41,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:40" (2/3) ... [2023-11-26 10:46:41,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4100bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:41, skipping insertion in model container [2023-11-26 10:46:41,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:41" (3/3) ... [2023-11-26 10:46:41,601 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 10:46:41,610 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:46:41,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:46:41,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 10:46:41,618 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:46:41,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:46:41,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 10:46:41,755 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-26 10:46:41,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:41,763 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-26 10:46:41,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 10:46:41,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-26 10:46:41,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:41,797 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;@91bcbba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:41,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 10:46:41,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:41,801 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-26 10:46:41,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:41,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:41,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-26 10:46:41,803 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-26 10:46:41,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash 11196793, now seen corresponding path program 1 times [2023-11-26 10:46:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:41,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618496863] [2023-11-26 10:46:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:42,337 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-26 10:46:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618496863] [2023-11-26 10:46:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618496863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795356344] [2023-11-26 10:46:42,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:42,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:42,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2023-11-26 10:46:42,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-26 10:46:42,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:42,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2023-11-26 10:46:42,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:42,946 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2023-11-26 10:46:42,946 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-26 10:46:42,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5492 event pairs, 284 based on Foata normal form. 36/994 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2023-11-26 10:46:42,966 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-26 10:46:42,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2023-11-26 10:46:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 10:46:42,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2023-11-26 10:46:42,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 10:46:42,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 10:46:42,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:42,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 10:46:42,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 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-26 10:46:42,997 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-26 10:46:42,998 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-26 10:46:43,000 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2023-11-26 10:46:43,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2023-11-26 10:46:43,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:46:43,009 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-26 10:46:43,012 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-26 10:46:43,019 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-26 10:46:43,019 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-26 10:46:43,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-26 10:46:43,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:43,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:46:43,021 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-26 10:46:43,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash 3165626, now seen corresponding path program 1 times [2023-11-26 10:46:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:43,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009168] [2023-11-26 10:46:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:43,900 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-26 10:46:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009168] [2023-11-26 10:46:43,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:43,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:43,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:43,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615461191] [2023-11-26 10:46:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:43,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:43,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:43,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:46:43,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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-26 10:46:43,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:43,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:46:43,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:44,673 INFO L124 PetriNetUnfolderBase]: 1367/2367 cut-off events. [2023-11-26 10:46:44,674 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-26 10:46:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 2367 events. 1367/2367 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14662 event pairs, 231 based on Foata normal form. 0/2304 useless extension candidates. Maximal degree in co-relation 4621. Up to 1081 conditions per place. [2023-11-26 10:46:44,722 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 28 selfloop transitions, 2 changer transitions 44/85 dead transitions. [2023-11-26 10:46:44,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 340 flow [2023-11-26 10:46:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2023-11-26 10:46:44,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2023-11-26 10:46:44,728 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 188 transitions. [2023-11-26 10:46:44,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 188 transitions. [2023-11-26 10:46:44,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:44,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 188 transitions. [2023-11-26 10:46:44,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.5) internal successors, (188), 8 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-26 10:46:44,734 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-26 10:46:44,735 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-26 10:46:44,735 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 188 transitions. [2023-11-26 10:46:44,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 340 flow [2023-11-26 10:46:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:44,742 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2023-11-26 10:46:44,742 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-26 10:46:44,748 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-26 10:46:44,748 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2023-11-26 10:46:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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-26 10:46:44,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:44,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:46:44,750 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-26 10:46:44,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash -189129701, now seen corresponding path program 1 times [2023-11-26 10:46:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751848778] [2023-11-26 10:46:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:45,349 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-26 10:46:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751848778] [2023-11-26 10:46:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751848778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604339538] [2023-11-26 10:46:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:45,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:45,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 10:46:45,387 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-26 10:46:45,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:45,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 10:46:45,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:46,681 INFO L124 PetriNetUnfolderBase]: 1502/2474 cut-off events. [2023-11-26 10:46:46,681 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-11-26 10:46:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 2474 events. 1502/2474 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14678 event pairs, 186 based on Foata normal form. 71/2535 useless extension candidates. Maximal degree in co-relation 5370. Up to 1104 conditions per place. [2023-11-26 10:46:46,701 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 44 selfloop transitions, 14 changer transitions 56/124 dead transitions. [2023-11-26 10:46:46,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 540 flow [2023-11-26 10:46:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:46:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-26 10:46:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 287 transitions. [2023-11-26 10:46:46,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660749506903353 [2023-11-26 10:46:46,710 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 287 transitions. [2023-11-26 10:46:46,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 287 transitions. [2023-11-26 10:46:46,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:46,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 287 transitions. [2023-11-26 10:46:46,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 0 states have call successors, (0), 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-26 10:46:46,720 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-26 10:46:46,721 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-26 10:46:46,721 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 13 states and 287 transitions. [2023-11-26 10:46:46,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 540 flow [2023-11-26 10:46:46,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 124 transitions, 500 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-11-26 10:46:46,742 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 222 flow [2023-11-26 10:46:46,743 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-11-26 10:46:46,744 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-26 10:46:46,744 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 222 flow [2023-11-26 10:46:46,748 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-26 10:46:46,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:46,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:46,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:46:46,749 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-26 10:46:46,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1907327387, now seen corresponding path program 2 times [2023-11-26 10:46:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38402435] [2023-11-26 10:46:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:47,253 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-26 10:46:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38402435] [2023-11-26 10:46:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38402435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:47,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:47,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:46:47,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652827554] [2023-11-26 10:46:47,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:47,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:46:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:46:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:46:47,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 10:46:47,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 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-26 10:46:47,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:47,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 10:46:47,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:48,113 INFO L124 PetriNetUnfolderBase]: 1591/2661 cut-off events. [2023-11-26 10:46:48,113 INFO L125 PetriNetUnfolderBase]: For 10899/10899 co-relation queries the response was YES. [2023-11-26 10:46:48,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10989 conditions, 2661 events. 1591/2661 cut-off events. For 10899/10899 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16270 event pairs, 257 based on Foata normal form. 60/2704 useless extension candidates. Maximal degree in co-relation 10967. Up to 996 conditions per place. [2023-11-26 10:46:48,138 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 3 changer transitions 46/97 dead transitions. [2023-11-26 10:46:48,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 795 flow [2023-11-26 10:46:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2023-11-26 10:46:48,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5801282051282052 [2023-11-26 10:46:48,140 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 181 transitions. [2023-11-26 10:46:48,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 181 transitions. [2023-11-26 10:46:48,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:48,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 181 transitions. [2023-11-26 10:46:48,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 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-26 10:46:48,142 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-26 10:46:48,143 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-26 10:46:48,143 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 222 flow. Second operand 8 states and 181 transitions. [2023-11-26 10:46:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 795 flow [2023-11-26 10:46:48,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 770 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-26 10:46:48,165 INFO L231 Difference]: Finished difference. Result has 63 places, 35 transitions, 184 flow [2023-11-26 10:46:48,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=63, PETRI_TRANSITIONS=35} [2023-11-26 10:46:48,167 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-26 10:46:48,168 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 35 transitions, 184 flow [2023-11-26 10:46:48,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 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-26 10:46:48,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:48,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:48,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:46:48,169 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-26 10:46:48,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash -288622003, now seen corresponding path program 1 times [2023-11-26 10:46:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213775969] [2023-11-26 10:46:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:48,660 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-26 10:46:48,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:48,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213775969] [2023-11-26 10:46:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213775969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:48,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:48,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:46:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275365662] [2023-11-26 10:46:48,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:48,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:46:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:46:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:46:48,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 10:46:48,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 35 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 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-26 10:46:48,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:48,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 10:46:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:49,375 INFO L124 PetriNetUnfolderBase]: 1216/2110 cut-off events. [2023-11-26 10:46:49,375 INFO L125 PetriNetUnfolderBase]: For 8406/8406 co-relation queries the response was YES. [2023-11-26 10:46:49,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8485 conditions, 2110 events. 1216/2110 cut-off events. For 8406/8406 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12750 event pairs, 317 based on Foata normal form. 45/2136 useless extension candidates. Maximal degree in co-relation 8460. Up to 761 conditions per place. [2023-11-26 10:46:49,394 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 35 selfloop transitions, 3 changer transitions 40/88 dead transitions. [2023-11-26 10:46:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 682 flow [2023-11-26 10:46:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2023-11-26 10:46:49,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5801282051282052 [2023-11-26 10:46:49,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 181 transitions. [2023-11-26 10:46:49,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 181 transitions. [2023-11-26 10:46:49,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:49,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 181 transitions. [2023-11-26 10:46:49,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 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-26 10:46:49,399 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-26 10:46:49,399 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-26 10:46:49,400 INFO L175 Difference]: Start difference. First operand has 63 places, 35 transitions, 184 flow. Second operand 8 states and 181 transitions. [2023-11-26 10:46:49,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 682 flow [2023-11-26 10:46:49,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 628 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-26 10:46:49,422 INFO L231 Difference]: Finished difference. Result has 61 places, 34 transitions, 172 flow [2023-11-26 10:46:49,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=172, PETRI_PLACES=61, PETRI_TRANSITIONS=34} [2023-11-26 10:46:49,423 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-11-26 10:46:49,423 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 34 transitions, 172 flow [2023-11-26 10:46:49,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 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-26 10:46:49,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:49,424 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-26 10:46:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:46:49,424 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-26 10:46:49,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 685604546, now seen corresponding path program 1 times [2023-11-26 10:46:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308031232] [2023-11-26 10:46:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:50,352 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-26 10:46:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:50,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308031232] [2023-11-26 10:46:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308031232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:46:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624970724] [2023-11-26 10:46:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:50,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:46:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:46:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:46:50,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 10:46:50,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 34 transitions, 172 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-26 10:46:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 10:46:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:51,073 INFO L124 PetriNetUnfolderBase]: 736/1284 cut-off events. [2023-11-26 10:46:51,073 INFO L125 PetriNetUnfolderBase]: For 4876/4906 co-relation queries the response was YES. [2023-11-26 10:46:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 1284 events. 736/1284 cut-off events. For 4876/4906 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6656 event pairs, 329 based on Foata normal form. 36/1315 useless extension candidates. Maximal degree in co-relation 4979. Up to 910 conditions per place. [2023-11-26 10:46:51,089 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 38 selfloop transitions, 10 changer transitions 31/89 dead transitions. [2023-11-26 10:46:51,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 715 flow [2023-11-26 10:46:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:46:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 10:46:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2023-11-26 10:46:51,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221445221445221 [2023-11-26 10:46:51,092 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 224 transitions. [2023-11-26 10:46:51,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 224 transitions. [2023-11-26 10:46:51,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:51,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 224 transitions. [2023-11-26 10:46:51,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 0 states have call successors, (0), 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-26 10:46:51,095 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-26 10:46:51,097 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-26 10:46:51,098 INFO L175 Difference]: Start difference. First operand has 61 places, 34 transitions, 172 flow. Second operand 11 states and 224 transitions. [2023-11-26 10:46:51,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 715 flow [2023-11-26 10:46:51,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 663 flow, removed 21 selfloop flow, removed 8 redundant places. [2023-11-26 10:46:51,107 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 272 flow [2023-11-26 10:46:51,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=272, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2023-11-26 10:46:51,111 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-11-26 10:46:51,111 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 272 flow [2023-11-26 10:46:51,111 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-26 10:46:51,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:51,112 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-26 10:46:51,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:46:51,112 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-26 10:46:51,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash -809530138, now seen corresponding path program 1 times [2023-11-26 10:46:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:51,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205081588] [2023-11-26 10:46:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:51,332 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-26 10:46:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205081588] [2023-11-26 10:46:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205081588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277730627] [2023-11-26 10:46:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:51,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:46:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:46:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:46:51,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:46:51,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-26 10:46:51,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:51,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:46:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:51,802 INFO L124 PetriNetUnfolderBase]: 1243/2034 cut-off events. [2023-11-26 10:46:51,802 INFO L125 PetriNetUnfolderBase]: For 14007/14011 co-relation queries the response was YES. [2023-11-26 10:46:51,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8791 conditions, 2034 events. 1243/2034 cut-off events. For 14007/14011 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10312 event pairs, 175 based on Foata normal form. 83/2060 useless extension candidates. Maximal degree in co-relation 8765. Up to 1103 conditions per place. [2023-11-26 10:46:51,835 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-26 10:46:51,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 474 flow [2023-11-26 10:46:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:46:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:46:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2023-11-26 10:46:51,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2023-11-26 10:46:51,841 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 101 transitions. [2023-11-26 10:46:51,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 101 transitions. [2023-11-26 10:46:51,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:51,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 101 transitions. [2023-11-26 10:46:51,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,843 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-26 10:46:51,843 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-26 10:46:51,844 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 272 flow. Second operand 4 states and 101 transitions. [2023-11-26 10:46:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 474 flow [2023-11-26 10:46:51,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 408 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-11-26 10:46:51,855 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 232 flow [2023-11-26 10:46:51,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-11-26 10:46:51,856 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-11-26 10:46:51,857 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 232 flow [2023-11-26 10:46:51,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-26 10:46:51,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:51,857 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-26 10:46:51,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:46:51,859 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-26 10:46:51,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -208935867, now seen corresponding path program 1 times [2023-11-26 10:46:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166050528] [2023-11-26 10:46:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:52,143 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-26 10:46:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166050528] [2023-11-26 10:46:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166050528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211138590] [2023-11-26 10:46:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:52,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:52,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:46:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-26 10:46:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:46:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:52,544 INFO L124 PetriNetUnfolderBase]: 918/1545 cut-off events. [2023-11-26 10:46:52,545 INFO L125 PetriNetUnfolderBase]: For 7787/7791 co-relation queries the response was YES. [2023-11-26 10:46:52,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 1545 events. 918/1545 cut-off events. For 7787/7791 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7411 event pairs, 118 based on Foata normal form. 70/1568 useless extension candidates. Maximal degree in co-relation 6326. Up to 525 conditions per place. [2023-11-26 10:46:52,561 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 53 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-26 10:46:52,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 543 flow [2023-11-26 10:46:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2023-11-26 10:46:52,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6564102564102564 [2023-11-26 10:46:52,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 128 transitions. [2023-11-26 10:46:52,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 128 transitions. [2023-11-26 10:46:52,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:52,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 128 transitions. [2023-11-26 10:46:52,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:52,568 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-26 10:46:52,568 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-26 10:46:52,569 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 232 flow. Second operand 5 states and 128 transitions. [2023-11-26 10:46:52,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 543 flow [2023-11-26 10:46:52,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:52,577 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 284 flow [2023-11-26 10:46:52,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-11-26 10:46:52,581 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2023-11-26 10:46:52,581 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 284 flow [2023-11-26 10:46:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-26 10:46:52,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:52,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:46:52,582 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-26 10:46:52,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1811762906, now seen corresponding path program 1 times [2023-11-26 10:46:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:52,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873458258] [2023-11-26 10:46:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:52,878 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-26 10:46:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:52,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873458258] [2023-11-26 10:46:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873458258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601344318] [2023-11-26 10:46:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:52,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:52,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 10:46:52,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:52,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:52,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 10:46:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:53,233 INFO L124 PetriNetUnfolderBase]: 682/1149 cut-off events. [2023-11-26 10:46:53,234 INFO L125 PetriNetUnfolderBase]: For 7299/7303 co-relation queries the response was YES. [2023-11-26 10:46:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 1149 events. 682/1149 cut-off events. For 7299/7303 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5188 event pairs, 104 based on Foata normal form. 36/1142 useless extension candidates. Maximal degree in co-relation 5036. Up to 396 conditions per place. [2023-11-26 10:46:53,250 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2023-11-26 10:46:53,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 537 flow [2023-11-26 10:46:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:46:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:46:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2023-11-26 10:46:53,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2023-11-26 10:46:53,252 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2023-11-26 10:46:53,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2023-11-26 10:46:53,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:53,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2023-11-26 10:46:53,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-26 10:46:53,254 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-26 10:46:53,254 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-26 10:46:53,255 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 284 flow. Second operand 6 states and 141 transitions. [2023-11-26 10:46:53,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 537 flow [2023-11-26 10:46:53,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 490 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-26 10:46:53,263 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 274 flow [2023-11-26 10:46:53,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2023-11-26 10:46:53,264 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-11-26 10:46:53,265 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 274 flow [2023-11-26 10:46:53,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:53,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:53,265 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-26 10:46:53,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:46:53,266 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-26 10:46:53,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1727225748, now seen corresponding path program 1 times [2023-11-26 10:46:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036391991] [2023-11-26 10:46:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:54,534 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-26 10:46:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036391991] [2023-11-26 10:46:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036391991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:46:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179645865] [2023-11-26 10:46:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:54,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:46:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:46:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:46:54,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 10:46:54,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 274 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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-26 10:46:54,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:54,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 10:46:54,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:55,051 INFO L124 PetriNetUnfolderBase]: 543/1090 cut-off events. [2023-11-26 10:46:55,051 INFO L125 PetriNetUnfolderBase]: For 4427/4608 co-relation queries the response was YES. [2023-11-26 10:46:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 1090 events. 543/1090 cut-off events. For 4427/4608 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6170 event pairs, 135 based on Foata normal form. 26/1009 useless extension candidates. Maximal degree in co-relation 3932. Up to 497 conditions per place. [2023-11-26 10:46:55,062 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 33 selfloop transitions, 14 changer transitions 10/77 dead transitions. [2023-11-26 10:46:55,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 528 flow [2023-11-26 10:46:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2023-11-26 10:46:55,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2023-11-26 10:46:55,065 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 173 transitions. [2023-11-26 10:46:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 173 transitions. [2023-11-26 10:46:55,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:55,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 173 transitions. [2023-11-26 10:46:55,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:55,067 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-26 10:46:55,067 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-26 10:46:55,067 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 274 flow. Second operand 8 states and 173 transitions. [2023-11-26 10:46:55,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 528 flow [2023-11-26 10:46:55,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 422 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-11-26 10:46:55,080 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 296 flow [2023-11-26 10:46:55,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-11-26 10:46:55,082 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2023-11-26 10:46:55,083 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 296 flow [2023-11-26 10:46:55,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 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-26 10:46:55,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:55,083 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-26 10:46:55,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:46:55,084 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-26 10:46:55,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 541123244, now seen corresponding path program 2 times [2023-11-26 10:46:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648166257] [2023-11-26 10:46:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:56,473 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-26 10:46:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648166257] [2023-11-26 10:46:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648166257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 10:46:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109520708] [2023-11-26 10:46:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:56,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:46:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:46:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:46:56,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 10:46:56,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 296 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 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-26 10:46:56,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:56,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 10:46:56,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:57,151 INFO L124 PetriNetUnfolderBase]: 844/1684 cut-off events. [2023-11-26 10:46:57,152 INFO L125 PetriNetUnfolderBase]: For 2063/2214 co-relation queries the response was YES. [2023-11-26 10:46:57,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 1684 events. 844/1684 cut-off events. For 2063/2214 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10757 event pairs, 276 based on Foata normal form. 27/1535 useless extension candidates. Maximal degree in co-relation 4872. Up to 415 conditions per place. [2023-11-26 10:46:57,165 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 40 selfloop transitions, 8 changer transitions 24/92 dead transitions. [2023-11-26 10:46:57,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 608 flow [2023-11-26 10:46:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2023-11-26 10:46:57,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-26 10:46:57,167 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 182 transitions. [2023-11-26 10:46:57,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 182 transitions. [2023-11-26 10:46:57,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:57,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 182 transitions. [2023-11-26 10:46:57,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:57,170 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-26 10:46:57,170 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-26 10:46:57,170 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 296 flow. Second operand 8 states and 182 transitions. [2023-11-26 10:46:57,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 608 flow [2023-11-26 10:46:57,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 553 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-11-26 10:46:57,181 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 301 flow [2023-11-26 10:46:57,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-11-26 10:46:57,182 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-26 10:46:57,183 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 301 flow [2023-11-26 10:46:57,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 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-26 10:46:57,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:57,183 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-26 10:46:57,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:46:57,184 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-26 10:46:57,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 681025512, now seen corresponding path program 3 times [2023-11-26 10:46:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572798116] [2023-11-26 10:46:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:57,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:57,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:46:57,372 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:57,373 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-26 10:46:57,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-26 10:46:57,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-26 10:46:57,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-26 10:46:57,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-26 10:46:57,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-26 10:46:57,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:46:57,378 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:57,385 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:46:57,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:46:57,462 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 10:46:57,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:46:57,465 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:57,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:57 BasicIcfg [2023-11-26 10:46:57,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:46:57,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:46:57,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:46:57,500 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:46:57,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:41" (3/4) ... [2023-11-26 10:46:57,501 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 10:46:57,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 10:46:57,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:46:57,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:57,640 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:46:57,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:46:57,641 INFO L158 Benchmark]: Toolchain (without parser) took 17892.79ms. Allocated memory was 130.0MB in the beginning and 350.2MB in the end (delta: 220.2MB). Free memory was 83.0MB in the beginning and 170.1MB in the end (delta: -87.0MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,641 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:57,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 789.60ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 83.0MB in the beginning and 156.9MB in the end (delta: -73.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.90ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 153.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,642 INFO L158 Benchmark]: Boogie Preprocessor took 106.44ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 150.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,643 INFO L158 Benchmark]: RCFGBuilder took 845.13ms. Allocated memory is still 188.7MB. Free memory was 150.6MB in the beginning and 102.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,643 INFO L158 Benchmark]: TraceAbstraction took 15905.32ms. Allocated memory was 188.7MB in the beginning and 350.2MB in the end (delta: 161.5MB). Free memory was 102.4MB in the beginning and 181.6MB in the end (delta: -79.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,643 INFO L158 Benchmark]: Witness Printer took 140.76ms. Allocated memory is still 350.2MB. Free memory was 181.6MB in the beginning and 170.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:46:57,645 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.28ms. Allocated memory is still 98.6MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 789.60ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 83.0MB in the beginning and 156.9MB in the end (delta: -73.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.90ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 153.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.44ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 150.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.13ms. Allocated memory is still 188.7MB. Free memory was 150.6MB in the beginning and 102.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15905.32ms. Allocated memory was 188.7MB in the beginning and 350.2MB in the end (delta: 161.5MB). Free memory was 102.4MB in the beginning and 181.6MB in the end (delta: -79.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 140.76ms. Allocated memory is still 350.2MB. Free memory was 181.6MB in the beginning and 170.1MB in the end (delta: 11.5MB). 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation 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; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 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, 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=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 825]: 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: 823]: 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: 15.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 689 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1485 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 46 mSDtfsCounter, 1485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=11, InterpolantAutomatonStates: 82, 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.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 2085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-26 10:46:57,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089a9ac7-44f9-4fcb-afb1-2e079befaedc/bin/uautomizer-verify-VRDe98Ueme/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