./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:00:21,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:00:21,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:00:21,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:00:21,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:00:21,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:00:21,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:00:21,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:00:21,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:00:21,765 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:00:21,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:00:21,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:00:21,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:00:21,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:00:21,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:00:21,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:00:21,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:00:21,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:00:21,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:00:21,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:00:21,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:00:21,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:00:21,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:00:21,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:00:21,775 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:00:21,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:00:21,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:00:21,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:00:21,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:00:21,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:00:21,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:00:21,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:21,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:00:21,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:00:21,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:00:21,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:00:21,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:00:21,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:00:21,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:00:21,782 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:00:21,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:00:21,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:00:21,783 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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2023-11-26 12:00:22,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:00:22,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:00:22,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:00:22,150 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:00:22,151 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:00:22,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-26 12:00:25,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:00:25,749 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:00:25,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-26 12:00:25,769 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/data/89774088a/e978858157c24ff7809a5406274b7175/FLAGaa2eddb76 [2023-11-26 12:00:25,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/data/89774088a/e978858157c24ff7809a5406274b7175 [2023-11-26 12:00:25,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:00:25,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:00:25,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:25,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:00:25,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:00:25,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:25" (1/1) ... [2023-11-26 12:00:25,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac73e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:25, skipping insertion in model container [2023-11-26 12:00:25,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:25" (1/1) ... [2023-11-26 12:00:25,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:00:26,027 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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2023-11-26 12:00:26,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:26,385 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:00:26,400 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_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2023-11-26 12:00:26,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:26,557 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:00:26,557 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:00:26,565 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:00:26,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26 WrapperNode [2023-11-26 12:00:26,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:26,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:26,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:00:26,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:00:26,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,625 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-26 12:00:26,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:26,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:00:26,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:00:26,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:00:26,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,661 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 12:00:26,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:00:26,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:00:26,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:00:26,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:00:26,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (1/1) ... [2023-11-26 12:00:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:26,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:00:26,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:00:26,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:00:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:00:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:00:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:00:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:00:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:00:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:00:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:00:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:00:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:00:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:00:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:00:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:00:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:00:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:00:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:00:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:00:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:00:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:00:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:00:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:00:26,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:00:26,832 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 12:00:27,048 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:00:27,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:00:27,440 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:00:27,682 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:00:27,682 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:00:27,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:27 BoogieIcfgContainer [2023-11-26 12:00:27,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:00:27,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:00:27,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:00:27,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:00:27,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:25" (1/3) ... [2023-11-26 12:00:27,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74593dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:27, skipping insertion in model container [2023-11-26 12:00:27,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:26" (2/3) ... [2023-11-26 12:00:27,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74593dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:27, skipping insertion in model container [2023-11-26 12:00:27,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:27" (3/3) ... [2023-11-26 12:00:27,692 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-11-26 12:00:27,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:00:27,712 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:00:27,712 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 12:00:27,712 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:00:27,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:00:27,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 12:00:27,883 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-26 12:00:27,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:00:27,886 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 5. Compared 70 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 12:00:27,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-26 12:00:27,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-26 12:00:27,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:00:27,924 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;@76f02fb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:00:27,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 12:00:27,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:00:27,977 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-26 12:00:27,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:00:27,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:27,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:00:27,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:27,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2097196014, now seen corresponding path program 1 times [2023-11-26 12:00:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989614189] [2023-11-26 12:00:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:28,587 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 12:00:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989614189] [2023-11-26 12:00:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989614189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:00:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648555094] [2023-11-26 12:00:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:28,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:28,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:28,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:28,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2023-11-26 12:00:28,655 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.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 12:00:28,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:28,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2023-11-26 12:00:28,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:29,101 INFO L124 PetriNetUnfolderBase]: 528/983 cut-off events. [2023-11-26 12:00:29,101 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-26 12:00:29,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 983 events. 528/983 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5747 event pairs, 168 based on Foata normal form. 36/992 useless extension candidates. Maximal degree in co-relation 1820. Up to 652 conditions per place. [2023-11-26 12:00:29,120 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 27 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-26 12:00:29,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 166 flow [2023-11-26 12:00:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-26 12:00:29,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2023-11-26 12:00:29,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-26 12:00:29,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-26 12:00:29,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:29,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-26 12:00:29,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:00:29,149 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 12:00:29,150 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 12:00:29,152 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2023-11-26 12:00:29,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 166 flow [2023-11-26 12:00:29,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:00:29,160 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-26 12:00:29,163 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 12:00:29,168 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-26 12:00:29,168 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-26 12:00:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 12:00:29,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:29,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:00:29,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:29,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1329903449, now seen corresponding path program 1 times [2023-11-26 12:00:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337873102] [2023-11-26 12:00:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:30,086 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 12:00:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337873102] [2023-11-26 12:00:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337873102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:30,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:00:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840328569] [2023-11-26 12:00:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:30,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:00:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:00:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:00:30,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 12:00:30,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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 12:00:30,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 12:00:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:30,741 INFO L124 PetriNetUnfolderBase]: 1074/1832 cut-off events. [2023-11-26 12:00:30,741 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-26 12:00:30,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 1832 events. 1074/1832 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11759 event pairs, 279 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 3627. Up to 1057 conditions per place. [2023-11-26 12:00:30,755 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 28 selfloop transitions, 3 changer transitions 38/81 dead transitions. [2023-11-26 12:00:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 326 flow [2023-11-26 12:00:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:00:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:00:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2023-11-26 12:00:30,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2023-11-26 12:00:30,759 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 191 transitions. [2023-11-26 12:00:30,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 191 transitions. [2023-11-26 12:00:30,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:30,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 191 transitions. [2023-11-26 12:00:30,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:00:30,763 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 12:00:30,764 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 12:00:30,764 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 191 transitions. [2023-11-26 12:00:30,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 326 flow [2023-11-26 12:00:30,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:30,767 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2023-11-26 12:00:30,768 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-11-26 12:00:30,769 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-26 12:00:30,769 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2023-11-26 12:00:30,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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 12:00:30,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:30,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:30,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:00:30,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:30,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash 894176217, now seen corresponding path program 1 times [2023-11-26 12:00:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540723499] [2023-11-26 12:00:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:30,961 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 12:00:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540723499] [2023-11-26 12:00:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540723499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:30,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:00:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549454652] [2023-11-26 12:00:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:30,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:00:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:00:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:30,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 12:00:30,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 12:00:30,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:30,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 12:00:30,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:31,431 INFO L124 PetriNetUnfolderBase]: 1412/2349 cut-off events. [2023-11-26 12:00:31,431 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2023-11-26 12:00:31,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 2349 events. 1412/2349 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13864 event pairs, 171 based on Foata normal form. 96/2391 useless extension candidates. Maximal degree in co-relation 5458. Up to 1239 conditions per place. [2023-11-26 12:00:31,456 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-26 12:00:31,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 273 flow [2023-11-26 12:00:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:00:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:00:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2023-11-26 12:00:31,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2023-11-26 12:00:31,458 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 103 transitions. [2023-11-26 12:00:31,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 103 transitions. [2023-11-26 12:00:31,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:31,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 103 transitions. [2023-11-26 12:00:31,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 12:00:31,460 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 12:00:31,460 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 12:00:31,460 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 4 states and 103 transitions. [2023-11-26 12:00:31,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 273 flow [2023-11-26 12:00:31,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 264 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-26 12:00:31,473 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 136 flow [2023-11-26 12:00:31,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-26 12:00:31,474 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-11-26 12:00:31,475 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 136 flow [2023-11-26 12:00:31,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 12:00:31,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:31,475 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 12:00:31,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:00:31,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:31,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1900762865, now seen corresponding path program 1 times [2023-11-26 12:00:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052227214] [2023-11-26 12:00:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:32,297 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 12:00:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052227214] [2023-11-26 12:00:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052227214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:00:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10379278] [2023-11-26 12:00:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:32,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:00:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:00:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:00:32,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 12:00:32,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 12:00:32,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:32,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 12:00:32,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:33,037 INFO L124 PetriNetUnfolderBase]: 1106/2008 cut-off events. [2023-11-26 12:00:33,037 INFO L125 PetriNetUnfolderBase]: For 1096/1168 co-relation queries the response was YES. [2023-11-26 12:00:33,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 2008 events. 1106/2008 cut-off events. For 1096/1168 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13096 event pairs, 240 based on Foata normal form. 43/1947 useless extension candidates. Maximal degree in co-relation 4874. Up to 1272 conditions per place. [2023-11-26 12:00:33,056 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 44 selfloop transitions, 14 changer transitions 10/84 dead transitions. [2023-11-26 12:00:33,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 404 flow [2023-11-26 12:00:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:00:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:00:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2023-11-26 12:00:33,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2023-11-26 12:00:33,061 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 189 transitions. [2023-11-26 12:00:33,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 189 transitions. [2023-11-26 12:00:33,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:33,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 189 transitions. [2023-11-26 12:00:33,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 0 states have call successors, (0), 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 12:00:33,065 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 12:00:33,066 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 12:00:33,067 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 136 flow. Second operand 8 states and 189 transitions. [2023-11-26 12:00:33,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 404 flow [2023-11-26 12:00:33,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 394 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-26 12:00:33,074 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 224 flow [2023-11-26 12:00:33,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-26 12:00:33,076 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2023-11-26 12:00:33,077 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 224 flow [2023-11-26 12:00:33,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 12:00:33,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:33,078 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 12:00:33,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:00:33,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:33,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1442318187, now seen corresponding path program 1 times [2023-11-26 12:00:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:33,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571019856] [2023-11-26 12:00:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:33,325 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 12:00:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571019856] [2023-11-26 12:00:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571019856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:00:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136637538] [2023-11-26 12:00:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:33,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:00:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:00:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:00:33,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 12:00:33,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 224 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 12:00:33,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:33,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 12:00:33,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:33,765 INFO L124 PetriNetUnfolderBase]: 1103/1884 cut-off events. [2023-11-26 12:00:33,765 INFO L125 PetriNetUnfolderBase]: For 1569/1588 co-relation queries the response was YES. [2023-11-26 12:00:33,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 1884 events. 1103/1884 cut-off events. For 1569/1588 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10389 event pairs, 106 based on Foata normal form. 100/1916 useless extension candidates. Maximal degree in co-relation 5260. Up to 633 conditions per place. [2023-11-26 12:00:33,784 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 8 changer transitions 5/82 dead transitions. [2023-11-26 12:00:33,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 490 flow [2023-11-26 12:00:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:00:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:00:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-26 12:00:33,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2023-11-26 12:00:33,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-26 12:00:33,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-26 12:00:33,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:33,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-26 12:00:33,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 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 12:00:33,789 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 12:00:33,790 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 12:00:33,790 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 224 flow. Second operand 5 states and 131 transitions. [2023-11-26 12:00:33,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 490 flow [2023-11-26 12:00:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 462 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-11-26 12:00:33,799 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 222 flow [2023-11-26 12:00:33,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-11-26 12:00:33,802 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-26 12:00:33,802 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 222 flow [2023-11-26 12:00:33,802 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 12:00:33,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:33,803 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 12:00:33,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:00:33,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:33,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2013882583, now seen corresponding path program 1 times [2023-11-26 12:00:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193338075] [2023-11-26 12:00:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:34,122 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 12:00:34,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193338075] [2023-11-26 12:00:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193338075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:00:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057820299] [2023-11-26 12:00:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:00:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:00:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:00:34,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-26 12:00:34,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 222 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 12:00:34,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:34,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-26 12:00:34,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:34,514 INFO L124 PetriNetUnfolderBase]: 815/1380 cut-off events. [2023-11-26 12:00:34,514 INFO L125 PetriNetUnfolderBase]: For 1973/1992 co-relation queries the response was YES. [2023-11-26 12:00:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 1380 events. 815/1380 cut-off events. For 1973/1992 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7175 event pairs, 106 based on Foata normal form. 58/1370 useless extension candidates. Maximal degree in co-relation 4260. Up to 483 conditions per place. [2023-11-26 12:00:34,527 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 53 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2023-11-26 12:00:34,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 447 flow [2023-11-26 12:00:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:00:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:00:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2023-11-26 12:00:34,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-26 12:00:34,529 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 143 transitions. [2023-11-26 12:00:34,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 143 transitions. [2023-11-26 12:00:34,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:34,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 143 transitions. [2023-11-26 12:00:34,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:00:34,531 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 12:00:34,532 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 12:00:34,532 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 222 flow. Second operand 6 states and 143 transitions. [2023-11-26 12:00:34,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 447 flow [2023-11-26 12:00:34,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 406 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-11-26 12:00:34,539 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 230 flow [2023-11-26 12:00:34,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-26 12:00:34,543 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2023-11-26 12:00:34,543 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 230 flow [2023-11-26 12:00:34,543 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 12:00:34,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:34,544 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 12:00:34,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:00:34,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:34,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 431939300, now seen corresponding path program 1 times [2023-11-26 12:00:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920081223] [2023-11-26 12:00:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:35,104 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 12:00:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920081223] [2023-11-26 12:00:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920081223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:00:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973513779] [2023-11-26 12:00:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:35,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:00:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:00:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:00:35,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 12:00:35,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 12:00:35,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:35,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 12:00:35,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:35,764 INFO L124 PetriNetUnfolderBase]: 1133/2136 cut-off events. [2023-11-26 12:00:35,764 INFO L125 PetriNetUnfolderBase]: For 3330/3663 co-relation queries the response was YES. [2023-11-26 12:00:35,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5844 conditions, 2136 events. 1133/2136 cut-off events. For 3330/3663 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13519 event pairs, 254 based on Foata normal form. 53/2011 useless extension candidates. Maximal degree in co-relation 5823. Up to 856 conditions per place. [2023-11-26 12:00:35,781 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 34 selfloop transitions, 4 changer transitions 38/96 dead transitions. [2023-11-26 12:00:35,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 538 flow [2023-11-26 12:00:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:00:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:00:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2023-11-26 12:00:35,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2023-11-26 12:00:35,786 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 172 transitions. [2023-11-26 12:00:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 172 transitions. [2023-11-26 12:00:35,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:35,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 172 transitions. [2023-11-26 12:00:35,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 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 12:00:35,789 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 12:00:35,789 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 12:00:35,790 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 230 flow. Second operand 8 states and 172 transitions. [2023-11-26 12:00:35,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 538 flow [2023-11-26 12:00:35,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 514 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-26 12:00:35,815 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 245 flow [2023-11-26 12:00:35,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2023-11-26 12:00:35,816 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-11-26 12:00:35,817 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 245 flow [2023-11-26 12:00:35,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 12:00:35,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:35,817 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 12:00:35,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:00:35,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:35,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 122088582, now seen corresponding path program 2 times [2023-11-26 12:00:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704739953] [2023-11-26 12:00:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:36,379 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 12:00:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:36,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704739953] [2023-11-26 12:00:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704739953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:36,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:00:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708457671] [2023-11-26 12:00:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:36,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:00:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:00:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:00:36,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-26 12:00:36,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 12:00:36,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:36,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-26 12:00:36,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:36,985 INFO L124 PetriNetUnfolderBase]: 870/1692 cut-off events. [2023-11-26 12:00:36,986 INFO L125 PetriNetUnfolderBase]: For 1942/2092 co-relation queries the response was YES. [2023-11-26 12:00:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 1692 events. 870/1692 cut-off events. For 1942/2092 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11124 event pairs, 217 based on Foata normal form. 35/1550 useless extension candidates. Maximal degree in co-relation 4549. Up to 630 conditions per place. [2023-11-26 12:00:36,997 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 25 selfloop transitions, 3 changer transitions 31/78 dead transitions. [2023-11-26 12:00:37,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 457 flow [2023-11-26 12:00:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:00:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:00:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2023-11-26 12:00:37,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2023-11-26 12:00:37,004 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 159 transitions. [2023-11-26 12:00:37,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 159 transitions. [2023-11-26 12:00:37,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:37,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 159 transitions. [2023-11-26 12:00:37,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 12:00:37,007 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 12:00:37,008 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 12:00:37,008 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 245 flow. Second operand 8 states and 159 transitions. [2023-11-26 12:00:37,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 457 flow [2023-11-26 12:00:37,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 437 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-26 12:00:37,025 INFO L231 Difference]: Finished difference. Result has 72 places, 41 transitions, 208 flow [2023-11-26 12:00:37,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=72, PETRI_TRANSITIONS=41} [2023-11-26 12:00:37,028 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-11-26 12:00:37,028 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 41 transitions, 208 flow [2023-11-26 12:00:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 12:00:37,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:37,029 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 12:00:37,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:00:37,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:37,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 978469206, now seen corresponding path program 3 times [2023-11-26 12:00:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737649168] [2023-11-26 12:00:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:38,556 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 12:00:38,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:38,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737649168] [2023-11-26 12:00:38,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737649168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:38,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 12:00:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798681326] [2023-11-26 12:00:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:38,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 12:00:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:00:38,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:00:38,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-26 12:00:38,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 41 transitions, 208 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 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 12:00:38,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:38,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-26 12:00:38,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:39,174 INFO L124 PetriNetUnfolderBase]: 663/1346 cut-off events. [2023-11-26 12:00:39,175 INFO L125 PetriNetUnfolderBase]: For 1420/1526 co-relation queries the response was YES. [2023-11-26 12:00:39,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1346 events. 663/1346 cut-off events. For 1420/1526 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8446 event pairs, 170 based on Foata normal form. 21/1227 useless extension candidates. Maximal degree in co-relation 3659. Up to 457 conditions per place. [2023-11-26 12:00:39,186 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 25 selfloop transitions, 3 changer transitions 21/70 dead transitions. [2023-11-26 12:00:39,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 396 flow [2023-11-26 12:00:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:00:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:00:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2023-11-26 12:00:39,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2023-11-26 12:00:39,188 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 170 transitions. [2023-11-26 12:00:39,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 170 transitions. [2023-11-26 12:00:39,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:39,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 170 transitions. [2023-11-26 12:00:39,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 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 12:00:39,191 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 12:00:39,191 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 12:00:39,191 INFO L175 Difference]: Start difference. First operand has 72 places, 41 transitions, 208 flow. Second operand 8 states and 170 transitions. [2023-11-26 12:00:39,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 396 flow [2023-11-26 12:00:39,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 368 flow, removed 8 selfloop flow, removed 9 redundant places. [2023-11-26 12:00:39,203 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 201 flow [2023-11-26 12:00:39,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2023-11-26 12:00:39,205 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-11-26 12:00:39,205 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 201 flow [2023-11-26 12:00:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 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 12:00:39,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:39,206 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 12:00:39,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:00:39,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-26 12:00:39,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1815798730, now seen corresponding path program 4 times [2023-11-26 12:00:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:39,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324870453] [2023-11-26 12:00:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:00:39,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:00:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:00:39,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:00:39,405 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:00:39,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-26 12:00:39,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-26 12:00:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-26 12:00:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-26 12:00:39,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-26 12:00:39,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-26 12:00:39,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:00:39,416 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:39,423 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:00:39,423 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:00:39,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 12:00:39,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:00:39,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:00:39,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:00:39 BasicIcfg [2023-11-26 12:00:39,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:00:39,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:00:39,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:00:39,539 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:00:39,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:27" (3/4) ... [2023-11-26 12:00:39,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 12:00:39,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 12:00:39,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:00:39,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:00:39,673 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:00:39,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:00:39,674 INFO L158 Benchmark]: Toolchain (without parser) took 13885.27ms. Allocated memory was 121.6MB in the beginning and 276.8MB in the end (delta: 155.2MB). Free memory was 73.9MB in the beginning and 124.9MB in the end (delta: -51.1MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,675 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 96.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:00:39,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.50ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 73.7MB in the beginning and 117.8MB in the end (delta: -44.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.72ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,676 INFO L158 Benchmark]: Boogie Preprocessor took 93.59ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 111.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,677 INFO L158 Benchmark]: RCFGBuilder took 961.01ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 63.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,677 INFO L158 Benchmark]: TraceAbstraction took 11852.86ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 136.5MB in the end (delta: -73.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,678 INFO L158 Benchmark]: Witness Printer took 134.92ms. Allocated memory is still 276.8MB. Free memory was 136.5MB in the beginning and 124.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 12:00:39,681 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.32ms. Allocated memory is still 96.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.50ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 73.7MB in the beginning and 117.8MB in the end (delta: -44.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.72ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.59ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 111.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 961.01ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 63.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11852.86ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 136.5MB in the end (delta: -73.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 134.92ms. Allocated memory is still 276.8MB. Free memory was 136.5MB in the beginning and 124.9MB 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; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((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, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((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, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((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, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [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 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 11.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1295 IncrementalHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 23 mSDtfsCounter, 1295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=7, InterpolantAutomatonStates: 58, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 1542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 12:00:39,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55c27c52-e3ac-41db-8e0c-a47c7d8f13c9/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