./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/reorder_5.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_5.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/reorder_5.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_5.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:22:02,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:02,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:02,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:02,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:02,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:02,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:02,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:02,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:02,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:02,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:02,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:02,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:02,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:02,806 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:02,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:02,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:02,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:02,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:02,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:02,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:02,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:02,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:02,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:02,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:02,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:02,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:02,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:02,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:02,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:02,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:02,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:02,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:02,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:02,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:02,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:02,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:02,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:02,813 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:22:03,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:03,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:03,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:03,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:03,055 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:03,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_5.i [2024-06-14 14:22:03,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:04,203 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:04,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_5.i [2024-06-14 14:22:04,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6d63584/abf7dcf55ca044a3a421ff52ba1beac9/FLAG971fb152a [2024-06-14 14:22:04,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6d63584/abf7dcf55ca044a3a421ff52ba1beac9 [2024-06-14 14:22:04,231 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:04,232 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:04,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_5.yml/witness.yml [2024-06-14 14:22:04,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:04,319 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:04,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:04,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:04,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:04,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:04" (1/2) ... [2024-06-14 14:22:04,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ec5120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:04" (1/2) ... [2024-06-14 14:22:04,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d522e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/2) ... [2024-06-14 14:22:04,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ec5120 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/2) ... [2024-06-14 14:22:04,327 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:04,376 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:04,377 INFO L97 edCorrectnessWitness]: Location invariant before [L1261-L1265] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-14 14:22:04,377 INFO L97 edCorrectnessWitness]: Location invariant before [L1255-L1258] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-14 14:22:04,378 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:04,378 INFO L106 edCorrectnessWitness]: ghost_update [L1261-L1262] multithreaded = 1; [2024-06-14 14:22:04,378 INFO L106 edCorrectnessWitness]: ghost_update [L1255-L1255] multithreaded = 1; [2024-06-14 14:22:04,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:04,853 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:04,859 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:05,077 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:05,189 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:05,189 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05 WrapperNode [2024-06-14 14:22:05,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:05,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:05,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:05,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:05,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,238 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-06-14 14:22:05,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:05,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:05,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:05,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:05,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,264 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-06-14 14:22:05,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:05,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:05,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:05,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:05,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:05,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:22:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:22:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-14 14:22:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-14 14:22:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 14:22:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2024-06-14 14:22:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 14:22:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2024-06-14 14:22:05,360 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2024-06-14 14:22:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 14:22:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 14:22:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:05,363 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:05,484 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:05,486 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:05,764 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:05,764 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:05,887 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:05,888 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-14 14:22:05,889 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:05 BoogieIcfgContainer [2024-06-14 14:22:05,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:05,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:05,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:05,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:05,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:04" (1/4) ... [2024-06-14 14:22:05,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1564e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:05, skipping insertion in model container [2024-06-14 14:22:05,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/4) ... [2024-06-14 14:22:05,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1564e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:05, skipping insertion in model container [2024-06-14 14:22:05,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (3/4) ... [2024-06-14 14:22:05,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1564e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:05, skipping insertion in model container [2024-06-14 14:22:05,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:05" (4/4) ... [2024-06-14 14:22:05,897 INFO L112 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2024-06-14 14:22:05,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:05,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:22:05,910 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:05,944 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-14 14:22:05,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 94 flow [2024-06-14 14:22:06,013 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2024-06-14 14:22:06,014 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-14 14:22:06,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 88 events. 8/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 338 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2024-06-14 14:22:06,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 94 flow [2024-06-14 14:22:06,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 60 flow [2024-06-14 14:22:06,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:06,029 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=false, 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;@3fb6f2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:06,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:06,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:06,031 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:06,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:06,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:06,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:06,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:06,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 380532, now seen corresponding path program 1 times [2024-06-14 14:22:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003738796] [2024-06-14 14:22:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003738796] [2024-06-14 14:22:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003738796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951271419] [2024-06-14 14:22:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:06,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:06,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-14 14:22:06,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:06,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:06,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-14 14:22:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:06,374 INFO L124 PetriNetUnfolderBase]: 30/128 cut-off events. [2024-06-14 14:22:06,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:06,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 128 events. 30/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 579 event pairs, 30 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 159. Up to 83 conditions per place. [2024-06-14 14:22:06,376 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 14:22:06,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 100 flow [2024-06-14 14:22:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 14:22:06,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-14 14:22:06,386 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 60 flow. Second operand 3 states and 55 transitions. [2024-06-14 14:22:06,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 100 flow [2024-06-14 14:22:06,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:06,390 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 81 flow [2024-06-14 14:22:06,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-14 14:22:06,405 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-14 14:22:06,406 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 81 flow [2024-06-14 14:22:06,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:06,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:06,406 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:06,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:22:06,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:06,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 70222154, now seen corresponding path program 1 times [2024-06-14 14:22:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893486512] [2024-06-14 14:22:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893486512] [2024-06-14 14:22:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893486512] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085104378] [2024-06-14 14:22:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:06,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:07,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:07,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-14 14:22:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:07,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:07,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:07,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085104378] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:07,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:07,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931466950] [2024-06-14 14:22:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:07,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-14 14:22:07,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:07,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:07,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-14 14:22:07,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:07,883 INFO L124 PetriNetUnfolderBase]: 25/115 cut-off events. [2024-06-14 14:22:07,883 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-14 14:22:07,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 115 events. 25/115 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 487 event pairs, 25 based on Foata normal form. 8/113 useless extension candidates. Maximal degree in co-relation 151. Up to 56 conditions per place. [2024-06-14 14:22:07,884 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2024-06-14 14:22:07,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 142 flow [2024-06-14 14:22:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 14:22:07,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-14 14:22:07,885 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 81 flow. Second operand 4 states and 67 transitions. [2024-06-14 14:22:07,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 142 flow [2024-06-14 14:22:07,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:07,887 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2024-06-14 14:22:07,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-14 14:22:07,887 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-14 14:22:07,887 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2024-06-14 14:22:07,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:07,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:07,888 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:07,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-14 14:22:08,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:08,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:08,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1059925663, now seen corresponding path program 1 times [2024-06-14 14:22:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526672438] [2024-06-14 14:22:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526672438] [2024-06-14 14:22:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526672438] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888485566] [2024-06-14 14:22:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:08,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:08,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-14 14:22:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:08,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-14 14:22:08,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:08,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888485566] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-14 14:22:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868274931] [2024-06-14 14:22:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:09,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:22:09,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-14 14:22:09,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:09,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:09,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-14 14:22:09,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:09,250 INFO L124 PetriNetUnfolderBase]: 29/114 cut-off events. [2024-06-14 14:22:09,251 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-14 14:22:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 114 events. 29/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 487 event pairs, 14 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 169. Up to 33 conditions per place. [2024-06-14 14:22:09,253 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 18 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-14 14:22:09,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 150 flow [2024-06-14 14:22:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-14 14:22:09,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41081081081081083 [2024-06-14 14:22:09,257 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 5 states and 76 transitions. [2024-06-14 14:22:09,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 150 flow [2024-06-14 14:22:09,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:09,259 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 104 flow [2024-06-14 14:22:09,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-06-14 14:22:09,261 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-06-14 14:22:09,261 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 104 flow [2024-06-14 14:22:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:09,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:09,261 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-06-14 14:22:09,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:09,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-14 14:22:09,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:09,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash 339495046, now seen corresponding path program 1 times [2024-06-14 14:22:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276722247] [2024-06-14 14:22:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:09,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:09,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:09,536 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:09,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:09,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:09,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:09,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:09,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:22:09,538 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:09,540 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:09,540 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-14 14:22:09,558 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-06-14 14:22:09,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 146 flow [2024-06-14 14:22:09,607 INFO L124 PetriNetUnfolderBase]: 57/283 cut-off events. [2024-06-14 14:22:09,608 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-14 14:22:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 283 events. 57/283 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1359 event pairs, 2 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 191. Up to 32 conditions per place. [2024-06-14 14:22:09,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 51 transitions, 146 flow [2024-06-14 14:22:09,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 92 flow [2024-06-14 14:22:09,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:09,613 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=false, 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;@3fb6f2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:09,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:09,615 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:09,615 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:09,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:09,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:09,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:09,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:09,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash 429189, now seen corresponding path program 1 times [2024-06-14 14:22:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:09,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700704224] [2024-06-14 14:22:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:09,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700704224] [2024-06-14 14:22:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700704224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039329780] [2024-06-14 14:22:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:09,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-06-14 14:22:09,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:09,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:09,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-06-14 14:22:09,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:09,715 INFO L124 PetriNetUnfolderBase]: 346/832 cut-off events. [2024-06-14 14:22:09,715 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-14 14:22:09,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 832 events. 346/832 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5559 event pairs, 346 based on Foata normal form. 2/783 useless extension candidates. Maximal degree in co-relation 612. Up to 615 conditions per place. [2024-06-14 14:22:09,720 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-14 14:22:09,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 140 flow [2024-06-14 14:22:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-14 14:22:09,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2024-06-14 14:22:09,721 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 92 flow. Second operand 3 states and 77 transitions. [2024-06-14 14:22:09,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 140 flow [2024-06-14 14:22:09,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:09,723 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 113 flow [2024-06-14 14:22:09,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-06-14 14:22:09,723 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 14:22:09,723 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 113 flow [2024-06-14 14:22:09,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:09,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:09,724 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:09,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:22:09,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:09,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1109505037, now seen corresponding path program 1 times [2024-06-14 14:22:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231851043] [2024-06-14 14:22:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231851043] [2024-06-14 14:22:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231851043] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095528608] [2024-06-14 14:22:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:09,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:09,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-14 14:22:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:10,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:10,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:10,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095528608] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:10,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224018261] [2024-06-14 14:22:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:10,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:10,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:10,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-06-14 14:22:10,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:10,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:10,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-06-14 14:22:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:10,659 INFO L124 PetriNetUnfolderBase]: 281/719 cut-off events. [2024-06-14 14:22:10,659 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-14 14:22:10,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 719 events. 281/719 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4623 event pairs, 281 based on Foata normal form. 48/727 useless extension candidates. Maximal degree in co-relation 1189. Up to 454 conditions per place. [2024-06-14 14:22:10,665 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2024-06-14 14:22:10,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 195 flow [2024-06-14 14:22:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-14 14:22:10,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2024-06-14 14:22:10,667 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 113 flow. Second operand 4 states and 97 transitions. [2024-06-14 14:22:10,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 195 flow [2024-06-14 14:22:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:10,669 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 126 flow [2024-06-14 14:22:10,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-14 14:22:10,671 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-14 14:22:10,671 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 126 flow [2024-06-14 14:22:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:10,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:10,671 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:10,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:10,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1016117080, now seen corresponding path program 1 times [2024-06-14 14:22:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846070157] [2024-06-14 14:22:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846070157] [2024-06-14 14:22:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846070157] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121144285] [2024-06-14 14:22:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:11,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:11,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-14 14:22:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:11,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-14 14:22:11,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:11,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121144285] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2024-06-14 14:22:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898909055] [2024-06-14 14:22:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:11,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-06-14 14:22:11,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-06-14 14:22:11,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:11,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:11,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-06-14 14:22:11,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:12,097 INFO L124 PetriNetUnfolderBase]: 346/776 cut-off events. [2024-06-14 14:22:12,097 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-06-14 14:22:12,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 776 events. 346/776 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4988 event pairs, 323 based on Foata normal form. 6/732 useless extension candidates. Maximal degree in co-relation 1375. Up to 507 conditions per place. [2024-06-14 14:22:12,101 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 33 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-14 14:22:12,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 246 flow [2024-06-14 14:22:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-14 14:22:12,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:22:12,103 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 126 flow. Second operand 6 states and 136 transitions. [2024-06-14 14:22:12,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 246 flow [2024-06-14 14:22:12,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:12,104 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 146 flow [2024-06-14 14:22:12,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-06-14 14:22:12,105 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-14 14:22:12,105 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 146 flow [2024-06-14 14:22:12,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:12,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:12,105 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-06-14 14:22:12,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:12,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:12,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:12,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash 198362857, now seen corresponding path program 1 times [2024-06-14 14:22:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883385254] [2024-06-14 14:22:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:12,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:12,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:12,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:12,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:12,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:12,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:12,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:12,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:22:12,366 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:12,366 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:12,366 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-14 14:22:12,388 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-06-14 14:22:12,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 202 flow [2024-06-14 14:22:12,461 INFO L124 PetriNetUnfolderBase]: 336/982 cut-off events. [2024-06-14 14:22:12,461 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-06-14 14:22:12,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 982 events. 336/982 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5466 event pairs, 32 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 705. Up to 192 conditions per place. [2024-06-14 14:22:12,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 65 transitions, 202 flow [2024-06-14 14:22:12,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 128 flow [2024-06-14 14:22:12,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:12,466 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=false, 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;@3fb6f2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:12,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:12,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:12,467 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:12,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:12,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:12,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:12,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:12,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 491748, now seen corresponding path program 1 times [2024-06-14 14:22:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054534622] [2024-06-14 14:22:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:12,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054534622] [2024-06-14 14:22:12,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054534622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:12,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:12,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245942278] [2024-06-14 14:22:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:12,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:12,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-06-14 14:22:12,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:12,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:12,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-06-14 14:22:12,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:12,871 INFO L124 PetriNetUnfolderBase]: 2506/4632 cut-off events. [2024-06-14 14:22:12,871 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2024-06-14 14:22:12,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8712 conditions, 4632 events. 2506/4632 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 34488 event pairs, 2506 based on Foata normal form. 2/4403 useless extension candidates. Maximal degree in co-relation 3684. Up to 3687 conditions per place. [2024-06-14 14:22:12,902 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 22 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-06-14 14:22:12,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 184 flow [2024-06-14 14:22:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-14 14:22:12,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-14 14:22:12,904 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 128 flow. Second operand 3 states and 99 transitions. [2024-06-14 14:22:12,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 184 flow [2024-06-14 14:22:12,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:12,906 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 145 flow [2024-06-14 14:22:12,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-06-14 14:22:12,907 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2024-06-14 14:22:12,907 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 145 flow [2024-06-14 14:22:12,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:12,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:12,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:22:12,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:12,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1055035306, now seen corresponding path program 1 times [2024-06-14 14:22:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725848587] [2024-06-14 14:22:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725848587] [2024-06-14 14:22:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725848587] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063607117] [2024-06-14 14:22:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:13,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:13,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:13,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:13,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-14 14:22:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:13,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:13,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:13,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063607117] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651316719] [2024-06-14 14:22:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:13,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:13,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-14 14:22:13,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:13,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:13,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-14 14:22:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:14,159 INFO L124 PetriNetUnfolderBase]: 2013/3915 cut-off events. [2024-06-14 14:22:14,159 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2024-06-14 14:22:14,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 3915 events. 2013/3915 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 28833 event pairs, 2013 based on Foata normal form. 224/3991 useless extension candidates. Maximal degree in co-relation 7057. Up to 2834 conditions per place. [2024-06-14 14:22:14,179 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-14 14:22:14,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 248 flow [2024-06-14 14:22:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-14 14:22:14,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48846153846153845 [2024-06-14 14:22:14,180 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 145 flow. Second operand 4 states and 127 transitions. [2024-06-14 14:22:14,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 248 flow [2024-06-14 14:22:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:14,182 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 158 flow [2024-06-14 14:22:14,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2024-06-14 14:22:14,183 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2024-06-14 14:22:14,183 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 158 flow [2024-06-14 14:22:14,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:14,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:14,183 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:14,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:14,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-14 14:22:14,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:14,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -609729009, now seen corresponding path program 1 times [2024-06-14 14:22:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473982141] [2024-06-14 14:22:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473982141] [2024-06-14 14:22:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473982141] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536839508] [2024-06-14 14:22:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:14,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:14,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:14,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-14 14:22:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:14,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-14 14:22:14,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:14,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536839508] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-14 14:22:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60592934] [2024-06-14 14:22:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:22:15,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-14 14:22:15,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:15,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:15,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-14 14:22:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:15,757 INFO L124 PetriNetUnfolderBase]: 2489/4346 cut-off events. [2024-06-14 14:22:15,757 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2024-06-14 14:22:15,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8610 conditions, 4346 events. 2489/4346 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 30585 event pairs, 1253 based on Foata normal form. 14/4168 useless extension candidates. Maximal degree in co-relation 8207. Up to 3267 conditions per place. [2024-06-14 14:22:15,784 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-14 14:22:15,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 254 flow [2024-06-14 14:22:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-14 14:22:15,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-14 14:22:15,785 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 158 flow. Second operand 5 states and 150 transitions. [2024-06-14 14:22:15,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 254 flow [2024-06-14 14:22:15,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:15,789 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 175 flow [2024-06-14 14:22:15,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-06-14 14:22:15,790 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2024-06-14 14:22:15,791 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 175 flow [2024-06-14 14:22:15,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:15,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:15,791 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-06-14 14:22:15,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-14 14:22:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:15,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:15,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -725726691, now seen corresponding path program 1 times [2024-06-14 14:22:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112912098] [2024-06-14 14:22:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:16,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:16,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:16,031 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:16,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:16,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:16,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:16,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:16,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:22:16,032 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:16,032 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:16,032 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-14 14:22:16,052 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-06-14 14:22:16,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 262 flow [2024-06-14 14:22:16,306 INFO L124 PetriNetUnfolderBase]: 1817/3913 cut-off events. [2024-06-14 14:22:16,306 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2024-06-14 14:22:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 3913 events. 1817/3913 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 24919 event pairs, 313 based on Foata normal form. 0/3341 useless extension candidates. Maximal degree in co-relation 2890. Up to 1024 conditions per place. [2024-06-14 14:22:16,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 262 flow [2024-06-14 14:22:16,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 56 transitions, 168 flow [2024-06-14 14:22:16,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:16,321 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=false, 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;@3fb6f2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:16,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:16,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:16,322 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:16,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:16,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:16,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:16,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:16,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 568209, now seen corresponding path program 1 times [2024-06-14 14:22:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396109306] [2024-06-14 14:22:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:16,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396109306] [2024-06-14 14:22:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396109306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:16,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:16,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280406706] [2024-06-14 14:22:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:16,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:16,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2024-06-14 14:22:16,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:16,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:16,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2024-06-14 14:22:16,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:18,471 INFO L124 PetriNetUnfolderBase]: 14906/23768 cut-off events. [2024-06-14 14:22:18,471 INFO L125 PetriNetUnfolderBase]: For 5056/5056 co-relation queries the response was YES. [2024-06-14 14:22:18,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45658 conditions, 23768 events. 14906/23768 cut-off events. For 5056/5056 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 184609 event pairs, 14906 based on Foata normal form. 2/22795 useless extension candidates. Maximal degree in co-relation 19955. Up to 19831 conditions per place. [2024-06-14 14:22:18,633 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 26 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-06-14 14:22:18,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 232 flow [2024-06-14 14:22:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-14 14:22:18,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2024-06-14 14:22:18,634 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 168 flow. Second operand 3 states and 121 transitions. [2024-06-14 14:22:18,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 232 flow [2024-06-14 14:22:18,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 59 transitions, 220 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:18,639 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 177 flow [2024-06-14 14:22:18,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-06-14 14:22:18,640 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-06-14 14:22:18,640 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 177 flow [2024-06-14 14:22:18,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:18,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:18,641 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:18,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:22:18,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:18,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2026091409, now seen corresponding path program 1 times [2024-06-14 14:22:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700711054] [2024-06-14 14:22:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700711054] [2024-06-14 14:22:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700711054] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117249594] [2024-06-14 14:22:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:18,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:18,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:18,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:19,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-14 14:22:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:19,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:19,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:19,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117249594] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722011576] [2024-06-14 14:22:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:19,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:19,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:19,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-14 14:22:19,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:19,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:19,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-14 14:22:19,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:21,451 INFO L124 PetriNetUnfolderBase]: 11917/19819 cut-off events. [2024-06-14 14:22:21,451 INFO L125 PetriNetUnfolderBase]: For 5472/5472 co-relation queries the response was YES. [2024-06-14 14:22:21,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38178 conditions, 19819 events. 11917/19819 cut-off events. For 5472/5472 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 156678 event pairs, 11917 based on Foata normal form. 960/20223 useless extension candidates. Maximal degree in co-relation 37161. Up to 15530 conditions per place. [2024-06-14 14:22:21,571 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-14 14:22:21,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 301 flow [2024-06-14 14:22:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-06-14 14:22:21,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2024-06-14 14:22:21,572 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 177 flow. Second operand 4 states and 157 transitions. [2024-06-14 14:22:21,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 301 flow [2024-06-14 14:22:21,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:21,577 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 190 flow [2024-06-14 14:22:21,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-06-14 14:22:21,578 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-06-14 14:22:21,578 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 190 flow [2024-06-14 14:22:21,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:21,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:21,578 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:21,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-06-14 14:22:21,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:21,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:21,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1642496634, now seen corresponding path program 1 times [2024-06-14 14:22:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835140667] [2024-06-14 14:22:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:21,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835140667] [2024-06-14 14:22:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835140667] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191082670] [2024-06-14 14:22:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:21,981 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:21,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-14 14:22:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:22,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-14 14:22:22,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:22,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191082670] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:22,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-14 14:22:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544042381] [2024-06-14 14:22:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:22,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:22:22,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-14 14:22:22,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:22,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:22,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-14 14:22:22,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:24,896 INFO L124 PetriNetUnfolderBase]: 14857/22610 cut-off events. [2024-06-14 14:22:24,896 INFO L125 PetriNetUnfolderBase]: For 4566/4566 co-relation queries the response was YES. [2024-06-14 14:22:24,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44844 conditions, 22610 events. 14857/22610 cut-off events. For 4566/4566 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 165923 event pairs, 7517 based on Foata normal form. 30/21753 useless extension candidates. Maximal degree in co-relation 43887. Up to 18779 conditions per place. [2024-06-14 14:22:25,046 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-06-14 14:22:25,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 302 flow [2024-06-14 14:22:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-14 14:22:25,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708860759493671 [2024-06-14 14:22:25,048 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 190 flow. Second operand 5 states and 186 transitions. [2024-06-14 14:22:25,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 302 flow [2024-06-14 14:22:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:25,053 INFO L231 Difference]: Finished difference. Result has 82 places, 60 transitions, 207 flow [2024-06-14 14:22:25,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=82, PETRI_TRANSITIONS=60} [2024-06-14 14:22:25,054 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-06-14 14:22:25,054 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 60 transitions, 207 flow [2024-06-14 14:22:25,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:25,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:25,055 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:25,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-06-14 14:22:25,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-14 14:22:25,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:25,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1121837858, now seen corresponding path program 1 times [2024-06-14 14:22:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844435422] [2024-06-14 14:22:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:25,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:25,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:25,303 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:25,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:25,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:22:25,304 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:25,304 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:25,304 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-14 14:22:25,329 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-06-14 14:22:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 326 flow [2024-06-14 14:22:26,579 INFO L124 PetriNetUnfolderBase]: 9252/16852 cut-off events. [2024-06-14 14:22:26,579 INFO L125 PetriNetUnfolderBase]: For 10450/10450 co-relation queries the response was YES. [2024-06-14 14:22:26,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27243 conditions, 16852 events. 9252/16852 cut-off events. For 10450/10450 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 120116 event pairs, 2148 based on Foata normal form. 0/14720 useless extension candidates. Maximal degree in co-relation 12795. Up to 5120 conditions per place. [2024-06-14 14:22:26,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 93 transitions, 326 flow [2024-06-14 14:22:26,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 66 transitions, 212 flow [2024-06-14 14:22:26,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:26,646 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=false, 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;@3fb6f2ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:26,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:26,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:26,648 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:26,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:26,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:26,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:26,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:26,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 658572, now seen corresponding path program 1 times [2024-06-14 14:22:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654523412] [2024-06-14 14:22:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654523412] [2024-06-14 14:22:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654523412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:26,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:26,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896462683] [2024-06-14 14:22:26,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:26,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:26,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:26,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 93 [2024-06-14 14:22:26,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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) [2024-06-14 14:22:26,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:26,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 93 [2024-06-14 14:22:26,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:38,924 INFO L124 PetriNetUnfolderBase]: 79802/115960 cut-off events. [2024-06-14 14:22:38,925 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-14 14:22:39,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226108 conditions, 115960 events. 79802/115960 cut-off events. For 34688/34688 co-relation queries the response was YES. Maximal size of possible extension queue 3208. Compared 915222 event pairs, 79802 based on Foata normal form. 2/111963 useless extension candidates. Maximal degree in co-relation 102019. Up to 99895 conditions per place. [2024-06-14 14:22:40,512 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-06-14 14:22:40,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 284 flow [2024-06-14 14:22:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-14 14:22:40,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-06-14 14:22:40,514 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 212 flow. Second operand 3 states and 143 transitions. [2024-06-14 14:22:40,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 284 flow [2024-06-14 14:22:40,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 260 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:40,534 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 209 flow [2024-06-14 14:22:40,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2024-06-14 14:22:40,535 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2024-06-14 14:22:40,535 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 209 flow [2024-06-14 14:22:40,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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) [2024-06-14 14:22:40,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:40,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:22:40,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:40,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1762950590, now seen corresponding path program 1 times [2024-06-14 14:22:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966407102] [2024-06-14 14:22:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966407102] [2024-06-14 14:22:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966407102] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882878772] [2024-06-14 14:22:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:40,757 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 14:22:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-14 14:22:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:40,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:40,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:41,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882878772] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056375711] [2024-06-14 14:22:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:41,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:41,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2024-06-14 14:22:41,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:41,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2024-06-14 14:22:41,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand