./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/weaver/chl-collitem-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-subst.wvr.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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:20,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:20,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:20,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:20,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:20,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:20,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:20,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:20,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:20,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:20,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:20,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:20,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:20,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:20,256 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:20,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:20,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:20,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:20,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:20,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:20,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:20,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:20,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:20,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:20,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:20,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:20,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:20,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:20,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:20,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:20,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:20,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:20,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:20,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:20,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:20,271 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:20,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:20,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:20,272 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 [2024-01-29 22:56:20,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:20,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:20,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:20,540 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:20,540 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:20,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-subst.wvr.yml/witness.yml [2024-01-29 22:56:20,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:20,637 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:20,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-01-29 22:56:21,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:21,847 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:21,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-01-29 22:56:21,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dcc1ce2/692a8ea4d45647759b2037d7483e5e96/FLAG6a3a73ce5 [2024-01-29 22:56:21,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dcc1ce2/692a8ea4d45647759b2037d7483e5e96 [2024-01-29 22:56:21,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:21,871 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:21,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:21,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:21,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:21,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:20" (1/2) ... [2024-01-29 22:56:21,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2732834d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:21, skipping insertion in model container [2024-01-29 22:56:21,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:20" (1/2) ... [2024-01-29 22:56:21,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fe06bcf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:21, skipping insertion in model container [2024-01-29 22:56:21,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:21" (2/2) ... [2024-01-29 22:56:21,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2732834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:21, skipping insertion in model container [2024-01-29 22:56:21,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:21" (2/2) ... [2024-01-29 22:56:21,881 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:21,917 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:21,918 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (cardRarity_5 == 0) && (cardId_6 == 0) [2024-01-29 22:56:21,918 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,918 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:21,919 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_5 == 0 [2024-01-29 22:56:21,919 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,919 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,919 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardType_7 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,920 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardType_3 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:21,921 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (cardRarity_1 == 0) && (cardId_2 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_1 == 0 [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardId_2 == 0)) && (cardSet_4 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((cardId_6 == 0) && (cardType_7 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (cardId_6 == 0) && (cardType_7 == 0) [2024-01-29 22:56:21,922 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((cardId_6 == 0) && (cardType_7 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardType_11 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardType_11 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((cardId_6 == 0) && (cardType_7 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardType_11 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_6 == 0 [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,923 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,924 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] b <= -1 [2024-01-29 22:56:21,924 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] (b <= -1) && (b != 0) [2024-01-29 22:56:21,925 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardSet_8 == 0) [2024-01-29 22:56:21,925 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_3 == 0 [2024-01-29 22:56:21,925 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,925 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,925 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardSet_4 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardType_7 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardId_6 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardSet_8 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,926 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardRarity_5 == 0) [2024-01-29 22:56:21,927 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,927 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:21,927 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,927 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,927 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,928 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_2 == 0 [2024-01-29 22:56:21,928 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (cardId_2 == 0) && (cardType_3 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:21,929 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0)) && (cardRarity_5 == 0)) && (cardRarity_9 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (result_13 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_7 == 0 [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (result_13 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardId_10 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardRarity_9 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardType_11 == 0) [2024-01-29 22:56:21,930 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardSet_8 == 0) [2024-01-29 22:56:21,931 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (result_12 == 0) [2024-01-29 22:56:21,931 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,931 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,932 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,932 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((cardRarity_9 == 0) && (cardId_10 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,935 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (cardRarity_9 == 0) && (cardId_10 == 0) [2024-01-29 22:56:21,935 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((cardRarity_9 == 0) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,935 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((cardRarity_9 == 0) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,935 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((cardRarity_9 == 0) && (cardId_10 == 0)) && (cardType_11 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardRarity_9 == 0 [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((cardSet_8 == 0) && (cardId_10 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((cardSet_8 == 0) && (cardId_10 == 0)) && (result_12 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (cardSet_8 == 0) && (cardId_10 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardSet_8 == 0 [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((cardSet_8 == 0) && (cardId_10 == 0)) && (result_12 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((cardSet_8 == 0) && (cardId_10 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,936 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (cardSet_8 == 0) && (cardRarity_9 == 0) [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] cardType_11 == 0 [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (cardType_11 == 0) && (result_12 == 0) [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (cardType_11 == 0) && (result_14 == 0) [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (cardType_11 == 0) && (result_13 == 0) [2024-01-29 22:56:21,937 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (cardSet_0 == 0) && (cardRarity_1 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,938 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_0 == 0 [2024-01-29 22:56:21,939 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:21,939 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:21,939 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,940 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:21,940 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0) [2024-01-29 22:56:21,941 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_3 == 0) [2024-01-29 22:56:21,941 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardType_7 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,941 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_12 == 0 [2024-01-29 22:56:21,941 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (result_12 == 0) && (result_13 == 0) [2024-01-29 22:56:21,942 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (result_12 == 0) && (result_14 == 0) [2024-01-29 22:56:21,942 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 22:56:21,942 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cardType_11 == 0 [2024-01-29 22:56:21,942 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (cardType_11 == 0) && (result_13 == 0) [2024-01-29 22:56:21,942 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (cardType_11 == 0) && (result_14 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (cardType_11 == 0) && (result_12 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardRarity_5 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (result_14 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (result_12 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (result_13 == 0) [2024-01-29 22:56:21,943 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((cardSet_4 == 0) && (cardRarity_5 == 0)) && (cardSet_8 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_4 == 0 [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (result_14 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardId_10 == 0 [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (cardType_11 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (result_12 == 0) [2024-01-29 22:56:21,944 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (result_13 == 0) [2024-01-29 22:56:21,945 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] 1 <= b [2024-01-29 22:56:21,945 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] (1 <= b) && (b != 0) [2024-01-29 22:56:21,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:22,096 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c[3583,3596] [2024-01-29 22:56:22,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:22,108 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:56:22,125 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:22,202 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c[3583,3596] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:22,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:22,217 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:22,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22 WrapperNode [2024-01-29 22:56:22,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:22,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:22,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:22,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:22,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,270 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 544 [2024-01-29 22:56:22,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:22,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:22,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:22,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:22,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,315 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 22:56:22,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:22,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:22,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:22,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:22,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:22,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:22,390 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-01-29 22:56:22,409 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-01-29 22:56:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:22,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:22,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:22,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:22,446 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:22,547 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:22,549 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:23,274 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:23,275 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:24,253 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:24,254 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:56:24,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:24 BoogieIcfgContainer [2024-01-29 22:56:24,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:24,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:24,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:24,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:24,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:20" (1/4) ... [2024-01-29 22:56:24,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789a35c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:21" (2/4) ... [2024-01-29 22:56:24,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789a35c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22" (3/4) ... [2024-01-29 22:56:24,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789a35c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:24" (4/4) ... [2024-01-29 22:56:24,264 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2024-01-29 22:56:24,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:24,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 178 error locations. [2024-01-29 22:56:24,278 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:24,572 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:56:24,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 22:56:24,697 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2024-01-29 22:56:24,697 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:24,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 321 events. 0/321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 572 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-29 22:56:24,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 22:56:24,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 320 transitions, 658 flow [2024-01-29 22:56:24,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:24,717 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;@70c4dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:24,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 241 error locations. [2024-01-29 22:56:24,719 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:24,719 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:24,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:24,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:24,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:24,720 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:24,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 66742, now seen corresponding path program 1 times [2024-01-29 22:56:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166291819] [2024-01-29 22:56:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166291819] [2024-01-29 22:56:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166291819] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105317074] [2024-01-29 22:56:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:24,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:24,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:25,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:25,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 320 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:25,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:25,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:25,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:25,392 INFO L124 PetriNetUnfolderBase]: 279/741 cut-off events. [2024-01-29 22:56:25,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:25,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 741 events. 279/741 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3315 event pairs, 279 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 995. Up to 465 conditions per place. [2024-01-29 22:56:25,399 INFO L140 encePairwiseOnDemand]: 270/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-01-29 22:56:25,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 255 transitions, 587 flow [2024-01-29 22:56:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2024-01-29 22:56:25,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7921810699588477 [2024-01-29 22:56:25,412 INFO L175 Difference]: Start difference. First operand has 330 places, 320 transitions, 658 flow. Second operand 3 states and 770 transitions. [2024-01-29 22:56:25,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 255 transitions, 587 flow [2024-01-29 22:56:25,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 255 transitions, 584 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:25,420 INFO L231 Difference]: Finished difference. Result has 264 places, 255 transitions, 520 flow [2024-01-29 22:56:25,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2024-01-29 22:56:25,424 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -66 predicate places. [2024-01-29 22:56:25,424 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 520 flow [2024-01-29 22:56:25,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:25,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:25,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:25,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:25,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:25,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2070920, now seen corresponding path program 1 times [2024-01-29 22:56:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:25,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907776123] [2024-01-29 22:56:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907776123] [2024-01-29 22:56:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907776123] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:25,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779851095] [2024-01-29 22:56:25,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:25,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:25,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:25,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:25,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:25,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:25,767 INFO L124 PetriNetUnfolderBase]: 279/740 cut-off events. [2024-01-29 22:56:25,767 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:25,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 740 events. 279/740 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3329 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1217. Up to 463 conditions per place. [2024-01-29 22:56:25,773 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-01-29 22:56:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 254 transitions, 582 flow [2024-01-29 22:56:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:25,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:25,775 INFO L175 Difference]: Start difference. First operand has 264 places, 255 transitions, 520 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:25,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 254 transitions, 582 flow [2024-01-29 22:56:25,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 254 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:25,782 INFO L231 Difference]: Finished difference. Result has 263 places, 254 transitions, 518 flow [2024-01-29 22:56:25,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=263, PETRI_TRANSITIONS=254} [2024-01-29 22:56:25,783 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -67 predicate places. [2024-01-29 22:56:25,783 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 254 transitions, 518 flow [2024-01-29 22:56:25,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:25,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:25,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:25,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:25,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:25,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 64200518, now seen corresponding path program 1 times [2024-01-29 22:56:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948045614] [2024-01-29 22:56:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948045614] [2024-01-29 22:56:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948045614] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:25,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:25,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706133737] [2024-01-29 22:56:25,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:25,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:25,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:25,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:25,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:25,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:25,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:25,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:25,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,080 INFO L124 PetriNetUnfolderBase]: 279/739 cut-off events. [2024-01-29 22:56:26,080 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 739 events. 279/739 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3350 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1218. Up to 464 conditions per place. [2024-01-29 22:56:26,084 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-01-29 22:56:26,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 253 transitions, 582 flow [2024-01-29 22:56:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:26,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:26,086 INFO L175 Difference]: Start difference. First operand has 263 places, 254 transitions, 518 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:26,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 253 transitions, 582 flow [2024-01-29 22:56:26,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 253 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,089 INFO L231 Difference]: Finished difference. Result has 262 places, 253 transitions, 516 flow [2024-01-29 22:56:26,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=262, PETRI_TRANSITIONS=253} [2024-01-29 22:56:26,090 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -68 predicate places. [2024-01-29 22:56:26,090 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 253 transitions, 516 flow [2024-01-29 22:56:26,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:26,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:56:26,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:26,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:26,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1990218163, now seen corresponding path program 1 times [2024-01-29 22:56:26,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064393392] [2024-01-29 22:56:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064393392] [2024-01-29 22:56:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064393392] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296875138] [2024-01-29 22:56:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:26,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 253 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:26,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,346 INFO L124 PetriNetUnfolderBase]: 279/738 cut-off events. [2024-01-29 22:56:26,346 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 738 events. 279/738 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3387 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1217. Up to 463 conditions per place. [2024-01-29 22:56:26,350 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 22:56:26,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 578 flow [2024-01-29 22:56:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:26,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:26,352 INFO L175 Difference]: Start difference. First operand has 262 places, 253 transitions, 516 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:26,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 578 flow [2024-01-29 22:56:26,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 252 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,355 INFO L231 Difference]: Finished difference. Result has 261 places, 252 transitions, 514 flow [2024-01-29 22:56:26,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=261, PETRI_TRANSITIONS=252} [2024-01-29 22:56:26,357 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -69 predicate places. [2024-01-29 22:56:26,357 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 252 transitions, 514 flow [2024-01-29 22:56:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:56:26,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:26,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:26,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1567222948, now seen corresponding path program 1 times [2024-01-29 22:56:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465110082] [2024-01-29 22:56:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465110082] [2024-01-29 22:56:26,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465110082] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380105061] [2024-01-29 22:56:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:26,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:26,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,618 INFO L124 PetriNetUnfolderBase]: 279/736 cut-off events. [2024-01-29 22:56:26,618 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 736 events. 279/736 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3369 event pairs, 279 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1216. Up to 462 conditions per place. [2024-01-29 22:56:26,622 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-01-29 22:56:26,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 250 transitions, 572 flow [2024-01-29 22:56:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:26,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:26,624 INFO L175 Difference]: Start difference. First operand has 261 places, 252 transitions, 514 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 250 transitions, 572 flow [2024-01-29 22:56:26,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 250 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,628 INFO L231 Difference]: Finished difference. Result has 259 places, 250 transitions, 510 flow [2024-01-29 22:56:26,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=259, PETRI_TRANSITIONS=250} [2024-01-29 22:56:26,630 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -71 predicate places. [2024-01-29 22:56:26,630 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 250 transitions, 510 flow [2024-01-29 22:56:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:26,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:26,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205737, now seen corresponding path program 1 times [2024-01-29 22:56:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233242874] [2024-01-29 22:56:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233242874] [2024-01-29 22:56:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233242874] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465549710] [2024-01-29 22:56:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:26,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 250 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:26,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,901 INFO L124 PetriNetUnfolderBase]: 279/735 cut-off events. [2024-01-29 22:56:26,901 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 735 events. 279/735 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3370 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1217. Up to 463 conditions per place. [2024-01-29 22:56:26,904 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-01-29 22:56:26,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 249 transitions, 572 flow [2024-01-29 22:56:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:26,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:26,907 INFO L175 Difference]: Start difference. First operand has 259 places, 250 transitions, 510 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:26,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 249 transitions, 572 flow [2024-01-29 22:56:26,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 249 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,910 INFO L231 Difference]: Finished difference. Result has 258 places, 249 transitions, 508 flow [2024-01-29 22:56:26,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=258, PETRI_TRANSITIONS=249} [2024-01-29 22:56:26,913 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -72 predicate places. [2024-01-29 22:56:26,913 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 249 transitions, 508 flow [2024-01-29 22:56:26,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:26,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:26,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:26,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:26,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1960113356, now seen corresponding path program 1 times [2024-01-29 22:56:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334687385] [2024-01-29 22:56:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334687385] [2024-01-29 22:56:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334687385] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580895792] [2024-01-29 22:56:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:27,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 249 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:27,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:27,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,176 INFO L124 PetriNetUnfolderBase]: 279/734 cut-off events. [2024-01-29 22:56:27,176 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:27,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 734 events. 279/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3385 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1219. Up to 465 conditions per place. [2024-01-29 22:56:27,179 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-29 22:56:27,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 248 transitions, 574 flow [2024-01-29 22:56:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:27,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:27,181 INFO L175 Difference]: Start difference. First operand has 258 places, 249 transitions, 508 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 248 transitions, 574 flow [2024-01-29 22:56:27,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 248 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,184 INFO L231 Difference]: Finished difference. Result has 257 places, 248 transitions, 506 flow [2024-01-29 22:56:27,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=257, PETRI_TRANSITIONS=248} [2024-01-29 22:56:27,185 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -73 predicate places. [2024-01-29 22:56:27,185 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 248 transitions, 506 flow [2024-01-29 22:56:27,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:27,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:27,187 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:27,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash -633969820, now seen corresponding path program 1 times [2024-01-29 22:56:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402194108] [2024-01-29 22:56:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402194108] [2024-01-29 22:56:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402194108] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372454744] [2024-01-29 22:56:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:27,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:27,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,491 INFO L124 PetriNetUnfolderBase]: 279/733 cut-off events. [2024-01-29 22:56:27,491 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:27,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 733 events. 279/733 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3384 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1219. Up to 465 conditions per place. [2024-01-29 22:56:27,495 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2024-01-29 22:56:27,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 247 transitions, 572 flow [2024-01-29 22:56:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:27,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:27,497 INFO L175 Difference]: Start difference. First operand has 257 places, 248 transitions, 506 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 247 transitions, 572 flow [2024-01-29 22:56:27,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 247 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,500 INFO L231 Difference]: Finished difference. Result has 256 places, 247 transitions, 504 flow [2024-01-29 22:56:27,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=256, PETRI_TRANSITIONS=247} [2024-01-29 22:56:27,502 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -74 predicate places. [2024-01-29 22:56:27,502 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 247 transitions, 504 flow [2024-01-29 22:56:27,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:27,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:27,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:27,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1821774276, now seen corresponding path program 1 times [2024-01-29 22:56:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355914660] [2024-01-29 22:56:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355914660] [2024-01-29 22:56:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355914660] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435059286] [2024-01-29 22:56:27,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:27,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 247 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:27,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,743 INFO L124 PetriNetUnfolderBase]: 279/732 cut-off events. [2024-01-29 22:56:27,743 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 732 events. 279/732 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3383 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1217. Up to 463 conditions per place. [2024-01-29 22:56:27,746 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-01-29 22:56:27,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 246 transitions, 566 flow [2024-01-29 22:56:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:27,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:27,749 INFO L175 Difference]: Start difference. First operand has 256 places, 247 transitions, 504 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 246 transitions, 566 flow [2024-01-29 22:56:27,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 246 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,752 INFO L231 Difference]: Finished difference. Result has 255 places, 246 transitions, 502 flow [2024-01-29 22:56:27,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=255, PETRI_TRANSITIONS=246} [2024-01-29 22:56:27,753 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -75 predicate places. [2024-01-29 22:56:27,753 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 246 transitions, 502 flow [2024-01-29 22:56:27,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:27,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:27,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:27,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 640429774, now seen corresponding path program 1 times [2024-01-29 22:56:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365033510] [2024-01-29 22:56:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365033510] [2024-01-29 22:56:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365033510] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840958150] [2024-01-29 22:56:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:27,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 246 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:27,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,057 INFO L124 PetriNetUnfolderBase]: 279/731 cut-off events. [2024-01-29 22:56:28,057 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 731 events. 279/731 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3419 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1219. Up to 465 conditions per place. [2024-01-29 22:56:28,060 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 22:56:28,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 568 flow [2024-01-29 22:56:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:28,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:28,062 INFO L175 Difference]: Start difference. First operand has 255 places, 246 transitions, 502 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:28,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 568 flow [2024-01-29 22:56:28,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 245 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,066 INFO L231 Difference]: Finished difference. Result has 254 places, 245 transitions, 500 flow [2024-01-29 22:56:28,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=254, PETRI_TRANSITIONS=245} [2024-01-29 22:56:28,066 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -76 predicate places. [2024-01-29 22:56:28,067 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 245 transitions, 500 flow [2024-01-29 22:56:28,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:28,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:28,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1621511474, now seen corresponding path program 1 times [2024-01-29 22:56:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721907157] [2024-01-29 22:56:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721907157] [2024-01-29 22:56:28,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721907157] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015664510] [2024-01-29 22:56:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:28,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:28,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:28,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,318 INFO L124 PetriNetUnfolderBase]: 279/730 cut-off events. [2024-01-29 22:56:28,318 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 730 events. 279/730 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3388 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1219. Up to 465 conditions per place. [2024-01-29 22:56:28,321 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-01-29 22:56:28,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 244 transitions, 566 flow [2024-01-29 22:56:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:28,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:28,323 INFO L175 Difference]: Start difference. First operand has 254 places, 245 transitions, 500 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:28,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 244 transitions, 566 flow [2024-01-29 22:56:28,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 244 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,326 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 498 flow [2024-01-29 22:56:28,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=253, PETRI_TRANSITIONS=244} [2024-01-29 22:56:28,327 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -77 predicate places. [2024-01-29 22:56:28,327 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 498 flow [2024-01-29 22:56:28,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:28,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:28,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -949127277, now seen corresponding path program 1 times [2024-01-29 22:56:28,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061455829] [2024-01-29 22:56:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061455829] [2024-01-29 22:56:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061455829] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176889522] [2024-01-29 22:56:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:28,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:28,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:28,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,611 INFO L124 PetriNetUnfolderBase]: 279/726 cut-off events. [2024-01-29 22:56:28,611 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 726 events. 279/726 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3391 event pairs, 279 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 1215. Up to 463 conditions per place. [2024-01-29 22:56:28,614 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-29 22:56:28,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 240 transitions, 556 flow [2024-01-29 22:56:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:28,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:28,616 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 498 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:28,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 240 transitions, 556 flow [2024-01-29 22:56:28,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 240 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,619 INFO L231 Difference]: Finished difference. Result has 249 places, 240 transitions, 490 flow [2024-01-29 22:56:28,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=249, PETRI_TRANSITIONS=240} [2024-01-29 22:56:28,620 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -81 predicate places. [2024-01-29 22:56:28,620 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 240 transitions, 490 flow [2024-01-29 22:56:28,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:28,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:28,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1678823321, now seen corresponding path program 1 times [2024-01-29 22:56:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515754730] [2024-01-29 22:56:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515754730] [2024-01-29 22:56:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515754730] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361306914] [2024-01-29 22:56:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:28,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 240 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:28,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,876 INFO L124 PetriNetUnfolderBase]: 279/725 cut-off events. [2024-01-29 22:56:28,876 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 725 events. 279/725 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3382 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:28,883 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-01-29 22:56:28,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 239 transitions, 552 flow [2024-01-29 22:56:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:28,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:28,885 INFO L175 Difference]: Start difference. First operand has 249 places, 240 transitions, 490 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:28,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 239 transitions, 552 flow [2024-01-29 22:56:28,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 239 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,889 INFO L231 Difference]: Finished difference. Result has 248 places, 239 transitions, 488 flow [2024-01-29 22:56:28,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=248, PETRI_TRANSITIONS=239} [2024-01-29 22:56:28,890 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -82 predicate places. [2024-01-29 22:56:28,890 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 239 transitions, 488 flow [2024-01-29 22:56:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:28,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:28,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -503913445, now seen corresponding path program 1 times [2024-01-29 22:56:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904955399] [2024-01-29 22:56:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904955399] [2024-01-29 22:56:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904955399] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652033222] [2024-01-29 22:56:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:29,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 239 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:29,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:29,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,153 INFO L124 PetriNetUnfolderBase]: 279/724 cut-off events. [2024-01-29 22:56:29,153 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 724 events. 279/724 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3378 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:29,156 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 22:56:29,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 238 transitions, 552 flow [2024-01-29 22:56:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:29,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:29,158 INFO L175 Difference]: Start difference. First operand has 248 places, 239 transitions, 488 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:29,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 238 transitions, 552 flow [2024-01-29 22:56:29,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 238 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,161 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 486 flow [2024-01-29 22:56:29,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=247, PETRI_TRANSITIONS=238} [2024-01-29 22:56:29,161 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -83 predicate places. [2024-01-29 22:56:29,161 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 486 flow [2024-01-29 22:56:29,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:29,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:29,162 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1558554463, now seen corresponding path program 1 times [2024-01-29 22:56:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149029975] [2024-01-29 22:56:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149029975] [2024-01-29 22:56:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149029975] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219408665] [2024-01-29 22:56:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:29,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-29 22:56:29,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:29,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,429 INFO L124 PetriNetUnfolderBase]: 279/723 cut-off events. [2024-01-29 22:56:29,430 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 723 events. 279/723 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3365 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1190. Up to 464 conditions per place. [2024-01-29 22:56:29,432 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-01-29 22:56:29,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 237 transitions, 552 flow [2024-01-29 22:56:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:29,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:29,434 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 486 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:29,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 237 transitions, 552 flow [2024-01-29 22:56:29,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,436 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 484 flow [2024-01-29 22:56:29,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2024-01-29 22:56:29,437 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -84 predicate places. [2024-01-29 22:56:29,437 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 484 flow [2024-01-29 22:56:29,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-29 22:56:29,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:29,437 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1172677916, now seen corresponding path program 1 times [2024-01-29 22:56:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427052918] [2024-01-29 22:56:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427052918] [2024-01-29 22:56:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427052918] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831065088] [2024-01-29 22:56:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:29,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:29,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,722 INFO L124 PetriNetUnfolderBase]: 279/722 cut-off events. [2024-01-29 22:56:29,722 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 722 events. 279/722 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3335 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:29,725 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-01-29 22:56:29,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 236 transitions, 548 flow [2024-01-29 22:56:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:29,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:29,727 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 484 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:29,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 236 transitions, 548 flow [2024-01-29 22:56:29,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 236 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,730 INFO L231 Difference]: Finished difference. Result has 245 places, 236 transitions, 482 flow [2024-01-29 22:56:29,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=245, PETRI_TRANSITIONS=236} [2024-01-29 22:56:29,731 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -85 predicate places. [2024-01-29 22:56:29,731 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 236 transitions, 482 flow [2024-01-29 22:56:29,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:29,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:29,732 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1993274839, now seen corresponding path program 1 times [2024-01-29 22:56:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662467203] [2024-01-29 22:56:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662467203] [2024-01-29 22:56:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662467203] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782547744] [2024-01-29 22:56:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:29,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 236 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:29,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:29,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,991 INFO L124 PetriNetUnfolderBase]: 279/721 cut-off events. [2024-01-29 22:56:29,991 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 721 events. 279/721 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3350 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:29,994 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-01-29 22:56:29,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 235 transitions, 546 flow [2024-01-29 22:56:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:29,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:29,996 INFO L175 Difference]: Start difference. First operand has 245 places, 236 transitions, 482 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:29,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 235 transitions, 546 flow [2024-01-29 22:56:29,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 235 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,998 INFO L231 Difference]: Finished difference. Result has 244 places, 235 transitions, 480 flow [2024-01-29 22:56:29,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=244, PETRI_TRANSITIONS=235} [2024-01-29 22:56:29,999 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -86 predicate places. [2024-01-29 22:56:29,999 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 235 transitions, 480 flow [2024-01-29 22:56:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:30,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:30,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1661975657, now seen corresponding path program 1 times [2024-01-29 22:56:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119648927] [2024-01-29 22:56:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119648927] [2024-01-29 22:56:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119648927] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140566247] [2024-01-29 22:56:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:30,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 235 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:30,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,311 INFO L124 PetriNetUnfolderBase]: 279/720 cut-off events. [2024-01-29 22:56:30,312 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 720 events. 279/720 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3356 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:30,314 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-01-29 22:56:30,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 234 transitions, 544 flow [2024-01-29 22:56:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:30,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:30,316 INFO L175 Difference]: Start difference. First operand has 244 places, 235 transitions, 480 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 234 transitions, 544 flow [2024-01-29 22:56:30,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 234 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,318 INFO L231 Difference]: Finished difference. Result has 243 places, 234 transitions, 478 flow [2024-01-29 22:56:30,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=243, PETRI_TRANSITIONS=234} [2024-01-29 22:56:30,319 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -87 predicate places. [2024-01-29 22:56:30,319 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 234 transitions, 478 flow [2024-01-29 22:56:30,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:30,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:56:30,319 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 18364123, now seen corresponding path program 1 times [2024-01-29 22:56:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612305919] [2024-01-29 22:56:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612305919] [2024-01-29 22:56:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612305919] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018271837] [2024-01-29 22:56:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 234 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:30,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,554 INFO L124 PetriNetUnfolderBase]: 279/719 cut-off events. [2024-01-29 22:56:30,554 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 719 events. 279/719 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3352 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:30,557 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-01-29 22:56:30,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 233 transitions, 542 flow [2024-01-29 22:56:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:30,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:30,559 INFO L175 Difference]: Start difference. First operand has 243 places, 234 transitions, 478 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:30,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 233 transitions, 542 flow [2024-01-29 22:56:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 233 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,562 INFO L231 Difference]: Finished difference. Result has 242 places, 233 transitions, 476 flow [2024-01-29 22:56:30,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=242, PETRI_TRANSITIONS=233} [2024-01-29 22:56:30,562 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -88 predicate places. [2024-01-29 22:56:30,562 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 233 transitions, 476 flow [2024-01-29 22:56:30,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:30,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:56:30,563 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 569289920, now seen corresponding path program 1 times [2024-01-29 22:56:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523072261] [2024-01-29 22:56:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523072261] [2024-01-29 22:56:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523072261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768304774] [2024-01-29 22:56:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:30,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 233 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:30,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,821 INFO L124 PetriNetUnfolderBase]: 279/718 cut-off events. [2024-01-29 22:56:30,822 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 718 events. 279/718 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3337 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:30,824 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-01-29 22:56:30,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 232 transitions, 540 flow [2024-01-29 22:56:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:30,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:30,826 INFO L175 Difference]: Start difference. First operand has 242 places, 233 transitions, 476 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:30,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 232 transitions, 540 flow [2024-01-29 22:56:30,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 232 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,834 INFO L231 Difference]: Finished difference. Result has 241 places, 232 transitions, 474 flow [2024-01-29 22:56:30,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=241, PETRI_TRANSITIONS=232} [2024-01-29 22:56:30,835 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -89 predicate places. [2024-01-29 22:56:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 232 transitions, 474 flow [2024-01-29 22:56:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:30,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:56:30,836 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 468120527, now seen corresponding path program 1 times [2024-01-29 22:56:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685326479] [2024-01-29 22:56:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685326479] [2024-01-29 22:56:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685326479] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272708419] [2024-01-29 22:56:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:31,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 232 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-29 22:56:31,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,156 INFO L124 PetriNetUnfolderBase]: 279/716 cut-off events. [2024-01-29 22:56:31,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:31,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 716 events. 279/716 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3355 event pairs, 279 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:31,159 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-01-29 22:56:31,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 230 transitions, 536 flow [2024-01-29 22:56:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:31,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:31,161 INFO L175 Difference]: Start difference. First operand has 241 places, 232 transitions, 474 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:31,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 230 transitions, 536 flow [2024-01-29 22:56:31,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 230 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,163 INFO L231 Difference]: Finished difference. Result has 239 places, 230 transitions, 470 flow [2024-01-29 22:56:31,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=239, PETRI_TRANSITIONS=230} [2024-01-29 22:56:31,164 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -91 predicate places. [2024-01-29 22:56:31,164 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 230 transitions, 470 flow [2024-01-29 22:56:31,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-29 22:56:31,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:31,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:56:31,164 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1107672618, now seen corresponding path program 1 times [2024-01-29 22:56:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850150525] [2024-01-29 22:56:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850150525] [2024-01-29 22:56:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850150525] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645494410] [2024-01-29 22:56:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:31,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 230 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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-01-29 22:56:31,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:31,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,506 INFO L124 PetriNetUnfolderBase]: 279/710 cut-off events. [2024-01-29 22:56:31,506 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:31,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 710 events. 279/710 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3354 event pairs, 279 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 1190. Up to 468 conditions per place. [2024-01-29 22:56:31,509 INFO L140 encePairwiseOnDemand]: 316/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-01-29 22:56:31,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 224 transitions, 536 flow [2024-01-29 22:56:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-01-29 22:56:31,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2024-01-29 22:56:31,511 INFO L175 Difference]: Start difference. First operand has 239 places, 230 transitions, 470 flow. Second operand 3 states and 708 transitions. [2024-01-29 22:56:31,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 224 transitions, 536 flow [2024-01-29 22:56:31,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 224 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,513 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 458 flow [2024-01-29 22:56:31,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=233, PETRI_TRANSITIONS=224} [2024-01-29 22:56:31,514 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -97 predicate places. [2024-01-29 22:56:31,514 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 458 flow [2024-01-29 22:56:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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-01-29 22:56:31,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:31,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:56:31,514 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 21889407, now seen corresponding path program 1 times [2024-01-29 22:56:31,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095725193] [2024-01-29 22:56:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095725193] [2024-01-29 22:56:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095725193] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081875025] [2024-01-29 22:56:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:31,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:31,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:31,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,838 INFO L124 PetriNetUnfolderBase]: 279/709 cut-off events. [2024-01-29 22:56:31,838 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:31,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 709 events. 279/709 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3347 event pairs, 279 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 1168. Up to 468 conditions per place. [2024-01-29 22:56:31,841 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-01-29 22:56:31,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 223 transitions, 534 flow [2024-01-29 22:56:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:31,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:31,843 INFO L175 Difference]: Start difference. First operand has 233 places, 224 transitions, 458 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 223 transitions, 534 flow [2024-01-29 22:56:31,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 223 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,846 INFO L231 Difference]: Finished difference. Result has 232 places, 223 transitions, 456 flow [2024-01-29 22:56:31,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=232, PETRI_TRANSITIONS=223} [2024-01-29 22:56:31,846 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -98 predicate places. [2024-01-29 22:56:31,847 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 223 transitions, 456 flow [2024-01-29 22:56:31,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:31,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:31,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:56:31,847 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash 678573533, now seen corresponding path program 1 times [2024-01-29 22:56:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807719741] [2024-01-29 22:56:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807719741] [2024-01-29 22:56:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807719741] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846329769] [2024-01-29 22:56:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:32,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 223 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:32,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:32,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,153 INFO L124 PetriNetUnfolderBase]: 279/708 cut-off events. [2024-01-29 22:56:32,153 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 708 events. 279/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3348 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1167. Up to 467 conditions per place. [2024-01-29 22:56:32,159 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-01-29 22:56:32,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 222 transitions, 530 flow [2024-01-29 22:56:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-01-29 22:56:32,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7253086419753086 [2024-01-29 22:56:32,161 INFO L175 Difference]: Start difference. First operand has 232 places, 223 transitions, 456 flow. Second operand 3 states and 705 transitions. [2024-01-29 22:56:32,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 222 transitions, 530 flow [2024-01-29 22:56:32,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 222 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,163 INFO L231 Difference]: Finished difference. Result has 231 places, 222 transitions, 454 flow [2024-01-29 22:56:32,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=231, PETRI_TRANSITIONS=222} [2024-01-29 22:56:32,164 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -99 predicate places. [2024-01-29 22:56:32,164 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 222 transitions, 454 flow [2024-01-29 22:56:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:32,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:56:32,165 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1024959878, now seen corresponding path program 1 times [2024-01-29 22:56:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601386188] [2024-01-29 22:56:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601386188] [2024-01-29 22:56:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601386188] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253549015] [2024-01-29 22:56:32,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:32,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 222 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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-01-29 22:56:32,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,442 INFO L124 PetriNetUnfolderBase]: 279/707 cut-off events. [2024-01-29 22:56:32,443 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 707 events. 279/707 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3336 event pairs, 279 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 1169. Up to 469 conditions per place. [2024-01-29 22:56:32,446 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-01-29 22:56:32,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 221 transitions, 532 flow [2024-01-29 22:56:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 22:56:32,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7242798353909465 [2024-01-29 22:56:32,448 INFO L175 Difference]: Start difference. First operand has 231 places, 222 transitions, 454 flow. Second operand 3 states and 704 transitions. [2024-01-29 22:56:32,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 221 transitions, 532 flow [2024-01-29 22:56:32,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 221 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,450 INFO L231 Difference]: Finished difference. Result has 230 places, 221 transitions, 452 flow [2024-01-29 22:56:32,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=230, PETRI_TRANSITIONS=221} [2024-01-29 22:56:32,451 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -100 predicate places. [2024-01-29 22:56:32,451 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 221 transitions, 452 flow [2024-01-29 22:56:32,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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-01-29 22:56:32,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:56:32,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1708983123, now seen corresponding path program 1 times [2024-01-29 22:56:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733346127] [2024-01-29 22:56:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733346127] [2024-01-29 22:56:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733346127] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424881183] [2024-01-29 22:56:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 324 [2024-01-29 22:56:32,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-01-29 22:56:32,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 324 [2024-01-29 22:56:32,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,773 INFO L124 PetriNetUnfolderBase]: 279/706 cut-off events. [2024-01-29 22:56:32,773 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 706 events. 279/706 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3350 event pairs, 279 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1166. Up to 466 conditions per place. [2024-01-29 22:56:32,775 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-01-29 22:56:32,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 220 transitions, 524 flow [2024-01-29 22:56:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-29 22:56:32,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727366255144033 [2024-01-29 22:56:32,778 INFO L175 Difference]: Start difference. First operand has 230 places, 221 transitions, 452 flow. Second operand 3 states and 707 transitions. [2024-01-29 22:56:32,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 220 transitions, 524 flow [2024-01-29 22:56:32,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 220 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,780 INFO L231 Difference]: Finished difference. Result has 229 places, 220 transitions, 450 flow [2024-01-29 22:56:32,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=229, PETRI_TRANSITIONS=220} [2024-01-29 22:56:32,781 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -101 predicate places. [2024-01-29 22:56:32,781 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 220 transitions, 450 flow [2024-01-29 22:56:32,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-01-29 22:56:32,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:56:32,781 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1655207847, now seen corresponding path program 1 times [2024-01-29 22:56:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370027793] [2024-01-29 22:56:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370027793] [2024-01-29 22:56:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370027793] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635739782] [2024-01-29 22:56:32,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:32,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 220 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:32,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:32,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,076 INFO L124 PetriNetUnfolderBase]: 279/705 cut-off events. [2024-01-29 22:56:33,076 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 705 events. 279/705 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3347 event pairs, 279 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1167. Up to 467 conditions per place. [2024-01-29 22:56:33,079 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2024-01-29 22:56:33,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 219 transitions, 524 flow [2024-01-29 22:56:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-01-29 22:56:33,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7253086419753086 [2024-01-29 22:56:33,081 INFO L175 Difference]: Start difference. First operand has 229 places, 220 transitions, 450 flow. Second operand 3 states and 705 transitions. [2024-01-29 22:56:33,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 219 transitions, 524 flow [2024-01-29 22:56:33,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 219 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,083 INFO L231 Difference]: Finished difference. Result has 228 places, 219 transitions, 448 flow [2024-01-29 22:56:33,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=228, PETRI_TRANSITIONS=219} [2024-01-29 22:56:33,084 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -102 predicate places. [2024-01-29 22:56:33,084 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 219 transitions, 448 flow [2024-01-29 22:56:33,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:33,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:56:33,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 228166282, now seen corresponding path program 1 times [2024-01-29 22:56:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225079372] [2024-01-29 22:56:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225079372] [2024-01-29 22:56:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225079372] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430376084] [2024-01-29 22:56:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:33,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:33,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:33,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,370 INFO L124 PetriNetUnfolderBase]: 279/704 cut-off events. [2024-01-29 22:56:33,370 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 704 events. 279/704 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3340 event pairs, 279 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 1168. Up to 468 conditions per place. [2024-01-29 22:56:33,372 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2024-01-29 22:56:33,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 218 transitions, 524 flow [2024-01-29 22:56:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:33,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:33,374 INFO L175 Difference]: Start difference. First operand has 228 places, 219 transitions, 448 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:33,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 218 transitions, 524 flow [2024-01-29 22:56:33,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 218 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,376 INFO L231 Difference]: Finished difference. Result has 227 places, 218 transitions, 446 flow [2024-01-29 22:56:33,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=227, PETRI_TRANSITIONS=218} [2024-01-29 22:56:33,377 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -103 predicate places. [2024-01-29 22:56:33,377 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 218 transitions, 446 flow [2024-01-29 22:56:33,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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-01-29 22:56:33,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:56:33,377 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1516777679, now seen corresponding path program 1 times [2024-01-29 22:56:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017392269] [2024-01-29 22:56:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017392269] [2024-01-29 22:56:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017392269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943021285] [2024-01-29 22:56:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 324 [2024-01-29 22:56:33,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 218 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-01-29 22:56:33,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 324 [2024-01-29 22:56:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,695 INFO L124 PetriNetUnfolderBase]: 279/703 cut-off events. [2024-01-29 22:56:33,695 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 703 events. 279/703 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3332 event pairs, 279 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1166. Up to 466 conditions per place. [2024-01-29 22:56:33,697 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-01-29 22:56:33,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 217 transitions, 518 flow [2024-01-29 22:56:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-29 22:56:33,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727366255144033 [2024-01-29 22:56:33,699 INFO L175 Difference]: Start difference. First operand has 227 places, 218 transitions, 446 flow. Second operand 3 states and 707 transitions. [2024-01-29 22:56:33,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 217 transitions, 518 flow [2024-01-29 22:56:33,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 217 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,701 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 444 flow [2024-01-29 22:56:33,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2024-01-29 22:56:33,703 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -104 predicate places. [2024-01-29 22:56:33,703 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 444 flow [2024-01-29 22:56:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-01-29 22:56:33,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:56:33,704 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1029034697, now seen corresponding path program 1 times [2024-01-29 22:56:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538075053] [2024-01-29 22:56:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538075053] [2024-01-29 22:56:33,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538075053] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072276103] [2024-01-29 22:56:33,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 324 [2024-01-29 22:56:33,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:33,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 324 [2024-01-29 22:56:33,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,890 INFO L124 PetriNetUnfolderBase]: 279/701 cut-off events. [2024-01-29 22:56:33,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:33,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 701 events. 279/701 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3335 event pairs, 279 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1159. Up to 459 conditions per place. [2024-01-29 22:56:33,893 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-01-29 22:56:33,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 215 transitions, 520 flow [2024-01-29 22:56:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 22:56:33,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7345679012345679 [2024-01-29 22:56:33,895 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 444 flow. Second operand 3 states and 714 transitions. [2024-01-29 22:56:33,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 215 transitions, 520 flow [2024-01-29 22:56:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 215 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,897 INFO L231 Difference]: Finished difference. Result has 224 places, 215 transitions, 440 flow [2024-01-29 22:56:33,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=224, PETRI_TRANSITIONS=215} [2024-01-29 22:56:33,898 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -106 predicate places. [2024-01-29 22:56:33,898 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 215 transitions, 440 flow [2024-01-29 22:56:33,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:33,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:56:33,899 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1835306436, now seen corresponding path program 1 times [2024-01-29 22:56:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33203232] [2024-01-29 22:56:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33203232] [2024-01-29 22:56:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33203232] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692207777] [2024-01-29 22:56:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:34,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:34,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,124 INFO L124 PetriNetUnfolderBase]: 279/699 cut-off events. [2024-01-29 22:56:34,124 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 699 events. 279/699 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3299 event pairs, 279 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:34,127 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-01-29 22:56:34,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 213 transitions, 500 flow [2024-01-29 22:56:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:34,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:34,129 INFO L175 Difference]: Start difference. First operand has 224 places, 215 transitions, 440 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:34,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 213 transitions, 500 flow [2024-01-29 22:56:34,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 213 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,131 INFO L231 Difference]: Finished difference. Result has 222 places, 213 transitions, 436 flow [2024-01-29 22:56:34,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=222, PETRI_TRANSITIONS=213} [2024-01-29 22:56:34,132 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -108 predicate places. [2024-01-29 22:56:34,132 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 213 transitions, 436 flow [2024-01-29 22:56:34,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:34,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:56:34,133 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1059926843, now seen corresponding path program 1 times [2024-01-29 22:56:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999770638] [2024-01-29 22:56:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999770638] [2024-01-29 22:56:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999770638] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919094732] [2024-01-29 22:56:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:34,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 213 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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-01-29 22:56:34,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,342 INFO L124 PetriNetUnfolderBase]: 279/698 cut-off events. [2024-01-29 22:56:34,342 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 698 events. 279/698 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3332 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:34,344 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-01-29 22:56:34,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 212 transitions, 496 flow [2024-01-29 22:56:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:34,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:34,346 INFO L175 Difference]: Start difference. First operand has 222 places, 213 transitions, 436 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:34,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 212 transitions, 496 flow [2024-01-29 22:56:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 212 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,349 INFO L231 Difference]: Finished difference. Result has 221 places, 212 transitions, 434 flow [2024-01-29 22:56:34,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=221, PETRI_TRANSITIONS=212} [2024-01-29 22:56:34,349 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -109 predicate places. [2024-01-29 22:56:34,350 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 434 flow [2024-01-29 22:56:34,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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-01-29 22:56:34,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-01-29 22:56:34,350 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1502004110, now seen corresponding path program 1 times [2024-01-29 22:56:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217843774] [2024-01-29 22:56:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217843774] [2024-01-29 22:56:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217843774] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186861701] [2024-01-29 22:56:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:34,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 212 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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-01-29 22:56:34,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:34,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,532 INFO L124 PetriNetUnfolderBase]: 279/697 cut-off events. [2024-01-29 22:56:34,533 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 697 events. 279/697 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3312 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:34,535 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-01-29 22:56:34,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 211 transitions, 496 flow [2024-01-29 22:56:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:34,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:34,537 INFO L175 Difference]: Start difference. First operand has 221 places, 212 transitions, 434 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:34,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 211 transitions, 496 flow [2024-01-29 22:56:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 211 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,540 INFO L231 Difference]: Finished difference. Result has 220 places, 211 transitions, 432 flow [2024-01-29 22:56:34,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=220, PETRI_TRANSITIONS=211} [2024-01-29 22:56:34,540 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -110 predicate places. [2024-01-29 22:56:34,540 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 211 transitions, 432 flow [2024-01-29 22:56:34,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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-01-29 22:56:34,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-01-29 22:56:34,541 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 682515029, now seen corresponding path program 1 times [2024-01-29 22:56:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815329013] [2024-01-29 22:56:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815329013] [2024-01-29 22:56:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815329013] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985679852] [2024-01-29 22:56:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:34,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 211 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:34,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:34,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,760 INFO L124 PetriNetUnfolderBase]: 279/696 cut-off events. [2024-01-29 22:56:34,760 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 696 events. 279/696 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3316 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:34,763 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-01-29 22:56:34,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 210 transitions, 494 flow [2024-01-29 22:56:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:34,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:34,765 INFO L175 Difference]: Start difference. First operand has 220 places, 211 transitions, 432 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:34,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 210 transitions, 494 flow [2024-01-29 22:56:34,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 210 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,767 INFO L231 Difference]: Finished difference. Result has 219 places, 210 transitions, 430 flow [2024-01-29 22:56:34,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=219, PETRI_TRANSITIONS=210} [2024-01-29 22:56:34,768 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -111 predicate places. [2024-01-29 22:56:34,768 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 210 transitions, 430 flow [2024-01-29 22:56:34,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:34,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-01-29 22:56:34,769 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -316868676, now seen corresponding path program 1 times [2024-01-29 22:56:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571350387] [2024-01-29 22:56:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571350387] [2024-01-29 22:56:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571350387] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237095927] [2024-01-29 22:56:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:34,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 210 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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-01-29 22:56:34,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:34,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,960 INFO L124 PetriNetUnfolderBase]: 279/695 cut-off events. [2024-01-29 22:56:34,960 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 695 events. 279/695 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3313 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:34,963 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-01-29 22:56:34,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 209 transitions, 492 flow [2024-01-29 22:56:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:34,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:34,965 INFO L175 Difference]: Start difference. First operand has 219 places, 210 transitions, 430 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:34,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 209 transitions, 492 flow [2024-01-29 22:56:34,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,968 INFO L231 Difference]: Finished difference. Result has 218 places, 209 transitions, 428 flow [2024-01-29 22:56:34,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=218, PETRI_TRANSITIONS=209} [2024-01-29 22:56:34,968 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -112 predicate places. [2024-01-29 22:56:34,968 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 209 transitions, 428 flow [2024-01-29 22:56:34,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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-01-29 22:56:34,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-01-29 22:56:34,969 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1232992283, now seen corresponding path program 1 times [2024-01-29 22:56:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049644748] [2024-01-29 22:56:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049644748] [2024-01-29 22:56:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049644748] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373915543] [2024-01-29 22:56:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:35,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 209 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:35,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:35,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,190 INFO L124 PetriNetUnfolderBase]: 279/694 cut-off events. [2024-01-29 22:56:35,191 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 694 events. 279/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3318 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1137. Up to 461 conditions per place. [2024-01-29 22:56:35,193 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-01-29 22:56:35,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 208 transitions, 492 flow [2024-01-29 22:56:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:35,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:35,195 INFO L175 Difference]: Start difference. First operand has 218 places, 209 transitions, 428 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:35,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 208 transitions, 492 flow [2024-01-29 22:56:35,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 208 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,197 INFO L231 Difference]: Finished difference. Result has 217 places, 208 transitions, 426 flow [2024-01-29 22:56:35,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=217, PETRI_TRANSITIONS=208} [2024-01-29 22:56:35,198 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -113 predicate places. [2024-01-29 22:56:35,198 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 208 transitions, 426 flow [2024-01-29 22:56:35,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:35,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-01-29 22:56:35,199 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash 431947103, now seen corresponding path program 1 times [2024-01-29 22:56:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990824942] [2024-01-29 22:56:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990824942] [2024-01-29 22:56:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990824942] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674361332] [2024-01-29 22:56:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 324 [2024-01-29 22:56:35,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 208 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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-01-29 22:56:35,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 324 [2024-01-29 22:56:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,405 INFO L124 PetriNetUnfolderBase]: 279/693 cut-off events. [2024-01-29 22:56:35,405 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 693 events. 279/693 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3350 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:35,407 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 39 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-01-29 22:56:35,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 207 transitions, 506 flow [2024-01-29 22:56:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-01-29 22:56:35,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-01-29 22:56:35,409 INFO L175 Difference]: Start difference. First operand has 217 places, 208 transitions, 426 flow. Second operand 3 states and 711 transitions. [2024-01-29 22:56:35,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 207 transitions, 506 flow [2024-01-29 22:56:35,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 207 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,412 INFO L231 Difference]: Finished difference. Result has 216 places, 207 transitions, 424 flow [2024-01-29 22:56:35,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=216, PETRI_TRANSITIONS=207} [2024-01-29 22:56:35,412 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -114 predicate places. [2024-01-29 22:56:35,413 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 207 transitions, 424 flow [2024-01-29 22:56:35,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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-01-29 22:56:35,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-01-29 22:56:35,413 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 505460208, now seen corresponding path program 1 times [2024-01-29 22:56:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284069127] [2024-01-29 22:56:35,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284069127] [2024-01-29 22:56:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284069127] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544968813] [2024-01-29 22:56:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:35,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 207 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:35,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:35,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,674 INFO L124 PetriNetUnfolderBase]: 279/692 cut-off events. [2024-01-29 22:56:35,674 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 692 events. 279/692 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3266 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1137. Up to 461 conditions per place. [2024-01-29 22:56:35,677 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-01-29 22:56:35,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 206 transitions, 488 flow [2024-01-29 22:56:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:35,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:35,678 INFO L175 Difference]: Start difference. First operand has 216 places, 207 transitions, 424 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:35,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 206 transitions, 488 flow [2024-01-29 22:56:35,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,681 INFO L231 Difference]: Finished difference. Result has 215 places, 206 transitions, 422 flow [2024-01-29 22:56:35,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2024-01-29 22:56:35,681 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -115 predicate places. [2024-01-29 22:56:35,681 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 422 flow [2024-01-29 22:56:35,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-01-29 22:56:35,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-01-29 22:56:35,682 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1510600747, now seen corresponding path program 1 times [2024-01-29 22:56:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706919134] [2024-01-29 22:56:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706919134] [2024-01-29 22:56:35,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706919134] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929833298] [2024-01-29 22:56:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:35,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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-01-29 22:56:35,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:35,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,951 INFO L124 PetriNetUnfolderBase]: 279/691 cut-off events. [2024-01-29 22:56:35,951 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 691 events. 279/691 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3334 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:35,954 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2024-01-29 22:56:35,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 205 transitions, 482 flow [2024-01-29 22:56:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:35,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:35,955 INFO L175 Difference]: Start difference. First operand has 215 places, 206 transitions, 422 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:35,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 205 transitions, 482 flow [2024-01-29 22:56:35,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 205 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,959 INFO L231 Difference]: Finished difference. Result has 214 places, 205 transitions, 420 flow [2024-01-29 22:56:35,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=214, PETRI_TRANSITIONS=205} [2024-01-29 22:56:35,959 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -116 predicate places. [2024-01-29 22:56:35,959 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 205 transitions, 420 flow [2024-01-29 22:56:35,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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-01-29 22:56:35,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-01-29 22:56:35,961 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 362454384, now seen corresponding path program 1 times [2024-01-29 22:56:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435555368] [2024-01-29 22:56:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435555368] [2024-01-29 22:56:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435555368] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647718708] [2024-01-29 22:56:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 324 [2024-01-29 22:56:36,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 205 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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-01-29 22:56:36,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 324 [2024-01-29 22:56:36,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,126 INFO L124 PetriNetUnfolderBase]: 279/690 cut-off events. [2024-01-29 22:56:36,126 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 690 events. 279/690 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3297 event pairs, 279 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 1143. Up to 457 conditions per place. [2024-01-29 22:56:36,128 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 59 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-01-29 22:56:36,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 204 transitions, 540 flow [2024-01-29 22:56:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2024-01-29 22:56:36,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6934156378600823 [2024-01-29 22:56:36,130 INFO L175 Difference]: Start difference. First operand has 214 places, 205 transitions, 420 flow. Second operand 3 states and 674 transitions. [2024-01-29 22:56:36,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 204 transitions, 540 flow [2024-01-29 22:56:36,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 204 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,133 INFO L231 Difference]: Finished difference. Result has 213 places, 204 transitions, 418 flow [2024-01-29 22:56:36,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=213, PETRI_TRANSITIONS=204} [2024-01-29 22:56:36,133 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -117 predicate places. [2024-01-29 22:56:36,133 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 204 transitions, 418 flow [2024-01-29 22:56:36,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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-01-29 22:56:36,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-01-29 22:56:36,134 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1648814074, now seen corresponding path program 1 times [2024-01-29 22:56:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908654821] [2024-01-29 22:56:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908654821] [2024-01-29 22:56:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908654821] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857144072] [2024-01-29 22:56:36,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:36,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 204 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:36,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:36,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,409 INFO L124 PetriNetUnfolderBase]: 279/687 cut-off events. [2024-01-29 22:56:36,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 687 events. 279/687 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3310 event pairs, 279 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1115. Up to 461 conditions per place. [2024-01-29 22:56:36,411 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2024-01-29 22:56:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 201 transitions, 480 flow [2024-01-29 22:56:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:36,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:36,413 INFO L175 Difference]: Start difference. First operand has 213 places, 204 transitions, 418 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:36,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 201 transitions, 480 flow [2024-01-29 22:56:36,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 201 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,415 INFO L231 Difference]: Finished difference. Result has 210 places, 201 transitions, 412 flow [2024-01-29 22:56:36,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=210, PETRI_TRANSITIONS=201} [2024-01-29 22:56:36,416 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -120 predicate places. [2024-01-29 22:56:36,416 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 201 transitions, 412 flow [2024-01-29 22:56:36,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:36,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-01-29 22:56:36,417 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 426373468, now seen corresponding path program 1 times [2024-01-29 22:56:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403598922] [2024-01-29 22:56:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403598922] [2024-01-29 22:56:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403598922] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922157128] [2024-01-29 22:56:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:36,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 201 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 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-01-29 22:56:36,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:36,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,682 INFO L124 PetriNetUnfolderBase]: 279/686 cut-off events. [2024-01-29 22:56:36,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 686 events. 279/686 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3287 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1113. Up to 459 conditions per place. [2024-01-29 22:56:36,684 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-01-29 22:56:36,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 200 transitions, 476 flow [2024-01-29 22:56:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:36,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:36,686 INFO L175 Difference]: Start difference. First operand has 210 places, 201 transitions, 412 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:36,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 200 transitions, 476 flow [2024-01-29 22:56:36,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 200 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,688 INFO L231 Difference]: Finished difference. Result has 209 places, 200 transitions, 410 flow [2024-01-29 22:56:36,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=209, PETRI_TRANSITIONS=200} [2024-01-29 22:56:36,689 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -121 predicate places. [2024-01-29 22:56:36,689 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 200 transitions, 410 flow [2024-01-29 22:56:36,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 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-01-29 22:56:36,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-01-29 22:56:36,690 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash 332677532, now seen corresponding path program 1 times [2024-01-29 22:56:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760140750] [2024-01-29 22:56:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760140750] [2024-01-29 22:56:36,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760140750] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566013469] [2024-01-29 22:56:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:36,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 200 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 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-01-29 22:56:36,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,933 INFO L124 PetriNetUnfolderBase]: 279/685 cut-off events. [2024-01-29 22:56:36,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 685 events. 279/685 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3286 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1114. Up to 460 conditions per place. [2024-01-29 22:56:36,936 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-01-29 22:56:36,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 199 transitions, 476 flow [2024-01-29 22:56:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:36,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:36,938 INFO L175 Difference]: Start difference. First operand has 209 places, 200 transitions, 410 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:36,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 199 transitions, 476 flow [2024-01-29 22:56:36,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 199 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,940 INFO L231 Difference]: Finished difference. Result has 208 places, 199 transitions, 408 flow [2024-01-29 22:56:36,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=208, PETRI_TRANSITIONS=199} [2024-01-29 22:56:36,942 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -122 predicate places. [2024-01-29 22:56:36,942 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 408 flow [2024-01-29 22:56:36,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 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-01-29 22:56:36,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-01-29 22:56:36,943 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1723070900, now seen corresponding path program 1 times [2024-01-29 22:56:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820670257] [2024-01-29 22:56:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820670257] [2024-01-29 22:56:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820670257] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677532239] [2024-01-29 22:56:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:37,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-01-29 22:56:37,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:37,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,243 INFO L124 PetriNetUnfolderBase]: 279/684 cut-off events. [2024-01-29 22:56:37,243 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 684 events. 279/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3276 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1113. Up to 459 conditions per place. [2024-01-29 22:56:37,246 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-01-29 22:56:37,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 198 transitions, 470 flow [2024-01-29 22:56:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:37,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:37,248 INFO L175 Difference]: Start difference. First operand has 208 places, 199 transitions, 408 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:37,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 198 transitions, 470 flow [2024-01-29 22:56:37,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 198 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,250 INFO L231 Difference]: Finished difference. Result has 207 places, 198 transitions, 406 flow [2024-01-29 22:56:37,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=207, PETRI_TRANSITIONS=198} [2024-01-29 22:56:37,251 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -123 predicate places. [2024-01-29 22:56:37,251 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 198 transitions, 406 flow [2024-01-29 22:56:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-01-29 22:56:37,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-01-29 22:56:37,264 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1875592439, now seen corresponding path program 1 times [2024-01-29 22:56:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827928406] [2024-01-29 22:56:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827928406] [2024-01-29 22:56:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827928406] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539345793] [2024-01-29 22:56:37,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:37,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:37,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:37,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,541 INFO L124 PetriNetUnfolderBase]: 279/683 cut-off events. [2024-01-29 22:56:37,542 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 683 events. 279/683 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3273 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1114. Up to 460 conditions per place. [2024-01-29 22:56:37,544 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-01-29 22:56:37,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 197 transitions, 470 flow [2024-01-29 22:56:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:37,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:37,545 INFO L175 Difference]: Start difference. First operand has 207 places, 198 transitions, 406 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:37,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 197 transitions, 470 flow [2024-01-29 22:56:37,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 197 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,548 INFO L231 Difference]: Finished difference. Result has 206 places, 197 transitions, 404 flow [2024-01-29 22:56:37,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=206, PETRI_TRANSITIONS=197} [2024-01-29 22:56:37,549 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -124 predicate places. [2024-01-29 22:56:37,549 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 197 transitions, 404 flow [2024-01-29 22:56:37,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:37,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-01-29 22:56:37,550 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1986174375, now seen corresponding path program 1 times [2024-01-29 22:56:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562721389] [2024-01-29 22:56:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562721389] [2024-01-29 22:56:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562721389] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007938100] [2024-01-29 22:56:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:37,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-01-29 22:56:37,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,827 INFO L124 PetriNetUnfolderBase]: 279/682 cut-off events. [2024-01-29 22:56:37,828 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 682 events. 279/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3262 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1113. Up to 459 conditions per place. [2024-01-29 22:56:37,831 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-01-29 22:56:37,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 196 transitions, 466 flow [2024-01-29 22:56:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:37,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:37,833 INFO L175 Difference]: Start difference. First operand has 206 places, 197 transitions, 404 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:37,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 196 transitions, 466 flow [2024-01-29 22:56:37,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 196 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,835 INFO L231 Difference]: Finished difference. Result has 205 places, 196 transitions, 402 flow [2024-01-29 22:56:37,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=205, PETRI_TRANSITIONS=196} [2024-01-29 22:56:37,835 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -125 predicate places. [2024-01-29 22:56:37,836 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 196 transitions, 402 flow [2024-01-29 22:56:37,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-01-29 22:56:37,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-01-29 22:56:37,836 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1441861384, now seen corresponding path program 1 times [2024-01-29 22:56:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056939736] [2024-01-29 22:56:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056939736] [2024-01-29 22:56:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056939736] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080423839] [2024-01-29 22:56:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:38,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:38,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:38,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,097 INFO L124 PetriNetUnfolderBase]: 279/681 cut-off events. [2024-01-29 22:56:38,098 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 681 events. 279/681 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3280 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1114. Up to 460 conditions per place. [2024-01-29 22:56:38,100 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-01-29 22:56:38,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 195 transitions, 466 flow [2024-01-29 22:56:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:38,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:38,102 INFO L175 Difference]: Start difference. First operand has 205 places, 196 transitions, 402 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:38,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 195 transitions, 466 flow [2024-01-29 22:56:38,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 195 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,105 INFO L231 Difference]: Finished difference. Result has 204 places, 195 transitions, 400 flow [2024-01-29 22:56:38,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=204, PETRI_TRANSITIONS=195} [2024-01-29 22:56:38,105 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -126 predicate places. [2024-01-29 22:56:38,105 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 195 transitions, 400 flow [2024-01-29 22:56:38,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-01-29 22:56:38,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:38,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-01-29 22:56:38,106 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1645708517, now seen corresponding path program 1 times [2024-01-29 22:56:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293550043] [2024-01-29 22:56:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293550043] [2024-01-29 22:56:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293550043] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508454364] [2024-01-29 22:56:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:38,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:38,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,398 INFO L124 PetriNetUnfolderBase]: 279/680 cut-off events. [2024-01-29 22:56:38,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:38,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 680 events. 279/680 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3281 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1115. Up to 461 conditions per place. [2024-01-29 22:56:38,401 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-01-29 22:56:38,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 194 transitions, 466 flow [2024-01-29 22:56:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:38,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:38,403 INFO L175 Difference]: Start difference. First operand has 204 places, 195 transitions, 400 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:38,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 194 transitions, 466 flow [2024-01-29 22:56:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,405 INFO L231 Difference]: Finished difference. Result has 203 places, 194 transitions, 398 flow [2024-01-29 22:56:38,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=203, PETRI_TRANSITIONS=194} [2024-01-29 22:56:38,406 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -127 predicate places. [2024-01-29 22:56:38,406 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 194 transitions, 398 flow [2024-01-29 22:56:38,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-01-29 22:56:38,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:38,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-01-29 22:56:38,407 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash 977988913, now seen corresponding path program 1 times [2024-01-29 22:56:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22770425] [2024-01-29 22:56:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22770425] [2024-01-29 22:56:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22770425] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283527948] [2024-01-29 22:56:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:38,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:38,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:38,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,613 INFO L124 PetriNetUnfolderBase]: 279/677 cut-off events. [2024-01-29 22:56:38,614 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 677 events. 279/677 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3268 event pairs, 279 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1110. Up to 457 conditions per place. [2024-01-29 22:56:38,616 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-01-29 22:56:38,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 191 transitions, 454 flow [2024-01-29 22:56:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 22:56:38,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7510288065843621 [2024-01-29 22:56:38,617 INFO L175 Difference]: Start difference. First operand has 203 places, 194 transitions, 398 flow. Second operand 3 states and 730 transitions. [2024-01-29 22:56:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 191 transitions, 454 flow [2024-01-29 22:56:38,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 191 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,619 INFO L231 Difference]: Finished difference. Result has 200 places, 191 transitions, 392 flow [2024-01-29 22:56:38,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=200, PETRI_TRANSITIONS=191} [2024-01-29 22:56:38,620 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -130 predicate places. [2024-01-29 22:56:38,620 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 191 transitions, 392 flow [2024-01-29 22:56:38,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:38,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:38,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-01-29 22:56:38,621 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 252887189, now seen corresponding path program 1 times [2024-01-29 22:56:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103667453] [2024-01-29 22:56:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103667453] [2024-01-29 22:56:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103667453] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837568075] [2024-01-29 22:56:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:38,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 191 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:38,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:38,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,840 INFO L124 PetriNetUnfolderBase]: 279/676 cut-off events. [2024-01-29 22:56:38,840 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 676 events. 279/676 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3272 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1092. Up to 458 conditions per place. [2024-01-29 22:56:38,843 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-01-29 22:56:38,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 190 transitions, 454 flow [2024-01-29 22:56:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:38,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:38,844 INFO L175 Difference]: Start difference. First operand has 200 places, 191 transitions, 392 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:38,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 190 transitions, 454 flow [2024-01-29 22:56:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 190 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,847 INFO L231 Difference]: Finished difference. Result has 199 places, 190 transitions, 390 flow [2024-01-29 22:56:38,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=199, PETRI_TRANSITIONS=190} [2024-01-29 22:56:38,847 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -131 predicate places. [2024-01-29 22:56:38,847 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 190 transitions, 390 flow [2024-01-29 22:56:38,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:38,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:38,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-01-29 22:56:38,848 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -750429719, now seen corresponding path program 1 times [2024-01-29 22:56:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9594122] [2024-01-29 22:56:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9594122] [2024-01-29 22:56:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9594122] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147755804] [2024-01-29 22:56:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:39,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 190 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:39,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,068 INFO L124 PetriNetUnfolderBase]: 279/675 cut-off events. [2024-01-29 22:56:39,068 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 675 events. 279/675 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3267 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1092. Up to 458 conditions per place. [2024-01-29 22:56:39,070 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-01-29 22:56:39,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 189 transitions, 452 flow [2024-01-29 22:56:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:39,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:39,071 INFO L175 Difference]: Start difference. First operand has 199 places, 190 transitions, 390 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:39,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 189 transitions, 452 flow [2024-01-29 22:56:39,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 189 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,073 INFO L231 Difference]: Finished difference. Result has 198 places, 189 transitions, 388 flow [2024-01-29 22:56:39,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=198, PETRI_TRANSITIONS=189} [2024-01-29 22:56:39,074 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -132 predicate places. [2024-01-29 22:56:39,074 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 189 transitions, 388 flow [2024-01-29 22:56:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-01-29 22:56:39,074 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1788482790, now seen corresponding path program 1 times [2024-01-29 22:56:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468652226] [2024-01-29 22:56:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468652226] [2024-01-29 22:56:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468652226] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973193446] [2024-01-29 22:56:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:39,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 189 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:39,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,307 INFO L124 PetriNetUnfolderBase]: 279/674 cut-off events. [2024-01-29 22:56:39,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 674 events. 279/674 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3288 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1092. Up to 458 conditions per place. [2024-01-29 22:56:39,310 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2024-01-29 22:56:39,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 188 transitions, 450 flow [2024-01-29 22:56:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:39,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:39,311 INFO L175 Difference]: Start difference. First operand has 198 places, 189 transitions, 388 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:39,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 188 transitions, 450 flow [2024-01-29 22:56:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 188 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,313 INFO L231 Difference]: Finished difference. Result has 197 places, 188 transitions, 386 flow [2024-01-29 22:56:39,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=197, PETRI_TRANSITIONS=188} [2024-01-29 22:56:39,314 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -133 predicate places. [2024-01-29 22:56:39,314 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 188 transitions, 386 flow [2024-01-29 22:56:39,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-01-29 22:56:39,315 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 391610481, now seen corresponding path program 1 times [2024-01-29 22:56:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968573020] [2024-01-29 22:56:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968573020] [2024-01-29 22:56:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968573020] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506844495] [2024-01-29 22:56:39,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:39,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 188 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,550 INFO L124 PetriNetUnfolderBase]: 279/673 cut-off events. [2024-01-29 22:56:39,550 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 673 events. 279/673 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3285 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1092. Up to 458 conditions per place. [2024-01-29 22:56:39,552 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2024-01-29 22:56:39,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 187 transitions, 448 flow [2024-01-29 22:56:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:39,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:39,554 INFO L175 Difference]: Start difference. First operand has 197 places, 188 transitions, 386 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:39,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 187 transitions, 448 flow [2024-01-29 22:56:39,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,556 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 384 flow [2024-01-29 22:56:39,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2024-01-29 22:56:39,556 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -134 predicate places. [2024-01-29 22:56:39,557 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 384 flow [2024-01-29 22:56:39,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:39,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-01-29 22:56:39,557 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -744975051, now seen corresponding path program 1 times [2024-01-29 22:56:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145959403] [2024-01-29 22:56:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145959403] [2024-01-29 22:56:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145959403] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869607187] [2024-01-29 22:56:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:39,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:39,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:39,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,766 INFO L124 PetriNetUnfolderBase]: 279/672 cut-off events. [2024-01-29 22:56:39,766 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 672 events. 279/672 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3271 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1091. Up to 457 conditions per place. [2024-01-29 22:56:39,768 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2024-01-29 22:56:39,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 186 transitions, 444 flow [2024-01-29 22:56:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:39,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:39,770 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 384 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:39,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 186 transitions, 444 flow [2024-01-29 22:56:39,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,772 INFO L231 Difference]: Finished difference. Result has 195 places, 186 transitions, 382 flow [2024-01-29 22:56:39,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=195, PETRI_TRANSITIONS=186} [2024-01-29 22:56:39,773 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -135 predicate places. [2024-01-29 22:56:39,773 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 186 transitions, 382 flow [2024-01-29 22:56:39,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:39,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-01-29 22:56:39,774 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1338584810, now seen corresponding path program 1 times [2024-01-29 22:56:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726664223] [2024-01-29 22:56:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726664223] [2024-01-29 22:56:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726664223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105998839] [2024-01-29 22:56:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:39,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 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-01-29 22:56:39,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:39,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,997 INFO L124 PetriNetUnfolderBase]: 279/671 cut-off events. [2024-01-29 22:56:39,997 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 671 events. 279/671 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3270 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1093. Up to 459 conditions per place. [2024-01-29 22:56:39,999 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2024-01-29 22:56:39,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 185 transitions, 446 flow [2024-01-29 22:56:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:40,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:40,000 INFO L175 Difference]: Start difference. First operand has 195 places, 186 transitions, 382 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:40,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 185 transitions, 446 flow [2024-01-29 22:56:40,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 185 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,002 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 380 flow [2024-01-29 22:56:40,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2024-01-29 22:56:40,003 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -136 predicate places. [2024-01-29 22:56:40,003 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 380 flow [2024-01-29 22:56:40,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 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-01-29 22:56:40,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-01-29 22:56:40,003 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1453541735, now seen corresponding path program 1 times [2024-01-29 22:56:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957283314] [2024-01-29 22:56:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957283314] [2024-01-29 22:56:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957283314] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943895466] [2024-01-29 22:56:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:40,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:40,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,209 INFO L124 PetriNetUnfolderBase]: 279/670 cut-off events. [2024-01-29 22:56:40,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:40,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 670 events. 279/670 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3295 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1092. Up to 458 conditions per place. [2024-01-29 22:56:40,211 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2024-01-29 22:56:40,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 184 transitions, 442 flow [2024-01-29 22:56:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:40,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:40,212 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 380 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:40,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 184 transitions, 442 flow [2024-01-29 22:56:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 184 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,214 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 378 flow [2024-01-29 22:56:40,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2024-01-29 22:56:40,215 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -137 predicate places. [2024-01-29 22:56:40,215 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 378 flow [2024-01-29 22:56:40,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:40,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-01-29 22:56:40,215 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash -989166565, now seen corresponding path program 1 times [2024-01-29 22:56:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226743563] [2024-01-29 22:56:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226743563] [2024-01-29 22:56:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226743563] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163519117] [2024-01-29 22:56:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 324 [2024-01-29 22:56:40,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 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-01-29 22:56:40,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 324 [2024-01-29 22:56:40,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,350 INFO L124 PetriNetUnfolderBase]: 279/669 cut-off events. [2024-01-29 22:56:40,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:40,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 669 events. 279/669 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3258 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1097. Up to 455 conditions per place. [2024-01-29 22:56:40,352 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 48 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2024-01-29 22:56:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 183 transitions, 476 flow [2024-01-29 22:56:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-29 22:56:40,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-01-29 22:56:40,354 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 378 flow. Second operand 3 states and 696 transitions. [2024-01-29 22:56:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 183 transitions, 476 flow [2024-01-29 22:56:40,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 183 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,356 INFO L231 Difference]: Finished difference. Result has 192 places, 183 transitions, 376 flow [2024-01-29 22:56:40,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=192, PETRI_TRANSITIONS=183} [2024-01-29 22:56:40,356 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -138 predicate places. [2024-01-29 22:56:40,356 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 183 transitions, 376 flow [2024-01-29 22:56:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 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-01-29 22:56:40,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-01-29 22:56:40,357 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash -599390412, now seen corresponding path program 1 times [2024-01-29 22:56:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662879263] [2024-01-29 22:56:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662879263] [2024-01-29 22:56:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662879263] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380499404] [2024-01-29 22:56:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:40,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:40,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,640 INFO L124 PetriNetUnfolderBase]: 279/667 cut-off events. [2024-01-29 22:56:40,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 667 events. 279/667 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3270 event pairs, 279 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1074. Up to 458 conditions per place. [2024-01-29 22:56:40,643 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2024-01-29 22:56:40,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 181 transitions, 438 flow [2024-01-29 22:56:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:40,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7458847736625515 [2024-01-29 22:56:40,644 INFO L175 Difference]: Start difference. First operand has 192 places, 183 transitions, 376 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 181 transitions, 438 flow [2024-01-29 22:56:40,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 181 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,646 INFO L231 Difference]: Finished difference. Result has 190 places, 181 transitions, 372 flow [2024-01-29 22:56:40,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=190, PETRI_TRANSITIONS=181} [2024-01-29 22:56:40,647 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -140 predicate places. [2024-01-29 22:56:40,647 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 181 transitions, 372 flow [2024-01-29 22:56:40,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:40,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-01-29 22:56:40,648 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1401231666, now seen corresponding path program 1 times [2024-01-29 22:56:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774172413] [2024-01-29 22:56:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774172413] [2024-01-29 22:56:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774172413] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019328625] [2024-01-29 22:56:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:40,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 181 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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-01-29 22:56:40,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:40,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,910 INFO L124 PetriNetUnfolderBase]: 279/665 cut-off events. [2024-01-29 22:56:40,910 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 665 events. 279/665 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3266 event pairs, 279 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1076. Up to 460 conditions per place. [2024-01-29 22:56:40,912 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-01-29 22:56:40,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 179 transitions, 438 flow [2024-01-29 22:56:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-01-29 22:56:40,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7386831275720165 [2024-01-29 22:56:40,921 INFO L175 Difference]: Start difference. First operand has 190 places, 181 transitions, 372 flow. Second operand 3 states and 718 transitions. [2024-01-29 22:56:40,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 179 transitions, 438 flow [2024-01-29 22:56:40,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 179 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,923 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 368 flow [2024-01-29 22:56:40,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2024-01-29 22:56:40,924 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -142 predicate places. [2024-01-29 22:56:40,924 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 368 flow [2024-01-29 22:56:40,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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-01-29 22:56:40,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-01-29 22:56:40,925 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -488506726, now seen corresponding path program 1 times [2024-01-29 22:56:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632221642] [2024-01-29 22:56:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632221642] [2024-01-29 22:56:40,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632221642] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423837678] [2024-01-29 22:56:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:41,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:41,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:41,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,143 INFO L124 PetriNetUnfolderBase]: 279/664 cut-off events. [2024-01-29 22:56:41,144 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 664 events. 279/664 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3265 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1074. Up to 458 conditions per place. [2024-01-29 22:56:41,146 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-01-29 22:56:41,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 178 transitions, 432 flow [2024-01-29 22:56:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:41,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:41,147 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 368 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:41,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 178 transitions, 432 flow [2024-01-29 22:56:41,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 178 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,149 INFO L231 Difference]: Finished difference. Result has 187 places, 178 transitions, 366 flow [2024-01-29 22:56:41,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=187, PETRI_TRANSITIONS=178} [2024-01-29 22:56:41,150 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -143 predicate places. [2024-01-29 22:56:41,150 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 178 transitions, 366 flow [2024-01-29 22:56:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:41,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-01-29 22:56:41,150 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2036162795, now seen corresponding path program 1 times [2024-01-29 22:56:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177846963] [2024-01-29 22:56:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177846963] [2024-01-29 22:56:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177846963] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524367356] [2024-01-29 22:56:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:41,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:41,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:41,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,400 INFO L124 PetriNetUnfolderBase]: 279/663 cut-off events. [2024-01-29 22:56:41,401 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 663 events. 279/663 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3264 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1075. Up to 459 conditions per place. [2024-01-29 22:56:41,402 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2024-01-29 22:56:41,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 177 transitions, 432 flow [2024-01-29 22:56:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:41,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:41,404 INFO L175 Difference]: Start difference. First operand has 187 places, 178 transitions, 366 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:41,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 177 transitions, 432 flow [2024-01-29 22:56:41,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 177 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,405 INFO L231 Difference]: Finished difference. Result has 186 places, 177 transitions, 364 flow [2024-01-29 22:56:41,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2024-01-29 22:56:41,413 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -144 predicate places. [2024-01-29 22:56:41,413 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 364 flow [2024-01-29 22:56:41,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:41,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-01-29 22:56:41,413 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1303460787, now seen corresponding path program 1 times [2024-01-29 22:56:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460882455] [2024-01-29 22:56:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:41,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460882455] [2024-01-29 22:56:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460882455] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749816317] [2024-01-29 22:56:41,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:41,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:41,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,651 INFO L124 PetriNetUnfolderBase]: 279/662 cut-off events. [2024-01-29 22:56:41,651 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 662 events. 279/662 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3249 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1077. Up to 461 conditions per place. [2024-01-29 22:56:41,653 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2024-01-29 22:56:41,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 434 flow [2024-01-29 22:56:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-01-29 22:56:41,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73559670781893 [2024-01-29 22:56:41,655 INFO L175 Difference]: Start difference. First operand has 186 places, 177 transitions, 364 flow. Second operand 3 states and 715 transitions. [2024-01-29 22:56:41,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 176 transitions, 434 flow [2024-01-29 22:56:41,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,657 INFO L231 Difference]: Finished difference. Result has 185 places, 176 transitions, 362 flow [2024-01-29 22:56:41,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=185, PETRI_TRANSITIONS=176} [2024-01-29 22:56:41,658 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -145 predicate places. [2024-01-29 22:56:41,658 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 362 flow [2024-01-29 22:56:41,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-29 22:56:41,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-01-29 22:56:41,658 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1752576809, now seen corresponding path program 1 times [2024-01-29 22:56:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012939382] [2024-01-29 22:56:41,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:41,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012939382] [2024-01-29 22:56:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012939382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570851991] [2024-01-29 22:56:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:41,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:41,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:41,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,918 INFO L124 PetriNetUnfolderBase]: 279/661 cut-off events. [2024-01-29 22:56:41,919 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 661 events. 279/661 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3264 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1074. Up to 458 conditions per place. [2024-01-29 22:56:41,920 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2024-01-29 22:56:41,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 175 transitions, 426 flow [2024-01-29 22:56:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:41,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:41,922 INFO L175 Difference]: Start difference. First operand has 185 places, 176 transitions, 362 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:41,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 175 transitions, 426 flow [2024-01-29 22:56:41,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 175 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,923 INFO L231 Difference]: Finished difference. Result has 184 places, 175 transitions, 360 flow [2024-01-29 22:56:41,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=184, PETRI_TRANSITIONS=175} [2024-01-29 22:56:41,924 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -146 predicate places. [2024-01-29 22:56:41,924 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 175 transitions, 360 flow [2024-01-29 22:56:41,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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-01-29 22:56:41,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-01-29 22:56:41,925 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1391334689, now seen corresponding path program 1 times [2024-01-29 22:56:41,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478260386] [2024-01-29 22:56:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478260386] [2024-01-29 22:56:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478260386] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957247985] [2024-01-29 22:56:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:42,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:42,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,125 INFO L124 PetriNetUnfolderBase]: 279/659 cut-off events. [2024-01-29 22:56:42,125 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 659 events. 279/659 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3242 event pairs, 279 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1071. Up to 455 conditions per place. [2024-01-29 22:56:42,128 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2024-01-29 22:56:42,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 173 transitions, 422 flow [2024-01-29 22:56:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:42,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:42,130 INFO L175 Difference]: Start difference. First operand has 184 places, 175 transitions, 360 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 173 transitions, 422 flow [2024-01-29 22:56:42,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 173 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,133 INFO L231 Difference]: Finished difference. Result has 182 places, 173 transitions, 356 flow [2024-01-29 22:56:42,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=182, PETRI_TRANSITIONS=173} [2024-01-29 22:56:42,133 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -148 predicate places. [2024-01-29 22:56:42,133 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 173 transitions, 356 flow [2024-01-29 22:56:42,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-01-29 22:56:42,134 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash -181700455, now seen corresponding path program 1 times [2024-01-29 22:56:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618056890] [2024-01-29 22:56:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618056890] [2024-01-29 22:56:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618056890] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252536458] [2024-01-29 22:56:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:42,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 173 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,339 INFO L124 PetriNetUnfolderBase]: 279/658 cut-off events. [2024-01-29 22:56:42,339 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 658 events. 279/658 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3258 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:42,341 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-01-29 22:56:42,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 172 transitions, 420 flow [2024-01-29 22:56:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:42,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:42,342 INFO L175 Difference]: Start difference. First operand has 182 places, 173 transitions, 356 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:42,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 172 transitions, 420 flow [2024-01-29 22:56:42,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 172 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,344 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 354 flow [2024-01-29 22:56:42,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=181, PETRI_TRANSITIONS=172} [2024-01-29 22:56:42,345 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -149 predicate places. [2024-01-29 22:56:42,345 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 354 flow [2024-01-29 22:56:42,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-01-29 22:56:42,345 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1337744768, now seen corresponding path program 1 times [2024-01-29 22:56:42,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996757594] [2024-01-29 22:56:42,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996757594] [2024-01-29 22:56:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996757594] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317870494] [2024-01-29 22:56:42,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:42,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:42,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:42,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,507 INFO L124 PetriNetUnfolderBase]: 279/657 cut-off events. [2024-01-29 22:56:42,507 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 657 events. 279/657 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3255 event pairs, 279 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:42,509 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-01-29 22:56:42,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 422 flow [2024-01-29 22:56:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:42,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:42,510 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 354 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:42,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 422 flow [2024-01-29 22:56:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 171 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,512 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 352 flow [2024-01-29 22:56:42,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2024-01-29 22:56:42,512 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -150 predicate places. [2024-01-29 22:56:42,512 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 352 flow [2024-01-29 22:56:42,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:42,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-01-29 22:56:42,513 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1479587345, now seen corresponding path program 1 times [2024-01-29 22:56:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429717841] [2024-01-29 22:56:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429717841] [2024-01-29 22:56:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429717841] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338826536] [2024-01-29 22:56:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:42,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:42,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,696 INFO L124 PetriNetUnfolderBase]: 279/656 cut-off events. [2024-01-29 22:56:42,696 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 656 events. 279/656 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3237 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:42,697 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-01-29 22:56:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 170 transitions, 416 flow [2024-01-29 22:56:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:42,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:42,698 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 352 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:42,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 170 transitions, 416 flow [2024-01-29 22:56:42,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 170 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,700 INFO L231 Difference]: Finished difference. Result has 179 places, 170 transitions, 350 flow [2024-01-29 22:56:42,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=179, PETRI_TRANSITIONS=170} [2024-01-29 22:56:42,700 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -151 predicate places. [2024-01-29 22:56:42,700 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 170 transitions, 350 flow [2024-01-29 22:56:42,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-01-29 22:56:42,701 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1377430452, now seen corresponding path program 1 times [2024-01-29 22:56:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790474214] [2024-01-29 22:56:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790474214] [2024-01-29 22:56:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790474214] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115448109] [2024-01-29 22:56:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:42,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 170 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:42,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,893 INFO L124 PetriNetUnfolderBase]: 279/655 cut-off events. [2024-01-29 22:56:42,893 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 655 events. 279/655 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3217 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:42,895 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-01-29 22:56:42,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 169 transitions, 414 flow [2024-01-29 22:56:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:42,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:42,897 INFO L175 Difference]: Start difference. First operand has 179 places, 170 transitions, 350 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:42,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 169 transitions, 414 flow [2024-01-29 22:56:42,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 169 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,898 INFO L231 Difference]: Finished difference. Result has 178 places, 169 transitions, 348 flow [2024-01-29 22:56:42,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=178, PETRI_TRANSITIONS=169} [2024-01-29 22:56:42,899 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -152 predicate places. [2024-01-29 22:56:42,899 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 169 transitions, 348 flow [2024-01-29 22:56:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-29 22:56:42,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-01-29 22:56:42,900 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 249330977, now seen corresponding path program 1 times [2024-01-29 22:56:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578722188] [2024-01-29 22:56:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578722188] [2024-01-29 22:56:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578722188] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617737029] [2024-01-29 22:56:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:43,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 169 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-29 22:56:43,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:43,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,141 INFO L124 PetriNetUnfolderBase]: 279/653 cut-off events. [2024-01-29 22:56:43,142 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 653 events. 279/653 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3193 event pairs, 279 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1054. Up to 454 conditions per place. [2024-01-29 22:56:43,143 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 28 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-01-29 22:56:43,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 167 transitions, 404 flow [2024-01-29 22:56:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:43,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:43,145 INFO L175 Difference]: Start difference. First operand has 178 places, 169 transitions, 348 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 167 transitions, 404 flow [2024-01-29 22:56:43,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 167 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,146 INFO L231 Difference]: Finished difference. Result has 176 places, 167 transitions, 344 flow [2024-01-29 22:56:43,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=176, PETRI_TRANSITIONS=167} [2024-01-29 22:56:43,147 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -154 predicate places. [2024-01-29 22:56:43,147 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 344 flow [2024-01-29 22:56:43,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-29 22:56:43,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:43,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-01-29 22:56:43,148 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1822581717, now seen corresponding path program 1 times [2024-01-29 22:56:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940406718] [2024-01-29 22:56:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940406718] [2024-01-29 22:56:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940406718] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649663337] [2024-01-29 22:56:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:43,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-29 22:56:43,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:43,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,353 INFO L124 PetriNetUnfolderBase]: 279/651 cut-off events. [2024-01-29 22:56:43,353 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 651 events. 279/651 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3224 event pairs, 279 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1054. Up to 454 conditions per place. [2024-01-29 22:56:43,355 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2024-01-29 22:56:43,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 165 transitions, 406 flow [2024-01-29 22:56:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:43,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:43,356 INFO L175 Difference]: Start difference. First operand has 176 places, 167 transitions, 344 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:43,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 165 transitions, 406 flow [2024-01-29 22:56:43,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 165 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,358 INFO L231 Difference]: Finished difference. Result has 174 places, 165 transitions, 340 flow [2024-01-29 22:56:43,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=174, PETRI_TRANSITIONS=165} [2024-01-29 22:56:43,359 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -156 predicate places. [2024-01-29 22:56:43,359 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 165 transitions, 340 flow [2024-01-29 22:56:43,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-29 22:56:43,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:43,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-01-29 22:56:43,359 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 665460364, now seen corresponding path program 1 times [2024-01-29 22:56:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336493115] [2024-01-29 22:56:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336493115] [2024-01-29 22:56:43,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336493115] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223684556] [2024-01-29 22:56:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:43,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 165 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:43,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:43,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,581 INFO L124 PetriNetUnfolderBase]: 279/649 cut-off events. [2024-01-29 22:56:43,581 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 649 events. 279/649 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3222 event pairs, 279 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1042. Up to 456 conditions per place. [2024-01-29 22:56:43,583 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-01-29 22:56:43,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 163 transitions, 402 flow [2024-01-29 22:56:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:43,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7458847736625515 [2024-01-29 22:56:43,584 INFO L175 Difference]: Start difference. First operand has 174 places, 165 transitions, 340 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:43,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 163 transitions, 402 flow [2024-01-29 22:56:43,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 163 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,586 INFO L231 Difference]: Finished difference. Result has 172 places, 163 transitions, 336 flow [2024-01-29 22:56:43,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=172, PETRI_TRANSITIONS=163} [2024-01-29 22:56:43,586 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -158 predicate places. [2024-01-29 22:56:43,586 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 163 transitions, 336 flow [2024-01-29 22:56:43,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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-01-29 22:56:43,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-01-29 22:56:43,587 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -845563161, now seen corresponding path program 1 times [2024-01-29 22:56:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351486462] [2024-01-29 22:56:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351486462] [2024-01-29 22:56:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351486462] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928086271] [2024-01-29 22:56:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 163 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-29 22:56:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:43,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,805 INFO L124 PetriNetUnfolderBase]: 279/647 cut-off events. [2024-01-29 22:56:43,805 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 647 events. 279/647 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3222 event pairs, 279 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1044. Up to 458 conditions per place. [2024-01-29 22:56:43,807 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2024-01-29 22:56:43,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 402 flow [2024-01-29 22:56:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-01-29 22:56:43,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7386831275720165 [2024-01-29 22:56:43,808 INFO L175 Difference]: Start difference. First operand has 172 places, 163 transitions, 336 flow. Second operand 3 states and 718 transitions. [2024-01-29 22:56:43,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 402 flow [2024-01-29 22:56:43,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 161 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,809 INFO L231 Difference]: Finished difference. Result has 170 places, 161 transitions, 332 flow [2024-01-29 22:56:43,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=170, PETRI_TRANSITIONS=161} [2024-01-29 22:56:43,810 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -160 predicate places. [2024-01-29 22:56:43,810 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 332 flow [2024-01-29 22:56:43,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-29 22:56:43,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:43,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-01-29 22:56:43,810 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -186841060, now seen corresponding path program 1 times [2024-01-29 22:56:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822633912] [2024-01-29 22:56:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822633912] [2024-01-29 22:56:43,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822633912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999845548] [2024-01-29 22:56:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:43,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-29 22:56:43,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:43,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,042 INFO L124 PetriNetUnfolderBase]: 279/646 cut-off events. [2024-01-29 22:56:44,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:44,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 646 events. 279/646 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3238 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1044. Up to 458 conditions per place. [2024-01-29 22:56:44,044 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-01-29 22:56:44,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 160 transitions, 400 flow [2024-01-29 22:56:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:56:44,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:44,045 INFO L175 Difference]: Start difference. First operand has 170 places, 161 transitions, 332 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:44,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 160 transitions, 400 flow [2024-01-29 22:56:44,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 160 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,046 INFO L231 Difference]: Finished difference. Result has 169 places, 160 transitions, 330 flow [2024-01-29 22:56:44,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=169, PETRI_TRANSITIONS=160} [2024-01-29 22:56:44,047 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -161 predicate places. [2024-01-29 22:56:44,047 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 160 transitions, 330 flow [2024-01-29 22:56:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-29 22:56:44,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-01-29 22:56:44,047 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash 834437521, now seen corresponding path program 1 times [2024-01-29 22:56:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509856214] [2024-01-29 22:56:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509856214] [2024-01-29 22:56:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509856214] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170939077] [2024-01-29 22:56:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 324 [2024-01-29 22:56:44,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 160 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-29 22:56:44,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 324 [2024-01-29 22:56:44,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,185 INFO L124 PetriNetUnfolderBase]: 279/645 cut-off events. [2024-01-29 22:56:44,185 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 645 events. 279/645 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3208 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1043. Up to 452 conditions per place. [2024-01-29 22:56:44,187 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 45 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-01-29 22:56:44,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 159 transitions, 422 flow [2024-01-29 22:56:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-01-29 22:56:44,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-01-29 22:56:44,188 INFO L175 Difference]: Start difference. First operand has 169 places, 160 transitions, 330 flow. Second operand 3 states and 702 transitions. [2024-01-29 22:56:44,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 159 transitions, 422 flow [2024-01-29 22:56:44,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 159 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,190 INFO L231 Difference]: Finished difference. Result has 168 places, 159 transitions, 328 flow [2024-01-29 22:56:44,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=168, PETRI_TRANSITIONS=159} [2024-01-29 22:56:44,191 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -162 predicate places. [2024-01-29 22:56:44,191 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 159 transitions, 328 flow [2024-01-29 22:56:44,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-29 22:56:44,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-01-29 22:56:44,191 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 97761443, now seen corresponding path program 1 times [2024-01-29 22:56:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934706633] [2024-01-29 22:56:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934706633] [2024-01-29 22:56:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934706633] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272527160] [2024-01-29 22:56:44,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:44,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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-01-29 22:56:44,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:44,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,445 INFO L124 PetriNetUnfolderBase]: 279/642 cut-off events. [2024-01-29 22:56:44,445 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 642 events. 279/642 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3193 event pairs, 279 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 1032. Up to 458 conditions per place. [2024-01-29 22:56:44,446 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-01-29 22:56:44,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 394 flow [2024-01-29 22:56:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:56:44,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:44,447 INFO L175 Difference]: Start difference. First operand has 168 places, 159 transitions, 328 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:44,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 394 flow [2024-01-29 22:56:44,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 156 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,449 INFO L231 Difference]: Finished difference. Result has 165 places, 156 transitions, 322 flow [2024-01-29 22:56:44,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=165, PETRI_TRANSITIONS=156} [2024-01-29 22:56:44,449 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -165 predicate places. [2024-01-29 22:56:44,449 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 156 transitions, 322 flow [2024-01-29 22:56:44,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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-01-29 22:56:44,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-01-29 22:56:44,449 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1264360664, now seen corresponding path program 1 times [2024-01-29 22:56:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491691686] [2024-01-29 22:56:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491691686] [2024-01-29 22:56:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491691686] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810993183] [2024-01-29 22:56:44,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:44,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 156 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:44,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:44,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,673 INFO L124 PetriNetUnfolderBase]: 279/641 cut-off events. [2024-01-29 22:56:44,673 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 641 events. 279/641 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3210 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1031. Up to 457 conditions per place. [2024-01-29 22:56:44,675 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-01-29 22:56:44,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 155 transitions, 390 flow [2024-01-29 22:56:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:56:44,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:44,676 INFO L175 Difference]: Start difference. First operand has 165 places, 156 transitions, 322 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:44,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 155 transitions, 390 flow [2024-01-29 22:56:44,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 155 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,678 INFO L231 Difference]: Finished difference. Result has 164 places, 155 transitions, 320 flow [2024-01-29 22:56:44,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=164, PETRI_TRANSITIONS=155} [2024-01-29 22:56:44,678 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -166 predicate places. [2024-01-29 22:56:44,678 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 155 transitions, 320 flow [2024-01-29 22:56:44,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:44,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-01-29 22:56:44,679 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -540472842, now seen corresponding path program 1 times [2024-01-29 22:56:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269264288] [2024-01-29 22:56:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269264288] [2024-01-29 22:56:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269264288] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611225445] [2024-01-29 22:56:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 155 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:44,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,897 INFO L124 PetriNetUnfolderBase]: 279/640 cut-off events. [2024-01-29 22:56:44,897 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 640 events. 279/640 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3234 event pairs, 279 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1031. Up to 457 conditions per place. [2024-01-29 22:56:44,899 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-01-29 22:56:44,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 154 transitions, 388 flow [2024-01-29 22:56:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:56:44,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:44,900 INFO L175 Difference]: Start difference. First operand has 164 places, 155 transitions, 320 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:44,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 154 transitions, 388 flow [2024-01-29 22:56:44,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 154 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,902 INFO L231 Difference]: Finished difference. Result has 163 places, 154 transitions, 318 flow [2024-01-29 22:56:44,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=163, PETRI_TRANSITIONS=154} [2024-01-29 22:56:44,902 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -167 predicate places. [2024-01-29 22:56:44,902 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 154 transitions, 318 flow [2024-01-29 22:56:44,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-01-29 22:56:44,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-01-29 22:56:44,903 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 608031964, now seen corresponding path program 1 times [2024-01-29 22:56:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44930063] [2024-01-29 22:56:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44930063] [2024-01-29 22:56:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44930063] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748267175] [2024-01-29 22:56:44,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:44,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 154 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 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-01-29 22:56:44,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:44,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,060 INFO L124 PetriNetUnfolderBase]: 279/638 cut-off events. [2024-01-29 22:56:45,061 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 638 events. 279/638 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3222 event pairs, 279 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 1025. Up to 451 conditions per place. [2024-01-29 22:56:45,062 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2024-01-29 22:56:45,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 152 transitions, 378 flow [2024-01-29 22:56:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 22:56:45,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7510288065843621 [2024-01-29 22:56:45,063 INFO L175 Difference]: Start difference. First operand has 163 places, 154 transitions, 318 flow. Second operand 3 states and 730 transitions. [2024-01-29 22:56:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 152 transitions, 378 flow [2024-01-29 22:56:45,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 152 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,065 INFO L231 Difference]: Finished difference. Result has 161 places, 152 transitions, 314 flow [2024-01-29 22:56:45,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=161, PETRI_TRANSITIONS=152} [2024-01-29 22:56:45,065 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -169 predicate places. [2024-01-29 22:56:45,065 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 152 transitions, 314 flow [2024-01-29 22:56:45,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 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-01-29 22:56:45,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-01-29 22:56:45,066 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1669123717, now seen corresponding path program 1 times [2024-01-29 22:56:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806943088] [2024-01-29 22:56:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806943088] [2024-01-29 22:56:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806943088] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174820425] [2024-01-29 22:56:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:45,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 152 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-29 22:56:45,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:45,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,221 INFO L124 PetriNetUnfolderBase]: 279/637 cut-off events. [2024-01-29 22:56:45,221 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 637 events. 279/637 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3197 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1016. Up to 452 conditions per place. [2024-01-29 22:56:45,222 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-29 22:56:45,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 151 transitions, 380 flow [2024-01-29 22:56:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:45,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7458847736625515 [2024-01-29 22:56:45,224 INFO L175 Difference]: Start difference. First operand has 161 places, 152 transitions, 314 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:45,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 151 transitions, 380 flow [2024-01-29 22:56:45,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 151 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,225 INFO L231 Difference]: Finished difference. Result has 160 places, 151 transitions, 312 flow [2024-01-29 22:56:45,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=160, PETRI_TRANSITIONS=151} [2024-01-29 22:56:45,226 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -170 predicate places. [2024-01-29 22:56:45,226 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 151 transitions, 312 flow [2024-01-29 22:56:45,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-29 22:56:45,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-01-29 22:56:45,227 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 203229589, now seen corresponding path program 1 times [2024-01-29 22:56:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874984919] [2024-01-29 22:56:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874984919] [2024-01-29 22:56:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874984919] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158284382] [2024-01-29 22:56:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:45,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:45,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,380 INFO L124 PetriNetUnfolderBase]: 279/636 cut-off events. [2024-01-29 22:56:45,380 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 636 events. 279/636 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3195 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1016. Up to 452 conditions per place. [2024-01-29 22:56:45,382 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-01-29 22:56:45,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 380 flow [2024-01-29 22:56:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:45,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:45,383 INFO L175 Difference]: Start difference. First operand has 160 places, 151 transitions, 312 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:45,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 380 flow [2024-01-29 22:56:45,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 150 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,385 INFO L231 Difference]: Finished difference. Result has 159 places, 150 transitions, 310 flow [2024-01-29 22:56:45,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=159, PETRI_TRANSITIONS=150} [2024-01-29 22:56:45,386 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -171 predicate places. [2024-01-29 22:56:45,386 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 310 flow [2024-01-29 22:56:45,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-01-29 22:56:45,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-01-29 22:56:45,387 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2030174953, now seen corresponding path program 1 times [2024-01-29 22:56:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607681720] [2024-01-29 22:56:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607681720] [2024-01-29 22:56:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607681720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670125971] [2024-01-29 22:56:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:45,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 150 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 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-01-29 22:56:45,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:45,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,547 INFO L124 PetriNetUnfolderBase]: 279/635 cut-off events. [2024-01-29 22:56:45,548 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 635 events. 279/635 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3196 event pairs, 279 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1015. Up to 451 conditions per place. [2024-01-29 22:56:45,549 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2024-01-29 22:56:45,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 149 transitions, 370 flow [2024-01-29 22:56:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:45,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:45,551 INFO L175 Difference]: Start difference. First operand has 159 places, 150 transitions, 310 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:45,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 149 transitions, 370 flow [2024-01-29 22:56:45,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 149 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,553 INFO L231 Difference]: Finished difference. Result has 158 places, 149 transitions, 308 flow [2024-01-29 22:56:45,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=158, PETRI_TRANSITIONS=149} [2024-01-29 22:56:45,553 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -172 predicate places. [2024-01-29 22:56:45,553 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 149 transitions, 308 flow [2024-01-29 22:56:45,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 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-01-29 22:56:45,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-01-29 22:56:45,554 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1489083765, now seen corresponding path program 1 times [2024-01-29 22:56:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165156794] [2024-01-29 22:56:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165156794] [2024-01-29 22:56:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165156794] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232370790] [2024-01-29 22:56:45,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:45,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 149 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-01-29 22:56:45,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:45,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,709 INFO L124 PetriNetUnfolderBase]: 279/633 cut-off events. [2024-01-29 22:56:45,710 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 633 events. 279/633 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3205 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1014. Up to 450 conditions per place. [2024-01-29 22:56:45,712 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-29 22:56:45,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 147 transitions, 368 flow [2024-01-29 22:56:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 22:56:45,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7510288065843621 [2024-01-29 22:56:45,713 INFO L175 Difference]: Start difference. First operand has 158 places, 149 transitions, 308 flow. Second operand 3 states and 730 transitions. [2024-01-29 22:56:45,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 147 transitions, 368 flow [2024-01-29 22:56:45,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 147 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,715 INFO L231 Difference]: Finished difference. Result has 156 places, 147 transitions, 304 flow [2024-01-29 22:56:45,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=156, PETRI_TRANSITIONS=147} [2024-01-29 22:56:45,715 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -174 predicate places. [2024-01-29 22:56:45,715 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 147 transitions, 304 flow [2024-01-29 22:56:45,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-01-29 22:56:45,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-01-29 22:56:45,716 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1083045652, now seen corresponding path program 1 times [2024-01-29 22:56:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639579237] [2024-01-29 22:56:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639579237] [2024-01-29 22:56:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639579237] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403172232] [2024-01-29 22:56:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:45,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-01-29 22:56:45,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:45,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,873 INFO L124 PetriNetUnfolderBase]: 279/632 cut-off events. [2024-01-29 22:56:45,873 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 632 events. 279/632 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3185 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1006. Up to 450 conditions per place. [2024-01-29 22:56:45,874 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-01-29 22:56:45,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 146 transitions, 366 flow [2024-01-29 22:56:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:45,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:45,875 INFO L175 Difference]: Start difference. First operand has 156 places, 147 transitions, 304 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:45,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 146 transitions, 366 flow [2024-01-29 22:56:45,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 146 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,877 INFO L231 Difference]: Finished difference. Result has 155 places, 146 transitions, 302 flow [2024-01-29 22:56:45,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=155, PETRI_TRANSITIONS=146} [2024-01-29 22:56:45,878 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -175 predicate places. [2024-01-29 22:56:45,878 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 146 transitions, 302 flow [2024-01-29 22:56:45,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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-01-29 22:56:45,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-01-29 22:56:45,878 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -785321165, now seen corresponding path program 1 times [2024-01-29 22:56:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928935007] [2024-01-29 22:56:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928935007] [2024-01-29 22:56:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928935007] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735936613] [2024-01-29 22:56:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:45,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-29 22:56:45,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:45,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,045 INFO L124 PetriNetUnfolderBase]: 279/631 cut-off events. [2024-01-29 22:56:46,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 631 events. 279/631 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3183 event pairs, 279 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1007. Up to 451 conditions per place. [2024-01-29 22:56:46,046 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 22:56:46,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 145 transitions, 366 flow [2024-01-29 22:56:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:46,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:46,048 INFO L175 Difference]: Start difference. First operand has 155 places, 146 transitions, 302 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:46,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 145 transitions, 366 flow [2024-01-29 22:56:46,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 145 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,049 INFO L231 Difference]: Finished difference. Result has 154 places, 145 transitions, 300 flow [2024-01-29 22:56:46,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=154, PETRI_TRANSITIONS=145} [2024-01-29 22:56:46,049 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -176 predicate places. [2024-01-29 22:56:46,050 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 145 transitions, 300 flow [2024-01-29 22:56:46,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-29 22:56:46,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-01-29 22:56:46,050 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1220667177, now seen corresponding path program 1 times [2024-01-29 22:56:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356348111] [2024-01-29 22:56:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356348111] [2024-01-29 22:56:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356348111] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320657151] [2024-01-29 22:56:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:46,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 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-01-29 22:56:46,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:46,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,190 INFO L124 PetriNetUnfolderBase]: 279/629 cut-off events. [2024-01-29 22:56:46,190 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:46,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 629 events. 279/629 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3205 event pairs, 279 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1005. Up to 463 conditions per place. [2024-01-29 22:56:46,191 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2024-01-29 22:56:46,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 143 transitions, 358 flow [2024-01-29 22:56:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-29 22:56:46,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-29 22:56:46,193 INFO L175 Difference]: Start difference. First operand has 154 places, 145 transitions, 300 flow. Second operand 3 states and 732 transitions. [2024-01-29 22:56:46,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 143 transitions, 358 flow [2024-01-29 22:56:46,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 143 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,194 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 294 flow [2024-01-29 22:56:46,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2024-01-29 22:56:46,195 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -178 predicate places. [2024-01-29 22:56:46,195 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 294 flow [2024-01-29 22:56:46,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 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-01-29 22:56:46,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-01-29 22:56:46,195 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash -814021171, now seen corresponding path program 1 times [2024-01-29 22:56:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501936012] [2024-01-29 22:56:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:46,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501936012] [2024-01-29 22:56:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501936012] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5562683] [2024-01-29 22:56:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:46,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 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-01-29 22:56:46,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:46,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,336 INFO L124 PetriNetUnfolderBase]: 279/628 cut-off events. [2024-01-29 22:56:46,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 628 events. 279/628 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3188 event pairs, 279 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1131. Up to 463 conditions per place. [2024-01-29 22:56:46,337 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 30 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2024-01-29 22:56:46,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 142 transitions, 354 flow [2024-01-29 22:56:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:46,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:46,339 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 294 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:46,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 142 transitions, 354 flow [2024-01-29 22:56:46,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 142 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:46,340 INFO L231 Difference]: Finished difference. Result has 152 places, 142 transitions, 293 flow [2024-01-29 22:56:46,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=152, PETRI_TRANSITIONS=142} [2024-01-29 22:56:46,341 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -178 predicate places. [2024-01-29 22:56:46,341 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 142 transitions, 293 flow [2024-01-29 22:56:46,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 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-01-29 22:56:46,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-01-29 22:56:46,341 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -274774340, now seen corresponding path program 1 times [2024-01-29 22:56:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144791511] [2024-01-29 22:56:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144791511] [2024-01-29 22:56:46,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144791511] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844355737] [2024-01-29 22:56:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:46,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 22:56:46,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 142 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 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-01-29 22:56:46,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 22:56:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,668 INFO L124 PetriNetUnfolderBase]: 279/622 cut-off events. [2024-01-29 22:56:46,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 622 events. 279/622 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3043 event pairs, 39 based on Foata normal form. 42/462 useless extension candidates. Maximal degree in co-relation 1123. Up to 366 conditions per place. [2024-01-29 22:56:46,672 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-29 22:56:46,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 395 flow [2024-01-29 22:56:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 978 transitions. [2024-01-29 22:56:46,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7546296296296297 [2024-01-29 22:56:46,675 INFO L175 Difference]: Start difference. First operand has 152 places, 142 transitions, 293 flow. Second operand 4 states and 978 transitions. [2024-01-29 22:56:46,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 395 flow [2024-01-29 22:56:46,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 151 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:46,677 INFO L231 Difference]: Finished difference. Result has 152 places, 140 transitions, 292 flow [2024-01-29 22:56:46,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=152, PETRI_TRANSITIONS=140} [2024-01-29 22:56:46,677 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -178 predicate places. [2024-01-29 22:56:46,677 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 140 transitions, 292 flow [2024-01-29 22:56:46,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 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-01-29 22:56:46,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-01-29 22:56:46,678 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 71932276, now seen corresponding path program 1 times [2024-01-29 22:56:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376193691] [2024-01-29 22:56:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:46,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:56:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:46,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:56:46,785 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:56:46,786 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 241 remaining) [2024-01-29 22:56:46,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 241 remaining) [2024-01-29 22:56:46,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 241 remaining) [2024-01-29 22:56:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 241 remaining) [2024-01-29 22:56:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 241 remaining) [2024-01-29 22:56:46,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 241 remaining) [2024-01-29 22:56:46,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 241 remaining) [2024-01-29 22:56:46,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 241 remaining) [2024-01-29 22:56:46,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 241 remaining) [2024-01-29 22:56:46,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 241 remaining) [2024-01-29 22:56:46,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 241 remaining) [2024-01-29 22:56:46,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 241 remaining) [2024-01-29 22:56:46,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 241 remaining) [2024-01-29 22:56:46,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 241 remaining) [2024-01-29 22:56:46,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 241 remaining) [2024-01-29 22:56:46,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 241 remaining) [2024-01-29 22:56:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 241 remaining) [2024-01-29 22:56:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 241 remaining) [2024-01-29 22:56:46,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 241 remaining) [2024-01-29 22:56:46,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 241 remaining) [2024-01-29 22:56:46,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 241 remaining) [2024-01-29 22:56:46,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 241 remaining) [2024-01-29 22:56:46,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 241 remaining) [2024-01-29 22:56:46,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (62 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 241 remaining) [2024-01-29 22:56:46,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 241 remaining) [2024-01-29 22:56:46,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 241 remaining) [2024-01-29 22:56:46,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 241 remaining) [2024-01-29 22:56:46,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 241 remaining) [2024-01-29 22:56:46,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 241 remaining) [2024-01-29 22:56:46,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 241 remaining) [2024-01-29 22:56:46,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 241 remaining) [2024-01-29 22:56:46,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 241 remaining) [2024-01-29 22:56:46,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 241 remaining) [2024-01-29 22:56:46,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-01-29 22:56:46,819 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,825 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:56:46,825 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:56:46,914 INFO L503 ceAbstractionStarter]: Automizer considered 177 witness invariants [2024-01-29 22:56:46,914 INFO L504 ceAbstractionStarter]: WitnessConsidered=177 [2024-01-29 22:56:46,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:56:46 BasicIcfg [2024-01-29 22:56:46,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:56:46,916 INFO L158 Benchmark]: Toolchain (without parser) took 25044.29ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 104.0MB in the beginning and 877.9MB in the end (delta: -773.9MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,916 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:46,916 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 127.0MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:46,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.56ms. Allocated memory is still 165.7MB. Free memory was 103.6MB in the beginning and 76.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.26ms. Allocated memory is still 165.7MB. Free memory was 76.3MB in the beginning and 72.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,916 INFO L158 Benchmark]: Boogie Preprocessor took 84.16ms. Allocated memory is still 165.7MB. Free memory was 72.2MB in the beginning and 67.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,917 INFO L158 Benchmark]: RCFGBuilder took 1899.54ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 67.6MB in the beginning and 90.5MB in the end (delta: -22.9MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,917 INFO L158 Benchmark]: TraceAbstraction took 22657.19ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 870.3MB). Free memory was 90.5MB in the beginning and 877.9MB in the end (delta: -787.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-01-29 22:56:46,918 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 127.0MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.56ms. Allocated memory is still 165.7MB. Free memory was 103.6MB in the beginning and 76.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.26ms. Allocated memory is still 165.7MB. Free memory was 76.3MB in the beginning and 72.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.16ms. Allocated memory is still 165.7MB. Free memory was 72.2MB in the beginning and 67.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1899.54ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 67.6MB in the beginning and 90.5MB in the end (delta: -22.9MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22657.19ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 870.3MB). Free memory was 90.5MB in the beginning and 877.9MB in the end (delta: -787.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 108]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int cardSet_0, cardRarity_1, cardId_2, cardType_3, cardSet_4, cardRarity_5, cardId_6, cardType_7, cardSet_8, cardRarity_9, cardId_10, cardType_11, result_12, result_13, result_14; [L76] 0 pthread_t t1, t2, t3; VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] [L78] 0 cardSet_0 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] [L80] 0 cardId_2 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] [L87] 0 cardRarity_9 = __VERIFIER_nondet_int() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L92] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] [L107] CALL 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L35] COND FALSE 1 !(!cond) [L107] RET 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L108] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=1, a=0, b=1, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=1, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 403 locations, 241 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.2s, OverallIterations: 88, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25446 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7243 mSDsluCounter, 2677 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22623 IncrementalHoareTripleChecker+Invalid, 23322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 2677 mSDtfsCounter, 22623 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 5343 NumberOfCodeBlocks, 5343 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 5134 ConstructedInterpolants, 0 QuantifiedInterpolants, 49873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 87 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:56:46,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE