./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-trans.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-trans.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-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-trans.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,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:20,737 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,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:20,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:20,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:20,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:20,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:20,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:20,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:20,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:20,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:20,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:20,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:20,758 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:20,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:20,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:20,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:20,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:20,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:20,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:20,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:20,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:20,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:20,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:20,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:20,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:20,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:20,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:20,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:20,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:20,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:20,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:20,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:20,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:20,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:20,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:20,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:20,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:20,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:20,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:20,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:20,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:20,765 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,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:20,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:20,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:20,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:20,945 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:20,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2024-01-29 22:56:22,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:22,261 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:22,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2024-01-29 22:56:22,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b1ef5af/2b6a8576d99c4e7595209867bfcf9651/FLAGe4149c30a [2024-01-29 22:56:22,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b1ef5af/2b6a8576d99c4e7595209867bfcf9651 [2024-01-29 22:56:22,290 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:22,291 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:22,291 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-trans.wvr.yml/witness.yml [2024-01-29 22:56:22,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:22,489 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:22,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:22,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:22,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:22,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:22" (1/2) ... [2024-01-29 22:56:22,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3301bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22, skipping insertion in model container [2024-01-29 22:56:22,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:22" (1/2) ... [2024-01-29 22:56:22,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e9e39f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:22, skipping insertion in model container [2024-01-29 22:56:22,497 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:22" (2/2) ... [2024-01-29 22:56:22,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3301bb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22, skipping insertion in model container [2024-01-29 22:56:22,497 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:22" (2/2) ... [2024-01-29 22:56:22,499 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:22,569 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:22,570 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,570 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (result_13 == 0) [2024-01-29 22:56:22,570 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardId_10 == 0 [2024-01-29 22:56:22,571 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (result_12 == 0) [2024-01-29 22:56:22,571 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((cardId_10 == 0) && (result_13 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,571 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (cardId_10 == 0) && (cardType_11 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,572 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (cardId_6 == 0) && (cardType_7 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_6 == 0 [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (((cardId_6 == 0) && (cardType_7 == 0)) && (cardSet_8 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_4 == 0 [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardType_7 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (result_12 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (result_14 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardSet_8 == 0) [2024-01-29 22:56:22,573 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (result_13 == 0) [2024-01-29 22:56:22,574 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardRarity_9 == 0) [2024-01-29 22:56:22,574 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardType_11 == 0) [2024-01-29 22:56:22,574 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardId_6 == 0) [2024-01-29 22:56:22,574 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardRarity_5 == 0) [2024-01-29 22:56:22,574 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (cardSet_4 == 0) && (cardId_10 == 0) [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L106-L106] 1 <= b [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L106-L106] (1 <= b) && (b != 0) [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,575 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,576 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((cardId_2 == 0) && (cardType_3 == 0)) && (cardType_11 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,576 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((cardId_2 == 0) && (cardType_3 == 0)) && (cardType_11 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,576 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (cardId_2 == 0) && (cardType_3 == 0) [2024-01-29 22:56:22,576 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_2 == 0 [2024-01-29 22:56:22,576 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((cardId_2 == 0) && (cardType_3 == 0)) && (cardType_11 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((cardId_2 == 0) && (cardType_3 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,578 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (cardType_11 == 0) && (result_12 == 0) [2024-01-29 22:56:22,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((cardType_11 == 0) && (result_12 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((cardType_11 == 0) && (result_12 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] cardType_11 == 0 [2024-01-29 22:56:22,579 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,579 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,580 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,580 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (cardType_11 == 0) && (result_12 == 0) [2024-01-29 22:56:22,580 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((cardType_11 == 0) && (result_12 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,580 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cardType_11 == 0 [2024-01-29 22:56:22,580 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((cardType_11 == 0) && (result_12 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,581 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,582 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,582 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,582 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0)) && (result_13 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (cardRarity_5 == 0) && (cardId_6 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_5 == 0 [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((cardRarity_5 == 0) && (cardId_6 == 0)) && (cardType_7 == 0)) && (cardId_10 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,583 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,584 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardRarity_9 == 0) [2024-01-29 22:56:22,584 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (cardRarity_9 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,584 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (cardRarity_9 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,584 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (cardRarity_9 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,584 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (cardRarity_9 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,585 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_7 == 0 [2024-01-29 22:56:22,585 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (cardType_7 == 0) && (cardSet_8 == 0) [2024-01-29 22:56:22,586 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((cardType_7 == 0) && (cardRarity_9 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,586 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (cardRarity_9 == 0) && (cardType_11 == 0) [2024-01-29 22:56:22,586 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((cardRarity_9 == 0) && (cardType_11 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,586 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardRarity_9 == 0 [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (cardRarity_9 == 0) && (cardId_10 == 0) [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((cardRarity_9 == 0) && (cardType_11 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((cardRarity_9 == 0) && (cardType_11 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((result_12 == 0) && (result_13 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,587 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (result_12 == 0) && (result_13 == 0) [2024-01-29 22:56:22,590 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_12 == 0 [2024-01-29 22:56:22,590 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,590 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,590 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:22,590 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_1 == 0 [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (cardRarity_1 == 0) && (cardId_2 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (cardRarity_1 == 0) && (cardType_3 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,591 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((cardRarity_1 == 0) && (cardType_3 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((cardRarity_1 == 0) && (cardType_3 == 0)) && (result_12 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] b <= -1 [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] (b <= -1) && (b != 0) [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,592 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardType_11 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,593 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardType_11 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,593 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (cardSet_8 == 0) && (cardRarity_9 == 0) [2024-01-29 22:56:22,593 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardType_11 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,594 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardSet_8 == 0 [2024-01-29 22:56:22,594 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((cardSet_8 == 0) && (cardRarity_9 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardId_6 == 0) [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_3 == 0 [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardSet_4 == 0) [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,595 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] ((cardType_3 == 0) && (cardId_6 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (cardType_3 == 0) && (cardRarity_5 == 0) [2024-01-29 22:56:22,596 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (result_14 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardType_11 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardId_6 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardId_10 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_4 == 0) [2024-01-29 22:56:22,597 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardSet_8 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardType_7 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardRarity_5 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (cardRarity_9 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (result_13 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((((cardSet_0 == 0) && (cardRarity_1 == 0)) && (cardId_2 == 0)) && (cardType_3 == 0)) && (result_12 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (cardSet_0 == 0) && (cardRarity_1 == 0) [2024-01-29 22:56:22,598 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_0 == 0 [2024-01-29 22:56:22,623 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:22,803 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-trans.wvr.c[3520,3533] [2024-01-29 22:56:22,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:22,825 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:56:22,836 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,976 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-trans.wvr.c[3520,3533] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:22,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:22,993 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:22,996 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22 WrapperNode [2024-01-29 22:56:22,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:22,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:22,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:22,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:23,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,069 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 540 [2024-01-29 22:56:23,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:23,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:23,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:23,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:23,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,127 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:23,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:23,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:23,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:23,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:23,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (1/1) ... [2024-01-29 22:56:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:23,199 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:23,219 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:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:23,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:23,247 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:23,366 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:23,368 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:24,060 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:24,060 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:25,028 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:25,033 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:56:25,033 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:25 BoogieIcfgContainer [2024-01-29 22:56:25,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:25,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:25,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:25,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:25,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:22" (1/4) ... [2024-01-29 22:56:25,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f014a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:25, skipping insertion in model container [2024-01-29 22:56:25,055 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:22" (2/4) ... [2024-01-29 22:56:25,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f014a40 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:25, skipping insertion in model container [2024-01-29 22:56:25,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:22" (3/4) ... [2024-01-29 22:56:25,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f014a40 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:25, skipping insertion in model container [2024-01-29 22:56:25,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:25" (4/4) ... [2024-01-29 22:56:25,057 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2024-01-29 22:56:25,071 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:25,071 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 178 error locations. [2024-01-29 22:56:25,071 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:25,381 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:56:25,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 22:56:25,481 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2024-01-29 22:56:25,482 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:25,483 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:25,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 22:56:25,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 320 transitions, 658 flow [2024-01-29 22:56:25,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:25,501 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;@5327afaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:25,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 241 error locations. [2024-01-29 22:56:25,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:25,503 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:25,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:25,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:25,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:25,504 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:25,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 66390, now seen corresponding path program 1 times [2024-01-29 22:56:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929261207] [2024-01-29 22:56:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:25,642 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,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929261207] [2024-01-29 22:56:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929261207] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:25,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000724393] [2024-01-29 22:56:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:25,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:25,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:25,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:25,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 320 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:25,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:25,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:25,925 INFO L124 PetriNetUnfolderBase]: 279/744 cut-off events. [2024-01-29 22:56:25,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:25,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 744 events. 279/744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3311 event pairs, 279 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 995. Up to 461 conditions per place. [2024-01-29 22:56:25,933 INFO L140 encePairwiseOnDemand]: 273/324 looper letters, 41 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-01-29 22:56:25,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 258 transitions, 611 flow [2024-01-29 22:56:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-01-29 22:56:25,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.779835390946502 [2024-01-29 22:56:25,947 INFO L175 Difference]: Start difference. First operand has 330 places, 320 transitions, 658 flow. Second operand 3 states and 758 transitions. [2024-01-29 22:56:25,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 258 transitions, 611 flow [2024-01-29 22:56:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 258 transitions, 608 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:25,955 INFO L231 Difference]: Finished difference. Result has 267 places, 258 transitions, 526 flow [2024-01-29 22:56:25,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=267, PETRI_TRANSITIONS=258} [2024-01-29 22:56:25,960 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -63 predicate places. [2024-01-29 22:56:25,960 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 258 transitions, 526 flow [2024-01-29 22:56:25,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:25,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:25,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:25,961 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,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2059997, now seen corresponding path program 1 times [2024-01-29 22:56:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361868306] [2024-01-29 22:56:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,093 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,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361868306] [2024-01-29 22:56:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361868306] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021195003] [2024-01-29 22:56:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:26,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,267 INFO L124 PetriNetUnfolderBase]: 279/743 cut-off events. [2024-01-29 22:56:26,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 743 events. 279/743 cut-off events. For 0/0 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/380 useless extension candidates. Maximal degree in co-relation 1216. Up to 462 conditions per place. [2024-01-29 22:56:26,272 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 41 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-01-29 22:56:26,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 610 flow [2024-01-29 22:56:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-29 22:56:26,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727366255144033 [2024-01-29 22:56:26,274 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 526 flow. Second operand 3 states and 707 transitions. [2024-01-29 22:56:26,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 610 flow [2024-01-29 22:56:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 257 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,278 INFO L231 Difference]: Finished difference. Result has 266 places, 257 transitions, 524 flow [2024-01-29 22:56:26,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=266, PETRI_TRANSITIONS=257} [2024-01-29 22:56:26,279 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -64 predicate places. [2024-01-29 22:56:26,279 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 257 transitions, 524 flow [2024-01-29 22:56:26,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:26,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:26,280 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:26,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 63861894, now seen corresponding path program 1 times [2024-01-29 22:56:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412338047] [2024-01-29 22:56:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,334 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,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412338047] [2024-01-29 22:56:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412338047] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782431257] [2024-01-29 22:56:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 324 [2024-01-29 22:56:26,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 257 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 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,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 324 [2024-01-29 22:56:26,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,641 INFO L124 PetriNetUnfolderBase]: 279/740 cut-off events. [2024-01-29 22:56:26,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 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 3327 event pairs, 279 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1223. Up to 469 conditions per place. [2024-01-29 22:56:26,645 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-01-29 22:56:26,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 254 transitions, 594 flow [2024-01-29 22:56:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-01-29 22:56:26,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7304526748971193 [2024-01-29 22:56:26,648 INFO L175 Difference]: Start difference. First operand has 266 places, 257 transitions, 524 flow. Second operand 3 states and 710 transitions. [2024-01-29 22:56:26,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 254 transitions, 594 flow [2024-01-29 22:56:26,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 254 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,651 INFO L231 Difference]: Finished difference. Result has 263 places, 254 transitions, 518 flow [2024-01-29 22:56:26,652 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:26,652 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -67 predicate places. [2024-01-29 22:56:26,652 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 254 transitions, 518 flow [2024-01-29 22:56:26,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 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,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:56:26,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:26,653 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,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1979720808, now seen corresponding path program 1 times [2024-01-29 22:56:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995279054] [2024-01-29 22:56:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,703 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,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995279054] [2024-01-29 22:56:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995279054] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329713025] [2024-01-29 22:56:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 324 [2024-01-29 22:56:26,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 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,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 324 [2024-01-29 22:56:26,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,970 INFO L124 PetriNetUnfolderBase]: 279/739 cut-off events. [2024-01-29 22:56:26,970 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:26,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 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 3349 event pairs, 279 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 1222. Up to 468 conditions per place. [2024-01-29 22:56:26,974 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-01-29 22:56:26,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 253 transitions, 590 flow [2024-01-29 22:56:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-01-29 22:56:26,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7304526748971193 [2024-01-29 22:56:26,977 INFO L175 Difference]: Start difference. First operand has 263 places, 254 transitions, 518 flow. Second operand 3 states and 710 transitions. [2024-01-29 22:56:26,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 253 transitions, 590 flow [2024-01-29 22:56:26,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 253 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,980 INFO L231 Difference]: Finished difference. Result has 262 places, 253 transitions, 516 flow [2024-01-29 22:56:26,981 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,981 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -68 predicate places. [2024-01-29 22:56:26,981 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 253 transitions, 516 flow [2024-01-29 22:56:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 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,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:56:26,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:26,983 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,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1241804932, now seen corresponding path program 1 times [2024-01-29 22:56:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17153068] [2024-01-29 22:56:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,030 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,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17153068] [2024-01-29 22:56:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17153068] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679637302] [2024-01-29 22:56:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:27,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 253 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:27,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,319 INFO L124 PetriNetUnfolderBase]: 279/738 cut-off events. [2024-01-29 22:56:27,319 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:27,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 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 3359 event pairs, 279 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1224. Up to 470 conditions per place. [2024-01-29 22:56:27,323 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 22:56:27,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 592 flow [2024-01-29 22:56:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:27,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:27,326 INFO L175 Difference]: Start difference. First operand has 262 places, 253 transitions, 516 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:27,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 592 flow [2024-01-29 22:56:27,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 252 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,329 INFO L231 Difference]: Finished difference. Result has 261 places, 252 transitions, 514 flow [2024-01-29 22:56:27,329 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:27,330 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -69 predicate places. [2024-01-29 22:56:27,330 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 252 transitions, 514 flow [2024-01-29 22:56:27,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:27,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:27,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -158750849, now seen corresponding path program 1 times [2024-01-29 22:56:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443104640] [2024-01-29 22:56:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,383 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,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443104640] [2024-01-29 22:56:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443104640] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897103431] [2024-01-29 22:56:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:27,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:27,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,692 INFO L124 PetriNetUnfolderBase]: 279/737 cut-off events. [2024-01-29 22:56:27,692 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:27,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 737 events. 279/737 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3366 event pairs, 279 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 1225. Up to 471 conditions per place. [2024-01-29 22:56:27,696 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-01-29 22:56:27,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 251 transitions, 592 flow [2024-01-29 22:56:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 22:56:27,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7242798353909465 [2024-01-29 22:56:27,698 INFO L175 Difference]: Start difference. First operand has 261 places, 252 transitions, 514 flow. Second operand 3 states and 704 transitions. [2024-01-29 22:56:27,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 251 transitions, 592 flow [2024-01-29 22:56:27,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 251 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,701 INFO L231 Difference]: Finished difference. Result has 260 places, 251 transitions, 512 flow [2024-01-29 22:56:27,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=260, PETRI_TRANSITIONS=251} [2024-01-29 22:56:27,704 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -70 predicate places. [2024-01-29 22:56:27,704 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 251 transitions, 512 flow [2024-01-29 22:56:27,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:27,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:27,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -626306855, now seen corresponding path program 1 times [2024-01-29 22:56:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032668423] [2024-01-29 22:56:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,749 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,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032668423] [2024-01-29 22:56:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032668423] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299993413] [2024-01-29 22:56:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:27,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 251 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:27,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,075 INFO L124 PetriNetUnfolderBase]: 279/736 cut-off events. [2024-01-29 22:56:28,075 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 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 3368 event pairs, 279 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1224. Up to 470 conditions per place. [2024-01-29 22:56:28,079 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-01-29 22:56:28,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 250 transitions, 588 flow [2024-01-29 22:56:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:28,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:28,081 INFO L175 Difference]: Start difference. First operand has 260 places, 251 transitions, 512 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:28,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 250 transitions, 588 flow [2024-01-29 22:56:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 250 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,084 INFO L231 Difference]: Finished difference. Result has 259 places, 250 transitions, 510 flow [2024-01-29 22:56:28,084 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:28,084 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -71 predicate places. [2024-01-29 22:56:28,085 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 250 transitions, 510 flow [2024-01-29 22:56:28,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:28,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash -585401384, now seen corresponding path program 1 times [2024-01-29 22:56:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099333441] [2024-01-29 22:56:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,120 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099333441] [2024-01-29 22:56:28,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099333441] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335742365] [2024-01-29 22:56:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 250 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,397 INFO L124 PetriNetUnfolderBase]: 279/735 cut-off events. [2024-01-29 22:56:28,398 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 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 3392 event pairs, 279 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1224. Up to 470 conditions per place. [2024-01-29 22:56:28,401 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-01-29 22:56:28,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 249 transitions, 586 flow [2024-01-29 22:56:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:28,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:28,409 INFO L175 Difference]: Start difference. First operand has 259 places, 250 transitions, 510 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:28,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 249 transitions, 586 flow [2024-01-29 22:56:28,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,413 INFO L231 Difference]: Finished difference. Result has 258 places, 249 transitions, 508 flow [2024-01-29 22:56:28,414 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:28,414 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -72 predicate places. [2024-01-29 22:56:28,415 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 249 transitions, 508 flow [2024-01-29 22:56:28,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:28,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash -967571659, now seen corresponding path program 1 times [2024-01-29 22:56:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481306622] [2024-01-29 22:56:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,453 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,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481306622] [2024-01-29 22:56:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481306622] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338006098] [2024-01-29 22:56:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:28,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 249 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:28,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,728 INFO L124 PetriNetUnfolderBase]: 279/734 cut-off events. [2024-01-29 22:56:28,728 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:28,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 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 3403 event pairs, 279 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 1225. Up to 471 conditions per place. [2024-01-29 22:56:28,731 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-29 22:56:28,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 248 transitions, 586 flow [2024-01-29 22:56:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 22:56:28,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7242798353909465 [2024-01-29 22:56:28,734 INFO L175 Difference]: Start difference. First operand has 258 places, 249 transitions, 508 flow. Second operand 3 states and 704 transitions. [2024-01-29 22:56:28,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 248 transitions, 586 flow [2024-01-29 22:56:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 248 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,737 INFO L231 Difference]: Finished difference. Result has 257 places, 248 transitions, 506 flow [2024-01-29 22:56:28,737 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:28,738 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -73 predicate places. [2024-01-29 22:56:28,738 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 248 transitions, 506 flow [2024-01-29 22:56:28,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:28,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:28,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 70051848, now seen corresponding path program 1 times [2024-01-29 22:56:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235276802] [2024-01-29 22:56:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,797 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,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235276802] [2024-01-29 22:56:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235276802] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459403309] [2024-01-29 22:56:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:28,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:28,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,061 INFO L124 PetriNetUnfolderBase]: 279/733 cut-off events. [2024-01-29 22:56:29,061 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 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 3430 event pairs, 279 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 1224. Up to 470 conditions per place. [2024-01-29 22:56:29,064 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2024-01-29 22:56:29,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 247 transitions, 582 flow [2024-01-29 22:56:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:29,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:29,066 INFO L175 Difference]: Start difference. First operand has 257 places, 248 transitions, 506 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:29,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 247 transitions, 582 flow [2024-01-29 22:56:29,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,069 INFO L231 Difference]: Finished difference. Result has 256 places, 247 transitions, 504 flow [2024-01-29 22:56:29,070 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:29,070 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -74 predicate places. [2024-01-29 22:56:29,070 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 247 transitions, 504 flow [2024-01-29 22:56:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:29,071 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2123357953, now seen corresponding path program 1 times [2024-01-29 22:56:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356413676] [2024-01-29 22:56:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,123 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,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356413676] [2024-01-29 22:56:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356413676] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697571292] [2024-01-29 22:56:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:29,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 247 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,361 INFO L124 PetriNetUnfolderBase]: 279/732 cut-off events. [2024-01-29 22:56:29,361 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 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 3433 event pairs, 279 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 1225. Up to 471 conditions per place. [2024-01-29 22:56:29,364 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-01-29 22:56:29,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 246 transitions, 582 flow [2024-01-29 22:56:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 22:56:29,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7242798353909465 [2024-01-29 22:56:29,366 INFO L175 Difference]: Start difference. First operand has 256 places, 247 transitions, 504 flow. Second operand 3 states and 704 transitions. [2024-01-29 22:56:29,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 246 transitions, 582 flow [2024-01-29 22:56:29,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 246 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,369 INFO L231 Difference]: Finished difference. Result has 255 places, 246 transitions, 502 flow [2024-01-29 22:56:29,370 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:29,370 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -75 predicate places. [2024-01-29 22:56:29,370 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 246 transitions, 502 flow [2024-01-29 22:56:29,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:29,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1399585102, now seen corresponding path program 1 times [2024-01-29 22:56:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501785362] [2024-01-29 22:56:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,423 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,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501785362] [2024-01-29 22:56:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501785362] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261931962] [2024-01-29 22:56:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 324 [2024-01-29 22:56:29,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 246 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 324 [2024-01-29 22:56:29,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,680 INFO L124 PetriNetUnfolderBase]: 279/731 cut-off events. [2024-01-29 22:56:29,681 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:29,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 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/373 useless extension candidates. Maximal degree in co-relation 1224. Up to 470 conditions per place. [2024-01-29 22:56:29,684 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 22:56:29,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 578 flow [2024-01-29 22:56:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-01-29 22:56:29,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263374485596708 [2024-01-29 22:56:29,686 INFO L175 Difference]: Start difference. First operand has 255 places, 246 transitions, 502 flow. Second operand 3 states and 706 transitions. [2024-01-29 22:56:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 578 flow [2024-01-29 22:56:29,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 245 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,689 INFO L231 Difference]: Finished difference. Result has 254 places, 245 transitions, 500 flow [2024-01-29 22:56:29,690 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:29,690 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -76 predicate places. [2024-01-29 22:56:29,690 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 245 transitions, 500 flow [2024-01-29 22:56:29,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:29,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:29,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -437463187, now seen corresponding path program 1 times [2024-01-29 22:56:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332669841] [2024-01-29 22:56:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,744 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,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332669841] [2024-01-29 22:56:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332669841] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012201359] [2024-01-29 22:56:29,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 324 [2024-01-29 22:56:29,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 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,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 324 [2024-01-29 22:56:29,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,035 INFO L124 PetriNetUnfolderBase]: 279/730 cut-off events. [2024-01-29 22:56:30,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:30,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 730 events. 279/730 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3390 event pairs, 279 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 1221. Up to 467 conditions per place. [2024-01-29 22:56:30,038 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-01-29 22:56:30,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 244 transitions, 570 flow [2024-01-29 22:56:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-01-29 22:56:30,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7325102880658436 [2024-01-29 22:56:30,042 INFO L175 Difference]: Start difference. First operand has 254 places, 245 transitions, 500 flow. Second operand 3 states and 712 transitions. [2024-01-29 22:56:30,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 244 transitions, 570 flow [2024-01-29 22:56:30,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 244 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,045 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 498 flow [2024-01-29 22:56:30,045 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:30,045 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -77 predicate places. [2024-01-29 22:56:30,045 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 498 flow [2024-01-29 22:56:30,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 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,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,046 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:30,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:30,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash 504741570, now seen corresponding path program 1 times [2024-01-29 22:56:30,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61533035] [2024-01-29 22:56:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,092 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,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61533035] [2024-01-29 22:56:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61533035] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736694039] [2024-01-29 22:56:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:30,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 498 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,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:30,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,351 INFO L124 PetriNetUnfolderBase]: 279/726 cut-off events. [2024-01-29 22:56:30,351 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 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 3397 event pairs, 279 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1214. Up to 462 conditions per place. [2024-01-29 22:56:30,355 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-29 22:56:30,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 240 transitions, 554 flow [2024-01-29 22:56:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:30,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:30,357 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 498 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:30,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 240 transitions, 554 flow [2024-01-29 22:56:30,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 240 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,360 INFO L231 Difference]: Finished difference. Result has 249 places, 240 transitions, 490 flow [2024-01-29 22:56:30,360 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:30,361 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -81 predicate places. [2024-01-29 22:56:30,361 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 240 transitions, 490 flow [2024-01-29 22:56:30,361 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,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:30,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1532878328, now seen corresponding path program 1 times [2024-01-29 22:56:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615592455] [2024-01-29 22:56:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,390 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,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615592455] [2024-01-29 22:56:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615592455] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290382538] [2024-01-29 22:56:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:30,554 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.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:30,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:30,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,627 INFO L124 PetriNetUnfolderBase]: 279/725 cut-off events. [2024-01-29 22:56:30,628 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 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 3396 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:30,631 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-01-29 22:56:30,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 239 transitions, 554 flow [2024-01-29 22:56:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:30,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:30,633 INFO L175 Difference]: Start difference. First operand has 249 places, 240 transitions, 490 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:30,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 239 transitions, 554 flow [2024-01-29 22:56:30,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 239 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,636 INFO L231 Difference]: Finished difference. Result has 248 places, 239 transitions, 488 flow [2024-01-29 22:56:30,636 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:30,636 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -82 predicate places. [2024-01-29 22:56:30,637 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 239 transitions, 488 flow [2024-01-29 22:56:30,637 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:30,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,637 INFO L208 CegarLoopForPetriNet]: trace histogram [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,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:30,638 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -274585830, now seen corresponding path program 1 times [2024-01-29 22:56:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777038879] [2024-01-29 22:56:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,665 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,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777038879] [2024-01-29 22:56:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777038879] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821396418] [2024-01-29 22:56:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:30,808 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.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:30,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:30,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,886 INFO L124 PetriNetUnfolderBase]: 279/724 cut-off events. [2024-01-29 22:56:30,886 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:30,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 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 3379 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:30,889 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 22:56:30,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 238 transitions, 554 flow [2024-01-29 22:56:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:30,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:30,891 INFO L175 Difference]: Start difference. First operand has 248 places, 239 transitions, 488 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:30,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 238 transitions, 554 flow [2024-01-29 22:56:30,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 238 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,894 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 486 flow [2024-01-29 22:56:30,894 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:30,894 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -83 predicate places. [2024-01-29 22:56:30,895 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 486 flow [2024-01-29 22:56:30,895 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:30,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,895 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:30,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:30,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:30,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash 77775791, now seen corresponding path program 1 times [2024-01-29 22:56:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771997021] [2024-01-29 22:56:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,925 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,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771997021] [2024-01-29 22:56:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771997021] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578147442] [2024-01-29 22:56:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:31,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 486 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:31,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:31,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,192 INFO L124 PetriNetUnfolderBase]: 279/723 cut-off events. [2024-01-29 22:56:31,192 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:31,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 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 3418 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:31,195 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-01-29 22:56:31,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 237 transitions, 550 flow [2024-01-29 22:56:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:31,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:31,197 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 486 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:31,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 237 transitions, 550 flow [2024-01-29 22:56:31,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,200 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 484 flow [2024-01-29 22:56:31,200 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:31,201 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -84 predicate places. [2024-01-29 22:56:31,201 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 484 flow [2024-01-29 22:56:31,201 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:31,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,202 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:31,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:31,202 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1728153415, now seen corresponding path program 1 times [2024-01-29 22:56:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184481643] [2024-01-29 22:56:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184481643] [2024-01-29 22:56:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184481643] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141454968] [2024-01-29 22:56:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 484 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:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,509 INFO L124 PetriNetUnfolderBase]: 279/722 cut-off events. [2024-01-29 22:56:31,509 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 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 3380 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1187. Up to 461 conditions per place. [2024-01-29 22:56:31,512 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-01-29 22:56:31,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 236 transitions, 546 flow [2024-01-29 22:56:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:31,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:31,515 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 484 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:31,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 236 transitions, 546 flow [2024-01-29 22:56:31,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 236 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,518 INFO L231 Difference]: Finished difference. Result has 245 places, 236 transitions, 482 flow [2024-01-29 22:56:31,518 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:31,518 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -85 predicate places. [2024-01-29 22:56:31,518 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 236 transitions, 482 flow [2024-01-29 22:56:31,519 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:31,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,519 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] [2024-01-29 22:56:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:56:31,519 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2033150473, now seen corresponding path program 1 times [2024-01-29 22:56:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421565423] [2024-01-29 22:56:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,552 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,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421565423] [2024-01-29 22:56:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421565423] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387196057] [2024-01-29 22:56:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:31,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 236 transitions, 482 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:31,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:31,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,801 INFO L124 PetriNetUnfolderBase]: 279/721 cut-off events. [2024-01-29 22:56:31,801 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:31,802 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 3379 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:31,804 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-01-29 22:56:31,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 235 transitions, 546 flow [2024-01-29 22:56:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:31,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:31,806 INFO L175 Difference]: Start difference. First operand has 245 places, 236 transitions, 482 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:31,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 235 transitions, 546 flow [2024-01-29 22:56:31,807 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:31,809 INFO L231 Difference]: Finished difference. Result has 244 places, 235 transitions, 480 flow [2024-01-29 22:56:31,809 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:31,810 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -86 predicate places. [2024-01-29 22:56:31,810 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 235 transitions, 480 flow [2024-01-29 22:56:31,810 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:31,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,811 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:31,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:56:31,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:31,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1396842582, now seen corresponding path program 1 times [2024-01-29 22:56:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618107725] [2024-01-29 22:56:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,842 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,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618107725] [2024-01-29 22:56:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618107725] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391654540] [2024-01-29 22:56:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:32,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 235 transitions, 480 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:32,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:32,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,119 INFO L124 PetriNetUnfolderBase]: 279/720 cut-off events. [2024-01-29 22:56:32,119 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,120 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 3373 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:32,123 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-01-29 22:56:32,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 234 transitions, 544 flow [2024-01-29 22:56:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:32,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:32,125 INFO L175 Difference]: Start difference. First operand has 244 places, 235 transitions, 480 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:32,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 234 transitions, 544 flow [2024-01-29 22:56:32,126 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:32,128 INFO L231 Difference]: Finished difference. Result has 243 places, 234 transitions, 478 flow [2024-01-29 22:56:32,129 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:32,129 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -87 predicate places. [2024-01-29 22:56:32,129 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 234 transitions, 478 flow [2024-01-29 22:56:32,130 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:32,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,130 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:32,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:56:32,130 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -352444902, now seen corresponding path program 1 times [2024-01-29 22:56:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803975670] [2024-01-29 22:56:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,163 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,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803975670] [2024-01-29 22:56:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803975670] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730112841] [2024-01-29 22:56:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:32,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 234 transitions, 478 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:32,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:32,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,397 INFO L124 PetriNetUnfolderBase]: 279/719 cut-off events. [2024-01-29 22:56:32,397 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 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 3371 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:32,400 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-01-29 22:56:32,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 233 transitions, 544 flow [2024-01-29 22:56:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:32,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:32,402 INFO L175 Difference]: Start difference. First operand has 243 places, 234 transitions, 478 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:32,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 233 transitions, 544 flow [2024-01-29 22:56:32,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 233 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,405 INFO L231 Difference]: Finished difference. Result has 242 places, 233 transitions, 476 flow [2024-01-29 22:56:32,406 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:32,406 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -88 predicate places. [2024-01-29 22:56:32,406 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 233 transitions, 476 flow [2024-01-29 22:56:32,407 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:32,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,407 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:32,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:56:32,407 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1959112123, now seen corresponding path program 1 times [2024-01-29 22:56:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112380570] [2024-01-29 22:56:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,437 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,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112380570] [2024-01-29 22:56:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112380570] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646153602] [2024-01-29 22:56:32,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:32,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 233 transitions, 476 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:32,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:32,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,669 INFO L124 PetriNetUnfolderBase]: 279/718 cut-off events. [2024-01-29 22:56:32,669 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,670 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 3341 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1188. Up to 462 conditions per place. [2024-01-29 22:56:32,672 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-01-29 22:56:32,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 232 transitions, 540 flow [2024-01-29 22:56:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:32,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:32,674 INFO L175 Difference]: Start difference. First operand has 242 places, 233 transitions, 476 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:32,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 232 transitions, 540 flow [2024-01-29 22:56:32,675 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:32,677 INFO L231 Difference]: Finished difference. Result has 241 places, 232 transitions, 474 flow [2024-01-29 22:56:32,677 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:32,677 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -89 predicate places. [2024-01-29 22:56:32,677 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 232 transitions, 474 flow [2024-01-29 22:56:32,678 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:32,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,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] [2024-01-29 22:56:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:56:32,678 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash 602935596, now seen corresponding path program 1 times [2024-01-29 22:56:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952245402] [2024-01-29 22:56:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,703 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,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952245402] [2024-01-29 22:56:32,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952245402] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762149371] [2024-01-29 22:56:32,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:32,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 232 transitions, 474 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:32,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:32,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,893 INFO L124 PetriNetUnfolderBase]: 279/717 cut-off events. [2024-01-29 22:56:32,893 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:32,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 717 events. 279/717 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3359 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1187. Up to 461 conditions per place. [2024-01-29 22:56:32,896 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 41 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-01-29 22:56:32,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 231 transitions, 558 flow [2024-01-29 22:56:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-29 22:56:32,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727366255144033 [2024-01-29 22:56:32,898 INFO L175 Difference]: Start difference. First operand has 241 places, 232 transitions, 474 flow. Second operand 3 states and 707 transitions. [2024-01-29 22:56:32,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 231 transitions, 558 flow [2024-01-29 22:56:32,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 231 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,901 INFO L231 Difference]: Finished difference. Result has 240 places, 231 transitions, 472 flow [2024-01-29 22:56:32,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=240, PETRI_TRANSITIONS=231} [2024-01-29 22:56:32,902 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -90 predicate places. [2024-01-29 22:56:32,902 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 231 transitions, 472 flow [2024-01-29 22:56:32,902 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:32,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,902 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:32,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:56:32,903 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:32,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash -399410046, now seen corresponding path program 1 times [2024-01-29 22:56:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526002378] [2024-01-29 22:56:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,931 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,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526002378] [2024-01-29 22:56:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526002378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118442349] [2024-01-29 22:56:32,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:33,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 231 transitions, 472 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:33,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:33,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,149 INFO L124 PetriNetUnfolderBase]: 279/716 cut-off events. [2024-01-29 22:56:33,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:33,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 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 3322 event pairs, 279 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 1189. Up to 463 conditions per place. [2024-01-29 22:56:33,156 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-01-29 22:56:33,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 230 transitions, 538 flow [2024-01-29 22:56:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:33,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:33,158 INFO L175 Difference]: Start difference. First operand has 240 places, 231 transitions, 472 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:33,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 230 transitions, 538 flow [2024-01-29 22:56:33,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 230 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,161 INFO L231 Difference]: Finished difference. Result has 239 places, 230 transitions, 470 flow [2024-01-29 22:56:33,162 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:33,162 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -91 predicate places. [2024-01-29 22:56:33,162 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 230 transitions, 470 flow [2024-01-29 22:56:33,162 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:33,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,163 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:33,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:56:33,163 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1580898199, now seen corresponding path program 1 times [2024-01-29 22:56:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791850143] [2024-01-29 22:56:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,194 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,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791850143] [2024-01-29 22:56:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791850143] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733761333] [2024-01-29 22:56:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:33,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 230 transitions, 470 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:33,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:33,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,404 INFO L124 PetriNetUnfolderBase]: 279/713 cut-off events. [2024-01-29 22:56:33,404 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 713 events. 279/713 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3306 event pairs, 279 based on Foata normal form. 2/370 useless extension candidates. Maximal degree in co-relation 1187. Up to 462 conditions per place. [2024-01-29 22:56:33,406 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-01-29 22:56:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 532 flow [2024-01-29 22:56:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:33,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:33,408 INFO L175 Difference]: Start difference. First operand has 239 places, 230 transitions, 470 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:33,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 532 flow [2024-01-29 22:56:33,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 227 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,411 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 464 flow [2024-01-29 22:56:33,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=236, PETRI_TRANSITIONS=227} [2024-01-29 22:56:33,412 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -94 predicate places. [2024-01-29 22:56:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 464 flow [2024-01-29 22:56:33,412 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:33,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,412 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:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:56:33,413 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1763201725, now seen corresponding path program 1 times [2024-01-29 22:56:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444187514] [2024-01-29 22:56:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,442 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,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444187514] [2024-01-29 22:56:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444187514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476353666] [2024-01-29 22:56:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:33,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 227 transitions, 464 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:33,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:33,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,661 INFO L124 PetriNetUnfolderBase]: 279/712 cut-off events. [2024-01-29 22:56:33,661 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 712 events. 279/712 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. 0/367 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:33,664 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-01-29 22:56:33,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 226 transitions, 528 flow [2024-01-29 22:56:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:33,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:33,666 INFO L175 Difference]: Start difference. First operand has 236 places, 227 transitions, 464 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:33,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 226 transitions, 528 flow [2024-01-29 22:56:33,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,668 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 462 flow [2024-01-29 22:56:33,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2024-01-29 22:56:33,669 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -95 predicate places. [2024-01-29 22:56:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 462 flow [2024-01-29 22:56:33,669 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:33,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,670 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:33,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:56:33,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1175323278, now seen corresponding path program 1 times [2024-01-29 22:56:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196910574] [2024-01-29 22:56:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,701 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,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196910574] [2024-01-29 22:56:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196910574] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015182129] [2024-01-29 22:56:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:33,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 462 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:33,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:33,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,939 INFO L124 PetriNetUnfolderBase]: 279/711 cut-off events. [2024-01-29 22:56:33,939 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 711 events. 279/711 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3357 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:33,941 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-01-29 22:56:33,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 526 flow [2024-01-29 22:56:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:33,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:33,943 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 462 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:33,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 526 flow [2024-01-29 22:56:33,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 225 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,946 INFO L231 Difference]: Finished difference. Result has 234 places, 225 transitions, 460 flow [2024-01-29 22:56:33,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=234, PETRI_TRANSITIONS=225} [2024-01-29 22:56:33,947 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -96 predicate places. [2024-01-29 22:56:33,947 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 225 transitions, 460 flow [2024-01-29 22:56:33,947 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:33,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,947 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] [2024-01-29 22:56:33,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:56:33,947 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:33,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2075285235, now seen corresponding path program 1 times [2024-01-29 22:56:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966436021] [2024-01-29 22:56:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,984 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,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966436021] [2024-01-29 22:56:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966436021] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122856254] [2024-01-29 22:56:33,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:34,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 225 transitions, 460 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:34,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:34,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,210 INFO L124 PetriNetUnfolderBase]: 279/710 cut-off events. [2024-01-29 22:56:34,211 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 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 3338 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1162. Up to 462 conditions per place. [2024-01-29 22:56:34,213 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-01-29 22:56:34,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 224 transitions, 526 flow [2024-01-29 22:56:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:34,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:34,215 INFO L175 Difference]: Start difference. First operand has 234 places, 225 transitions, 460 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:34,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 224 transitions, 526 flow [2024-01-29 22:56:34,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 224 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,218 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 458 flow [2024-01-29 22:56:34,218 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:34,218 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -97 predicate places. [2024-01-29 22:56:34,219 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 458 flow [2024-01-29 22:56:34,219 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:34,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,219 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] [2024-01-29 22:56:34,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:56:34,219 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -90665216, now seen corresponding path program 1 times [2024-01-29 22:56:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187546051] [2024-01-29 22:56:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,302 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,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187546051] [2024-01-29 22:56:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187546051] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723352273] [2024-01-29 22:56:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:34,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 458 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:34,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:34,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,536 INFO L124 PetriNetUnfolderBase]: 279/708 cut-off events. [2024-01-29 22:56:34,536 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 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 3325 event pairs, 279 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:34,539 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-01-29 22:56:34,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 222 transitions, 518 flow [2024-01-29 22:56:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:34,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:34,541 INFO L175 Difference]: Start difference. First operand has 233 places, 224 transitions, 458 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:34,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 222 transitions, 518 flow [2024-01-29 22:56:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 222 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,543 INFO L231 Difference]: Finished difference. Result has 231 places, 222 transitions, 454 flow [2024-01-29 22:56:34,543 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:34,544 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -99 predicate places. [2024-01-29 22:56:34,544 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 222 transitions, 454 flow [2024-01-29 22:56:34,545 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:34,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,545 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] [2024-01-29 22:56:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:56:34,545 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash 529134901, now seen corresponding path program 1 times [2024-01-29 22:56:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524296574] [2024-01-29 22:56:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,582 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,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524296574] [2024-01-29 22:56:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524296574] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560436877] [2024-01-29 22:56:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:34,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:34,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 222 transitions, 454 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:34,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:34,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,810 INFO L124 PetriNetUnfolderBase]: 279/707 cut-off events. [2024-01-29 22:56:34,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:34,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 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 3318 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:34,813 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-01-29 22:56:34,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 221 transitions, 516 flow [2024-01-29 22:56:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:56:34,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7438271604938271 [2024-01-29 22:56:34,815 INFO L175 Difference]: Start difference. First operand has 231 places, 222 transitions, 454 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:56:34,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 221 transitions, 516 flow [2024-01-29 22:56:34,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 221 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,817 INFO L231 Difference]: Finished difference. Result has 230 places, 221 transitions, 452 flow [2024-01-29 22:56:34,818 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:34,818 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -100 predicate places. [2024-01-29 22:56:34,818 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 221 transitions, 452 flow [2024-01-29 22:56:34,818 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:34,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,819 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:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:56:34,819 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:34,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -776685336, now seen corresponding path program 1 times [2024-01-29 22:56:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916517027] [2024-01-29 22:56:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,869 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,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916517027] [2024-01-29 22:56:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916517027] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299004679] [2024-01-29 22:56:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:35,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:35,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,122 INFO L124 PetriNetUnfolderBase]: 279/706 cut-off events. [2024-01-29 22:56:35,123 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 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 3335 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1163. Up to 463 conditions per place. [2024-01-29 22:56:35,125 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-01-29 22:56:35,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 220 transitions, 518 flow [2024-01-29 22:56:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:35,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:35,127 INFO L175 Difference]: Start difference. First operand has 230 places, 221 transitions, 452 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:35,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 220 transitions, 518 flow [2024-01-29 22:56:35,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 220 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,130 INFO L231 Difference]: Finished difference. Result has 229 places, 220 transitions, 450 flow [2024-01-29 22:56:35,130 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:35,130 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -101 predicate places. [2024-01-29 22:56:35,131 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 220 transitions, 450 flow [2024-01-29 22:56:35,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,131 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:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:56:35,131 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1692560336, now seen corresponding path program 1 times [2024-01-29 22:56:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864621436] [2024-01-29 22:56:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,163 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,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864621436] [2024-01-29 22:56:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864621436] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092927720] [2024-01-29 22:56:35,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:35,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 220 transitions, 450 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,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:35,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,372 INFO L124 PetriNetUnfolderBase]: 279/705 cut-off events. [2024-01-29 22:56:35,373 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 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 3346 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:35,375 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2024-01-29 22:56:35,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 219 transitions, 514 flow [2024-01-29 22:56:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:35,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:35,377 INFO L175 Difference]: Start difference. First operand has 229 places, 220 transitions, 450 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:35,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 219 transitions, 514 flow [2024-01-29 22:56:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 219 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,380 INFO L231 Difference]: Finished difference. Result has 228 places, 219 transitions, 448 flow [2024-01-29 22:56:35,380 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:35,380 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -102 predicate places. [2024-01-29 22:56:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 219 transitions, 448 flow [2024-01-29 22:56:35,381 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,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,381 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:35,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-01-29 22:56:35,381 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 929765026, now seen corresponding path program 1 times [2024-01-29 22:56:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900939752] [2024-01-29 22:56:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,418 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,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900939752] [2024-01-29 22:56:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900939752] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824302173] [2024-01-29 22:56:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:35,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 219 transitions, 448 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,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:35,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,644 INFO L124 PetriNetUnfolderBase]: 279/704 cut-off events. [2024-01-29 22:56:35,645 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:35,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 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 3350 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1161. Up to 461 conditions per place. [2024-01-29 22:56:35,647 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2024-01-29 22:56:35,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 218 transitions, 512 flow [2024-01-29 22:56:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:35,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:35,649 INFO L175 Difference]: Start difference. First operand has 228 places, 219 transitions, 448 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:35,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 218 transitions, 512 flow [2024-01-29 22:56:35,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 218 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,652 INFO L231 Difference]: Finished difference. Result has 227 places, 218 transitions, 446 flow [2024-01-29 22:56:35,652 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:35,652 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -103 predicate places. [2024-01-29 22:56:35,653 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 218 transitions, 446 flow [2024-01-29 22:56:35,653 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,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,653 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] [2024-01-29 22:56:35,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-01-29 22:56:35,653 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1242053315, now seen corresponding path program 1 times [2024-01-29 22:56:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562594213] [2024-01-29 22:56:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,689 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,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562594213] [2024-01-29 22:56:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562594213] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849256133] [2024-01-29 22:56:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:35,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 218 transitions, 446 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:35,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:35,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,924 INFO L124 PetriNetUnfolderBase]: 279/703 cut-off events. [2024-01-29 22:56:35,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 703 events. 279/703 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3349 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1162. Up to 462 conditions per place. [2024-01-29 22:56:35,926 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-01-29 22:56:35,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 217 transitions, 512 flow [2024-01-29 22:56:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:35,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:35,928 INFO L175 Difference]: Start difference. First operand has 227 places, 218 transitions, 446 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:35,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 217 transitions, 512 flow [2024-01-29 22:56:35,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 217 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,930 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 444 flow [2024-01-29 22:56:35,930 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:35,931 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -104 predicate places. [2024-01-29 22:56:35,931 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 444 flow [2024-01-29 22:56:35,931 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:35,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,931 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:35,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-01-29 22:56:35,932 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:35,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 387735309, now seen corresponding path program 1 times [2024-01-29 22:56:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16689375] [2024-01-29 22:56:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,958 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,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16689375] [2024-01-29 22:56:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16689375] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916234478] [2024-01-29 22:56:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:36,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 444 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:36,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,145 INFO L124 PetriNetUnfolderBase]: 279/701 cut-off events. [2024-01-29 22:56:36,145 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 701 events. 279/701 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3343 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:36,148 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-01-29 22:56:36,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 215 transitions, 508 flow [2024-01-29 22:56:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:36,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:36,150 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 444 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:36,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 215 transitions, 508 flow [2024-01-29 22:56:36,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 215 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,152 INFO L231 Difference]: Finished difference. Result has 224 places, 215 transitions, 440 flow [2024-01-29 22:56:36,152 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:36,153 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -106 predicate places. [2024-01-29 22:56:36,153 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 215 transitions, 440 flow [2024-01-29 22:56:36,153 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:36,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,153 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:36,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-01-29 22:56:36,154 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash -865105419, now seen corresponding path program 1 times [2024-01-29 22:56:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553095687] [2024-01-29 22:56:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,193 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,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553095687] [2024-01-29 22:56:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553095687] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212324144] [2024-01-29 22:56:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:36,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 215 transitions, 440 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:36,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:36,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,414 INFO L124 PetriNetUnfolderBase]: 279/699 cut-off events. [2024-01-29 22:56:36,414 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 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 3347 event pairs, 279 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:36,416 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-01-29 22:56:36,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 213 transitions, 498 flow [2024-01-29 22:56:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:36,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:36,418 INFO L175 Difference]: Start difference. First operand has 224 places, 215 transitions, 440 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:36,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 213 transitions, 498 flow [2024-01-29 22:56:36,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 213 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,420 INFO L231 Difference]: Finished difference. Result has 222 places, 213 transitions, 436 flow [2024-01-29 22:56:36,421 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:36,421 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -108 predicate places. [2024-01-29 22:56:36,421 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 213 transitions, 436 flow [2024-01-29 22:56:36,421 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:36,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,422 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:36,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-01-29 22:56:36,422 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1048462047, now seen corresponding path program 1 times [2024-01-29 22:56:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802279917] [2024-01-29 22:56:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,453 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,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802279917] [2024-01-29 22:56:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802279917] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34125213] [2024-01-29 22:56:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:36,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 213 transitions, 436 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:36,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:36,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,691 INFO L124 PetriNetUnfolderBase]: 279/698 cut-off events. [2024-01-29 22:56:36,691 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 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 3336 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:36,693 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-01-29 22:56:36,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 212 transitions, 498 flow [2024-01-29 22:56:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:36,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:36,695 INFO L175 Difference]: Start difference. First operand has 222 places, 213 transitions, 436 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:36,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 212 transitions, 498 flow [2024-01-29 22:56:36,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 212 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,698 INFO L231 Difference]: Finished difference. Result has 221 places, 212 transitions, 434 flow [2024-01-29 22:56:36,698 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:36,699 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -109 predicate places. [2024-01-29 22:56:36,699 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 434 flow [2024-01-29 22:56:36,699 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:36,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,699 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:36,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-01-29 22:56:36,700 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1857417027, now seen corresponding path program 1 times [2024-01-29 22:56:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580207574] [2024-01-29 22:56:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,741 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,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580207574] [2024-01-29 22:56:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580207574] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834266310] [2024-01-29 22:56:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:36,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 212 transitions, 434 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:36,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:36,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,979 INFO L124 PetriNetUnfolderBase]: 279/697 cut-off events. [2024-01-29 22:56:36,980 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:36,980 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 3315 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:36,982 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-01-29 22:56:36,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 211 transitions, 496 flow [2024-01-29 22:56:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:36,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:36,984 INFO L175 Difference]: Start difference. First operand has 221 places, 212 transitions, 434 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:36,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 211 transitions, 496 flow [2024-01-29 22:56:36,985 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:36,987 INFO L231 Difference]: Finished difference. Result has 220 places, 211 transitions, 432 flow [2024-01-29 22:56:36,987 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:36,987 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -110 predicate places. [2024-01-29 22:56:36,987 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 211 transitions, 432 flow [2024-01-29 22:56:36,988 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:36,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,988 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:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-01-29 22:56:36,988 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:36,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1745355163, now seen corresponding path program 1 times [2024-01-29 22:56:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031690862] [2024-01-29 22:56:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,023 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,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031690862] [2024-01-29 22:56:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031690862] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640949789] [2024-01-29 22:56:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:37,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 211 transitions, 432 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:37,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:37,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,258 INFO L124 PetriNetUnfolderBase]: 279/696 cut-off events. [2024-01-29 22:56:37,258 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 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 3298 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:37,261 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-01-29 22:56:37,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 210 transitions, 496 flow [2024-01-29 22:56:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:37,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:37,263 INFO L175 Difference]: Start difference. First operand has 220 places, 211 transitions, 432 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:37,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 210 transitions, 496 flow [2024-01-29 22:56:37,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 210 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,266 INFO L231 Difference]: Finished difference. Result has 219 places, 210 transitions, 430 flow [2024-01-29 22:56:37,266 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:37,267 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -111 predicate places. [2024-01-29 22:56:37,267 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 210 transitions, 430 flow [2024-01-29 22:56:37,267 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:37,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,267 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:37,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-01-29 22:56:37,268 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1728562901, now seen corresponding path program 1 times [2024-01-29 22:56:37,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329258804] [2024-01-29 22:56:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,268 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,306 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,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329258804] [2024-01-29 22:56:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329258804] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366411460] [2024-01-29 22:56:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:37,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 210 transitions, 430 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:37,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:37,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,571 INFO L124 PetriNetUnfolderBase]: 279/695 cut-off events. [2024-01-29 22:56:37,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,572 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 3304 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:37,574 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-01-29 22:56:37,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 209 transitions, 492 flow [2024-01-29 22:56:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:37,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:37,576 INFO L175 Difference]: Start difference. First operand has 219 places, 210 transitions, 430 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:37,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 209 transitions, 492 flow [2024-01-29 22:56:37,577 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:37,579 INFO L231 Difference]: Finished difference. Result has 218 places, 209 transitions, 428 flow [2024-01-29 22:56:37,579 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:37,579 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -112 predicate places. [2024-01-29 22:56:37,579 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 209 transitions, 428 flow [2024-01-29 22:56:37,580 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:37,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,580 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:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-01-29 22:56:37,580 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2045840309, now seen corresponding path program 1 times [2024-01-29 22:56:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930046234] [2024-01-29 22:56:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,623 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,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930046234] [2024-01-29 22:56:37,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930046234] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295908270] [2024-01-29 22:56:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:37,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 209 transitions, 428 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:37,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:37,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,882 INFO L124 PetriNetUnfolderBase]: 279/694 cut-off events. [2024-01-29 22:56:37,883 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:37,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 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 3338 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:37,885 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-01-29 22:56:37,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 208 transitions, 490 flow [2024-01-29 22:56:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:37,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:37,887 INFO L175 Difference]: Start difference. First operand has 218 places, 209 transitions, 428 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 208 transitions, 490 flow [2024-01-29 22:56:37,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,890 INFO L231 Difference]: Finished difference. Result has 217 places, 208 transitions, 426 flow [2024-01-29 22:56:37,890 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:37,890 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -113 predicate places. [2024-01-29 22:56:37,890 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 208 transitions, 426 flow [2024-01-29 22:56:37,891 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:37,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,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, 1, 1, 1, 1, 1, 1, 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,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-01-29 22:56:37,891 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:37,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1003462062, now seen corresponding path program 1 times [2024-01-29 22:56:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120221225] [2024-01-29 22:56:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,931 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,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120221225] [2024-01-29 22:56:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120221225] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146535644] [2024-01-29 22:56:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:38,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 208 transitions, 426 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:38,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:38,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,178 INFO L124 PetriNetUnfolderBase]: 279/693 cut-off events. [2024-01-29 22:56:38,178 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 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 3359 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:38,181 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-01-29 22:56:38,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 207 transitions, 486 flow [2024-01-29 22:56:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:38,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:38,182 INFO L175 Difference]: Start difference. First operand has 217 places, 208 transitions, 426 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 207 transitions, 486 flow [2024-01-29 22:56:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 207 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,185 INFO L231 Difference]: Finished difference. Result has 216 places, 207 transitions, 424 flow [2024-01-29 22:56:38,185 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:38,186 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -114 predicate places. [2024-01-29 22:56:38,186 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 207 transitions, 424 flow [2024-01-29 22:56:38,186 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:38,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,186 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:38,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-01-29 22:56:38,186 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1042554742, now seen corresponding path program 1 times [2024-01-29 22:56:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282657733] [2024-01-29 22:56:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,221 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,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282657733] [2024-01-29 22:56:38,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282657733] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245641486] [2024-01-29 22:56:38,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 207 transitions, 424 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:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,457 INFO L124 PetriNetUnfolderBase]: 279/692 cut-off events. [2024-01-29 22:56:38,457 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 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 3312 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1136. Up to 460 conditions per place. [2024-01-29 22:56:38,460 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-01-29 22:56:38,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 206 transitions, 486 flow [2024-01-29 22:56:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:38,462 INFO L175 Difference]: Start difference. First operand has 216 places, 207 transitions, 424 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:38,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 206 transitions, 486 flow [2024-01-29 22:56:38,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,465 INFO L231 Difference]: Finished difference. Result has 215 places, 206 transitions, 422 flow [2024-01-29 22:56:38,465 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:38,466 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -115 predicate places. [2024-01-29 22:56:38,466 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 422 flow [2024-01-29 22:56:38,466 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:38,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,467 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:38,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-01-29 22:56:38,467 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2040539388, now seen corresponding path program 1 times [2024-01-29 22:56:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327639357] [2024-01-29 22:56:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,499 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,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327639357] [2024-01-29 22:56:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327639357] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041755511] [2024-01-29 22:56:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:38,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 422 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:38,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:38,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,691 INFO L124 PetriNetUnfolderBase]: 279/691 cut-off events. [2024-01-29 22:56:38,691 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 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 3355 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1135. Up to 459 conditions per place. [2024-01-29 22:56:38,693 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2024-01-29 22:56:38,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 205 transitions, 488 flow [2024-01-29 22:56:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:38,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7458847736625515 [2024-01-29 22:56:38,695 INFO L175 Difference]: Start difference. First operand has 215 places, 206 transitions, 422 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:38,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 205 transitions, 488 flow [2024-01-29 22:56:38,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 205 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,697 INFO L231 Difference]: Finished difference. Result has 214 places, 205 transitions, 420 flow [2024-01-29 22:56:38,698 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:38,698 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -116 predicate places. [2024-01-29 22:56:38,698 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 205 transitions, 420 flow [2024-01-29 22:56:38,709 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:38,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,709 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:38,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-01-29 22:56:38,709 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1260169528, now seen corresponding path program 1 times [2024-01-29 22:56:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642563158] [2024-01-29 22:56:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,756 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,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642563158] [2024-01-29 22:56:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642563158] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53809076] [2024-01-29 22:56:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:38,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 205 transitions, 420 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:38,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,897 INFO L124 PetriNetUnfolderBase]: 279/689 cut-off events. [2024-01-29 22:56:38,897 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:38,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 689 events. 279/689 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3298 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1134. Up to 458 conditions per place. [2024-01-29 22:56:38,899 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-01-29 22:56:38,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 478 flow [2024-01-29 22:56:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-29 22:56:38,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-29 22:56:38,901 INFO L175 Difference]: Start difference. First operand has 214 places, 205 transitions, 420 flow. Second operand 3 states and 732 transitions. [2024-01-29 22:56:38,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 478 flow [2024-01-29 22:56:38,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 203 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,903 INFO L231 Difference]: Finished difference. Result has 212 places, 203 transitions, 416 flow [2024-01-29 22:56:38,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=212, PETRI_TRANSITIONS=203} [2024-01-29 22:56:38,905 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -118 predicate places. [2024-01-29 22:56:38,905 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 203 transitions, 416 flow [2024-01-29 22:56:38,905 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:38,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,905 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:38,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-01-29 22:56:38,905 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:38,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 410551603, now seen corresponding path program 1 times [2024-01-29 22:56:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215095470] [2024-01-29 22:56:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,936 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,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215095470] [2024-01-29 22:56:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215095470] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296625139] [2024-01-29 22:56:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,938 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: 233 out of 324 [2024-01-29 22:56:39,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 203 transitions, 416 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: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: 233 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,070 INFO L124 PetriNetUnfolderBase]: 279/688 cut-off events. [2024-01-29 22:56:39,070 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 688 events. 279/688 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3303 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:39,073 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-01-29 22:56:39,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 202 transitions, 476 flow [2024-01-29 22:56:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:39,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:39,074 INFO L175 Difference]: Start difference. First operand has 212 places, 203 transitions, 416 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:39,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 202 transitions, 476 flow [2024-01-29 22:56:39,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 202 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,077 INFO L231 Difference]: Finished difference. Result has 211 places, 202 transitions, 414 flow [2024-01-29 22:56:39,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=211, PETRI_TRANSITIONS=202} [2024-01-29 22:56:39,077 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -119 predicate places. [2024-01-29 22:56:39,078 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 202 transitions, 414 flow [2024-01-29 22:56:39,078 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:39,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-01-29 22:56:39,078 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash -157799996, now seen corresponding path program 1 times [2024-01-29 22:56:39,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645481482] [2024-01-29 22:56:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,129 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,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645481482] [2024-01-29 22:56:39,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645481482] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510102664] [2024-01-29 22:56:39,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:39,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 202 transitions, 414 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:39,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:39,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,310 INFO L124 PetriNetUnfolderBase]: 279/687 cut-off events. [2024-01-29 22:56:39,310 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 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 3318 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:39,313 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2024-01-29 22:56:39,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 201 transitions, 474 flow [2024-01-29 22:56:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:39,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:39,314 INFO L175 Difference]: Start difference. First operand has 211 places, 202 transitions, 414 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:39,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 201 transitions, 474 flow [2024-01-29 22:56:39,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 201 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,316 INFO L231 Difference]: Finished difference. Result has 210 places, 201 transitions, 412 flow [2024-01-29 22:56:39,317 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:39,317 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -120 predicate places. [2024-01-29 22:56:39,317 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 201 transitions, 412 flow [2024-01-29 22:56:39,317 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:39,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,317 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:39,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-01-29 22:56:39,318 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -596830679, now seen corresponding path program 1 times [2024-01-29 22:56:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106231505] [2024-01-29 22:56:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,349 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,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106231505] [2024-01-29 22:56:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106231505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546350054] [2024-01-29 22:56:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:39,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 201 transitions, 412 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:39,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:39,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,498 INFO L124 PetriNetUnfolderBase]: 279/686 cut-off events. [2024-01-29 22:56:39,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 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 3309 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:39,501 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-01-29 22:56:39,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 200 transitions, 472 flow [2024-01-29 22:56:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:39,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:39,505 INFO L175 Difference]: Start difference. First operand has 210 places, 201 transitions, 412 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:39,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 200 transitions, 472 flow [2024-01-29 22:56:39,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 200 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,508 INFO L231 Difference]: Finished difference. Result has 209 places, 200 transitions, 410 flow [2024-01-29 22:56:39,508 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:39,508 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -121 predicate places. [2024-01-29 22:56:39,508 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 200 transitions, 410 flow [2024-01-29 22:56:39,509 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:39,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,509 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:39,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-01-29 22:56:39,509 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1321879876, now seen corresponding path program 1 times [2024-01-29 22:56:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808978427] [2024-01-29 22:56:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,537 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,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808978427] [2024-01-29 22:56:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808978427] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229971] [2024-01-29 22:56:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:39,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 200 transitions, 410 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:39,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:39,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,689 INFO L124 PetriNetUnfolderBase]: 279/685 cut-off events. [2024-01-29 22:56:39,689 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 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 3269 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:39,691 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-01-29 22:56:39,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 199 transitions, 470 flow [2024-01-29 22:56:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:39,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:39,693 INFO L175 Difference]: Start difference. First operand has 209 places, 200 transitions, 410 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 199 transitions, 470 flow [2024-01-29 22:56:39,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 199 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,696 INFO L231 Difference]: Finished difference. Result has 208 places, 199 transitions, 408 flow [2024-01-29 22:56:39,696 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:39,696 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -122 predicate places. [2024-01-29 22:56:39,696 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 408 flow [2024-01-29 22:56:39,697 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:39,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,697 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:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-01-29 22:56:39,697 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1971398884, now seen corresponding path program 1 times [2024-01-29 22:56:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803465463] [2024-01-29 22:56:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,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:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803465463] [2024-01-29 22:56:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803465463] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759827741] [2024-01-29 22:56:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 22:56:39,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 408 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:39,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 22:56:39,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,862 INFO L124 PetriNetUnfolderBase]: 279/684 cut-off events. [2024-01-29 22:56:39,862 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:39,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 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 3249 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1111. Up to 457 conditions per place. [2024-01-29 22:56:39,864 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 28 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-01-29 22:56:39,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 198 transitions, 466 flow [2024-01-29 22:56:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2024-01-29 22:56:39,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7541152263374485 [2024-01-29 22:56:39,865 INFO L175 Difference]: Start difference. First operand has 208 places, 199 transitions, 408 flow. Second operand 3 states and 733 transitions. [2024-01-29 22:56:39,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 198 transitions, 466 flow [2024-01-29 22:56:39,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 198 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,869 INFO L231 Difference]: Finished difference. Result has 207 places, 198 transitions, 406 flow [2024-01-29 22:56:39,869 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:39,870 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -123 predicate places. [2024-01-29 22:56:39,870 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 198 transitions, 406 flow [2024-01-29 22:56:39,870 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:39,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,870 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:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-01-29 22:56:39,870 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:39,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 983825411, now seen corresponding path program 1 times [2024-01-29 22:56:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21713579] [2024-01-29 22:56:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,903 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,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21713579] [2024-01-29 22:56:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21713579] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487758007] [2024-01-29 22:56:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:39,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 198 transitions, 406 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:39,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:39,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,049 INFO L124 PetriNetUnfolderBase]: 279/683 cut-off events. [2024-01-29 22:56:40,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 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 3248 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:40,051 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-01-29 22:56:40,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 197 transitions, 466 flow [2024-01-29 22:56:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:40,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:40,053 INFO L175 Difference]: Start difference. First operand has 207 places, 198 transitions, 406 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 197 transitions, 466 flow [2024-01-29 22:56:40,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 197 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,055 INFO L231 Difference]: Finished difference. Result has 206 places, 197 transitions, 404 flow [2024-01-29 22:56:40,055 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:40,056 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -124 predicate places. [2024-01-29 22:56:40,056 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 197 transitions, 404 flow [2024-01-29 22:56:40,056 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:40,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,056 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:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-01-29 22:56:40,057 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 433818755, now seen corresponding path program 1 times [2024-01-29 22:56:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335100236] [2024-01-29 22:56:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,085 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,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335100236] [2024-01-29 22:56:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335100236] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015203753] [2024-01-29 22:56:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 22:56:40,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 197 transitions, 404 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:40,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 22:56:40,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,211 INFO L124 PetriNetUnfolderBase]: 279/682 cut-off events. [2024-01-29 22:56:40,211 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 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 3266 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1111. Up to 457 conditions per place. [2024-01-29 22:56:40,213 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 28 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-01-29 22:56:40,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 196 transitions, 462 flow [2024-01-29 22:56:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2024-01-29 22:56:40,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7541152263374485 [2024-01-29 22:56:40,214 INFO L175 Difference]: Start difference. First operand has 206 places, 197 transitions, 404 flow. Second operand 3 states and 733 transitions. [2024-01-29 22:56:40,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 196 transitions, 462 flow [2024-01-29 22:56:40,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 196 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,217 INFO L231 Difference]: Finished difference. Result has 205 places, 196 transitions, 402 flow [2024-01-29 22:56:40,217 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:40,217 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -125 predicate places. [2024-01-29 22:56:40,217 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 196 transitions, 402 flow [2024-01-29 22:56:40,217 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:40,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,218 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] [2024-01-29 22:56:40,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-01-29 22:56:40,218 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 563481436, now seen corresponding path program 1 times [2024-01-29 22:56:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108892612] [2024-01-29 22:56:40,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,246 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,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108892612] [2024-01-29 22:56:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108892612] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926256246] [2024-01-29 22:56:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:40,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 196 transitions, 402 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:40,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:40,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,381 INFO L124 PetriNetUnfolderBase]: 279/681 cut-off events. [2024-01-29 22:56:40,382 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 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 3270 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:40,384 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-01-29 22:56:40,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 195 transitions, 462 flow [2024-01-29 22:56:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:40,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:40,385 INFO L175 Difference]: Start difference. First operand has 205 places, 196 transitions, 402 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:40,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 195 transitions, 462 flow [2024-01-29 22:56:40,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 195 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,387 INFO L231 Difference]: Finished difference. Result has 204 places, 195 transitions, 400 flow [2024-01-29 22:56:40,388 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:40,388 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -126 predicate places. [2024-01-29 22:56:40,388 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 195 transitions, 400 flow [2024-01-29 22:56:40,388 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:40,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,388 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:40,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-01-29 22:56:40,389 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 288057424, now seen corresponding path program 1 times [2024-01-29 22:56:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563266260] [2024-01-29 22:56:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,418 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,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563266260] [2024-01-29 22:56:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563266260] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802979207] [2024-01-29 22:56:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:40,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 195 transitions, 400 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:40,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:40,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,581 INFO L124 PetriNetUnfolderBase]: 279/680 cut-off events. [2024-01-29 22:56:40,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:40,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 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 3282 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1112. Up to 458 conditions per place. [2024-01-29 22:56:40,584 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-01-29 22:56:40,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 194 transitions, 460 flow [2024-01-29 22:56:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:40,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:40,585 INFO L175 Difference]: Start difference. First operand has 204 places, 195 transitions, 400 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:40,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 194 transitions, 460 flow [2024-01-29 22:56:40,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 194 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,591 INFO L231 Difference]: Finished difference. Result has 203 places, 194 transitions, 398 flow [2024-01-29 22:56:40,591 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:40,592 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -127 predicate places. [2024-01-29 22:56:40,592 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 194 transitions, 398 flow [2024-01-29 22:56:40,592 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:40,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,592 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:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-01-29 22:56:40,592 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1945346234, now seen corresponding path program 1 times [2024-01-29 22:56:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702534235] [2024-01-29 22:56:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,665 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,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702534235] [2024-01-29 22:56:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702534235] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782374161] [2024-01-29 22:56:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 324 [2024-01-29 22:56:40,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 324 [2024-01-29 22:56:40,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,902 INFO L124 PetriNetUnfolderBase]: 279/675 cut-off events. [2024-01-29 22:56:40,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 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 3282 event pairs, 279 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 1113. Up to 462 conditions per place. [2024-01-29 22:56:40,905 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-01-29 22:56:40,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 189 transitions, 460 flow [2024-01-29 22:56:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-01-29 22:56:40,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7366255144032922 [2024-01-29 22:56:40,907 INFO L175 Difference]: Start difference. First operand has 203 places, 194 transitions, 398 flow. Second operand 3 states and 716 transitions. [2024-01-29 22:56:40,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 189 transitions, 460 flow [2024-01-29 22:56:40,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 189 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,909 INFO L231 Difference]: Finished difference. Result has 198 places, 189 transitions, 388 flow [2024-01-29 22:56:40,909 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:40,909 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -132 predicate places. [2024-01-29 22:56:40,909 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 189 transitions, 388 flow [2024-01-29 22:56:40,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,910 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:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-01-29 22:56:40,910 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:40,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 176193057, now seen corresponding path program 1 times [2024-01-29 22:56:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839208751] [2024-01-29 22:56:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,954 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,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839208751] [2024-01-29 22:56:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839208751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614268468] [2024-01-29 22:56:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:41,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 189 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:41,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,157 INFO L124 PetriNetUnfolderBase]: 279/674 cut-off events. [2024-01-29 22:56:41,157 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 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 3300 event pairs, 279 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1096. Up to 462 conditions per place. [2024-01-29 22:56:41,159 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2024-01-29 22:56:41,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 188 transitions, 458 flow [2024-01-29 22:56:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-01-29 22:56:41,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73559670781893 [2024-01-29 22:56:41,161 INFO L175 Difference]: Start difference. First operand has 198 places, 189 transitions, 388 flow. Second operand 3 states and 715 transitions. [2024-01-29 22:56:41,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 188 transitions, 458 flow [2024-01-29 22:56:41,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 188 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,163 INFO L231 Difference]: Finished difference. Result has 197 places, 188 transitions, 386 flow [2024-01-29 22:56:41,163 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:41,163 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -133 predicate places. [2024-01-29 22:56:41,164 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 188 transitions, 386 flow [2024-01-29 22:56:41,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-01-29 22:56:41,164 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 519314620, now seen corresponding path program 1 times [2024-01-29 22:56:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265903299] [2024-01-29 22:56:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,206 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,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265903299] [2024-01-29 22:56:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265903299] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925438296] [2024-01-29 22:56:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 22:56:41,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 188 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 22:56:41,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,414 INFO L124 PetriNetUnfolderBase]: 279/673 cut-off events. [2024-01-29 22:56:41,414 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 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 3277 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1095. Up to 461 conditions per place. [2024-01-29 22:56:41,416 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2024-01-29 22:56:41,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 187 transitions, 454 flow [2024-01-29 22:56:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:56:41,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:41,418 INFO L175 Difference]: Start difference. First operand has 197 places, 188 transitions, 386 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 187 transitions, 454 flow [2024-01-29 22:56:41,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,420 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 384 flow [2024-01-29 22:56:41,420 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:41,420 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -134 predicate places. [2024-01-29 22:56:41,420 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 384 flow [2024-01-29 22:56:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,421 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] [2024-01-29 22:56:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-01-29 22:56:41,421 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 845205040, now seen corresponding path program 1 times [2024-01-29 22:56:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685296678] [2024-01-29 22:56:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,477 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,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685296678] [2024-01-29 22:56:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685296678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333933091] [2024-01-29 22:56:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 324 [2024-01-29 22:56:41,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 324 [2024-01-29 22:56:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,727 INFO L124 PetriNetUnfolderBase]: 279/671 cut-off events. [2024-01-29 22:56:41,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 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 3302 event pairs, 279 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1096. Up to 462 conditions per place. [2024-01-29 22:56:41,730 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2024-01-29 22:56:41,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 185 transitions, 452 flow [2024-01-29 22:56:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-01-29 22:56:41,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7304526748971193 [2024-01-29 22:56:41,731 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 384 flow. Second operand 3 states and 710 transitions. [2024-01-29 22:56:41,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 185 transitions, 452 flow [2024-01-29 22:56:41,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 185 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,733 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 380 flow [2024-01-29 22:56:41,733 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:41,734 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -136 predicate places. [2024-01-29 22:56:41,734 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 380 flow [2024-01-29 22:56:41,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,734 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:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-01-29 22:56:41,735 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:41,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 431554582, now seen corresponding path program 1 times [2024-01-29 22:56:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568618682] [2024-01-29 22:56:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,791 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,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568618682] [2024-01-29 22:56:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568618682] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626257135] [2024-01-29 22:56:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:41,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:41,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 324 [2024-01-29 22:56:41,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 324 [2024-01-29 22:56:41,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,001 INFO L124 PetriNetUnfolderBase]: 279/670 cut-off events. [2024-01-29 22:56:42,002 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 670 events. 279/670 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/367 useless extension candidates. Maximal degree in co-relation 1096. Up to 462 conditions per place. [2024-01-29 22:56:42,004 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2024-01-29 22:56:42,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 184 transitions, 450 flow [2024-01-29 22:56:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-01-29 22:56:42,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7325102880658436 [2024-01-29 22:56:42,005 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 380 flow. Second operand 3 states and 712 transitions. [2024-01-29 22:56:42,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 184 transitions, 450 flow [2024-01-29 22:56:42,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 184 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,007 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 378 flow [2024-01-29 22:56:42,007 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:42,008 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -137 predicate places. [2024-01-29 22:56:42,008 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 378 flow [2024-01-29 22:56:42,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,008 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:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-01-29 22:56:42,008 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1607528580, now seen corresponding path program 1 times [2024-01-29 22:56:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535792477] [2024-01-29 22:56:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,055 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,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535792477] [2024-01-29 22:56:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535792477] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326837425] [2024-01-29 22:56:42,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:42,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 378 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:42,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:42,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,263 INFO L124 PetriNetUnfolderBase]: 279/666 cut-off events. [2024-01-29 22:56:42,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 666 events. 279/666 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3284 event pairs, 279 based on Foata normal form. 2/366 useless extension candidates. Maximal degree in co-relation 1091. Up to 459 conditions per place. [2024-01-29 22:56:42,265 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2024-01-29 22:56:42,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 180 transitions, 438 flow [2024-01-29 22:56:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:42,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:42,266 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 378 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:42,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 180 transitions, 438 flow [2024-01-29 22:56:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 180 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,268 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 370 flow [2024-01-29 22:56:42,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2024-01-29 22:56:42,270 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -141 predicate places. [2024-01-29 22:56:42,270 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 370 flow [2024-01-29 22:56:42,270 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:42,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,270 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:42,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-01-29 22:56:42,271 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1000578790, now seen corresponding path program 1 times [2024-01-29 22:56:42,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36802628] [2024-01-29 22:56:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,334 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,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36802628] [2024-01-29 22:56:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36802628] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477668170] [2024-01-29 22:56:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:42,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 370 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:42,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:42,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,543 INFO L124 PetriNetUnfolderBase]: 279/665 cut-off events. [2024-01-29 22:56:42,543 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 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 3267 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1075. Up to 459 conditions per place. [2024-01-29 22:56:42,545 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-01-29 22:56:42,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 179 transitions, 436 flow [2024-01-29 22:56:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:42,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:42,547 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 370 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:42,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 179 transitions, 436 flow [2024-01-29 22:56:42,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 179 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,549 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 368 flow [2024-01-29 22:56:42,549 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:42,550 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -142 predicate places. [2024-01-29 22:56:42,550 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 368 flow [2024-01-29 22:56:42,550 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:42,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,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, 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,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-01-29 22:56:42,551 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash 953173526, now seen corresponding path program 1 times [2024-01-29 22:56:42,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346140886] [2024-01-29 22:56:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,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:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346140886] [2024-01-29 22:56:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346140886] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530714323] [2024-01-29 22:56:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:42,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 368 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:42,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:42,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:42,793 INFO L124 PetriNetUnfolderBase]: 279/664 cut-off events. [2024-01-29 22:56:42,793 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:42,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 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 3250 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1075. Up to 459 conditions per place. [2024-01-29 22:56:42,796 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-01-29 22:56:42,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 178 transitions, 434 flow [2024-01-29 22:56:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:42,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:42,797 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 368 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:42,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 178 transitions, 434 flow [2024-01-29 22:56:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 178 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:42,799 INFO L231 Difference]: Finished difference. Result has 187 places, 178 transitions, 366 flow [2024-01-29 22:56:42,799 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:42,799 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -143 predicate places. [2024-01-29 22:56:42,800 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 178 transitions, 366 flow [2024-01-29 22:56:42,800 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:42,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,800 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:42,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-01-29 22:56:42,800 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:42,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash -516389769, now seen corresponding path program 1 times [2024-01-29 22:56:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094657811] [2024-01-29 22:56:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,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:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094657811] [2024-01-29 22:56:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094657811] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982575814] [2024-01-29 22:56:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:42,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:42,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:42,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 178 transitions, 366 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:42,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:42,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,018 INFO L124 PetriNetUnfolderBase]: 279/663 cut-off events. [2024-01-29 22:56:43,018 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 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 3268 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:43,021 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2024-01-29 22:56:43,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 177 transitions, 430 flow [2024-01-29 22:56:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:43,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:43,030 INFO L175 Difference]: Start difference. First operand has 187 places, 178 transitions, 366 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:43,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 177 transitions, 430 flow [2024-01-29 22:56:43,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 177 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,032 INFO L231 Difference]: Finished difference. Result has 186 places, 177 transitions, 364 flow [2024-01-29 22:56:43,032 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:43,034 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -144 predicate places. [2024-01-29 22:56:43,034 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 364 flow [2024-01-29 22:56:43,034 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:43,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,035 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:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-01-29 22:56:43,035 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1171788258, now seen corresponding path program 1 times [2024-01-29 22:56:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484871376] [2024-01-29 22:56:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,120 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484871376] [2024-01-29 22:56:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484871376] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299205904] [2024-01-29 22:56:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:43,262 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:43,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:43,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,331 INFO L124 PetriNetUnfolderBase]: 279/662 cut-off events. [2024-01-29 22:56:43,331 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,332 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 3242 event pairs, 279 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1077. Up to 461 conditions per place. [2024-01-29 22:56:43,334 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2024-01-29 22:56:43,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 176 transitions, 434 flow [2024-01-29 22:56:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-01-29 22:56:43,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73559670781893 [2024-01-29 22:56:43,336 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:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 176 transitions, 434 flow [2024-01-29 22:56:43,338 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:43,340 INFO L231 Difference]: Finished difference. Result has 185 places, 176 transitions, 362 flow [2024-01-29 22:56:43,340 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:43,341 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -145 predicate places. [2024-01-29 22:56:43,341 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 362 flow [2024-01-29 22:56:43,341 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:43,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,342 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] [2024-01-29 22:56:43,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-01-29 22:56:43,342 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1965699565, now seen corresponding path program 1 times [2024-01-29 22:56:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244392263] [2024-01-29 22:56:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,392 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,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244392263] [2024-01-29 22:56:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244392263] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105986743] [2024-01-29 22:56:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:43,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 362 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:43,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,586 INFO L124 PetriNetUnfolderBase]: 279/661 cut-off events. [2024-01-29 22:56:43,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 661 events. 279/661 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/363 useless extension candidates. Maximal degree in co-relation 1074. Up to 458 conditions per place. [2024-01-29 22:56:43,588 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2024-01-29 22:56:43,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 175 transitions, 426 flow [2024-01-29 22:56:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 22:56:43,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-29 22:56:43,590 INFO L175 Difference]: Start difference. First operand has 185 places, 176 transitions, 362 flow. Second operand 3 states and 721 transitions. [2024-01-29 22:56:43,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 175 transitions, 426 flow [2024-01-29 22:56:43,590 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:43,592 INFO L231 Difference]: Finished difference. Result has 184 places, 175 transitions, 360 flow [2024-01-29 22:56:43,592 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:43,592 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -146 predicate places. [2024-01-29 22:56:43,592 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 175 transitions, 360 flow [2024-01-29 22:56:43,592 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:43,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,593 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:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-01-29 22:56:43,593 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -748266679, now seen corresponding path program 1 times [2024-01-29 22:56:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023291444] [2024-01-29 22:56:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,634 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,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023291444] [2024-01-29 22:56:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023291444] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463506714] [2024-01-29 22:56:43,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:43,753 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.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:43,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:43,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,818 INFO L124 PetriNetUnfolderBase]: 279/658 cut-off events. [2024-01-29 22:56:43,818 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:43,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 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 3267 event pairs, 279 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1071. Up to 456 conditions per place. [2024-01-29 22:56:43,820 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-01-29 22:56:43,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 172 transitions, 418 flow [2024-01-29 22:56:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:43,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:43,821 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:43,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 172 transitions, 418 flow [2024-01-29 22:56:43,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 172 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,823 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 354 flow [2024-01-29 22:56:43,824 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:43,824 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -149 predicate places. [2024-01-29 22:56:43,824 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 354 flow [2024-01-29 22:56:43,824 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:43,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,824 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:43,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-01-29 22:56:43,825 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:43,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1721428636, now seen corresponding path program 1 times [2024-01-29 22:56:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944105815] [2024-01-29 22:56:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,883 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,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944105815] [2024-01-29 22:56:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944105815] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644328487] [2024-01-29 22:56:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:43,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 354 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:43,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:43,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,040 INFO L124 PetriNetUnfolderBase]: 279/657 cut-off events. [2024-01-29 22:56:44,040 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 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 3227 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:44,043 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-01-29 22:56:44,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 428 flow [2024-01-29 22:56:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,043 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,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-29 22:56:44,044 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 354 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:56:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 428 flow [2024-01-29 22:56:44,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 171 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,046 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 352 flow [2024-01-29 22:56:44,047 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:44,047 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -150 predicate places. [2024-01-29 22:56:44,047 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 352 flow [2024-01-29 22:56:44,047 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: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] [2024-01-29 22:56:44,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-01-29 22:56:44,048 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash -730445122, now seen corresponding path program 1 times [2024-01-29 22:56:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387204517] [2024-01-29 22:56:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,096 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,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387204517] [2024-01-29 22:56:44,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387204517] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344468207] [2024-01-29 22:56:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:44,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,280 INFO L124 PetriNetUnfolderBase]: 279/656 cut-off events. [2024-01-29 22:56:44,280 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,281 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 3261 event pairs, 279 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1057. Up to 457 conditions per place. [2024-01-29 22:56:44,283 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-01-29 22:56:44,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 170 transitions, 416 flow [2024-01-29 22:56:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:44,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:44,284 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 352 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:44,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 170 transitions, 416 flow [2024-01-29 22:56:44,285 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:44,286 INFO L231 Difference]: Finished difference. Result has 179 places, 170 transitions, 350 flow [2024-01-29 22:56:44,286 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:44,287 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -151 predicate places. [2024-01-29 22:56:44,287 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 170 transitions, 350 flow [2024-01-29 22:56:44,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-01-29 22:56:44,288 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1168960204, now seen corresponding path program 1 times [2024-01-29 22:56:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488654747] [2024-01-29 22:56:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,334 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,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488654747] [2024-01-29 22:56:44,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488654747] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276359190] [2024-01-29 22:56:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:44,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 170 transitions, 350 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:44,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:44,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,500 INFO L124 PetriNetUnfolderBase]: 279/655 cut-off events. [2024-01-29 22:56:44,501 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 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 3266 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:44,503 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-01-29 22:56:44,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 169 transitions, 410 flow [2024-01-29 22:56:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:44,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:44,504 INFO L175 Difference]: Start difference. First operand has 179 places, 170 transitions, 350 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:44,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 169 transitions, 410 flow [2024-01-29 22:56:44,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 169 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,506 INFO L231 Difference]: Finished difference. Result has 178 places, 169 transitions, 348 flow [2024-01-29 22:56:44,506 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:44,506 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -152 predicate places. [2024-01-29 22:56:44,506 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 169 transitions, 348 flow [2024-01-29 22:56:44,507 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:44,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,507 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:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-01-29 22:56:44,507 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1878025938, now seen corresponding path program 1 times [2024-01-29 22:56:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104778318] [2024-01-29 22:56:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,547 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,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104778318] [2024-01-29 22:56:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104778318] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685620349] [2024-01-29 22:56:44,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:44,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 169 transitions, 348 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:44,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:44,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,724 INFO L124 PetriNetUnfolderBase]: 279/654 cut-off events. [2024-01-29 22:56:44,724 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 654 events. 279/654 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3261 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1055. Up to 455 conditions per place. [2024-01-29 22:56:44,726 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-01-29 22:56:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 168 transitions, 408 flow [2024-01-29 22:56:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:44,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:44,728 INFO L175 Difference]: Start difference. First operand has 178 places, 169 transitions, 348 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:44,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 168 transitions, 408 flow [2024-01-29 22:56:44,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 168 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,729 INFO L231 Difference]: Finished difference. Result has 177 places, 168 transitions, 346 flow [2024-01-29 22:56:44,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=177, PETRI_TRANSITIONS=168} [2024-01-29 22:56:44,730 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -153 predicate places. [2024-01-29 22:56:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 168 transitions, 346 flow [2024-01-29 22:56:44,730 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:44,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,731 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] [2024-01-29 22:56:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-01-29 22:56:44,731 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1910739963, now seen corresponding path program 1 times [2024-01-29 22:56:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140578731] [2024-01-29 22:56:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,770 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,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140578731] [2024-01-29 22:56:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140578731] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958029463] [2024-01-29 22:56:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:44,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 168 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,946 INFO L124 PetriNetUnfolderBase]: 279/653 cut-off events. [2024-01-29 22:56:44,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:44,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 653 events. 279/653 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3260 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1057. Up to 457 conditions per place. [2024-01-29 22:56:44,949 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-01-29 22:56:44,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 167 transitions, 410 flow [2024-01-29 22:56:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:44,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-29 22:56:44,950 INFO L175 Difference]: Start difference. First operand has 177 places, 168 transitions, 346 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:44,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 167 transitions, 410 flow [2024-01-29 22:56:44,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 167 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,952 INFO L231 Difference]: Finished difference. Result has 176 places, 167 transitions, 344 flow [2024-01-29 22:56:44,952 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:44,954 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -154 predicate places. [2024-01-29 22:56:44,954 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 344 flow [2024-01-29 22:56:44,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,954 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:44,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-01-29 22:56:44,955 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:44,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2024831491, now seen corresponding path program 1 times [2024-01-29 22:56:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141666] [2024-01-29 22:56:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,996 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,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141666] [2024-01-29 22:56:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141666] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411484363] [2024-01-29 22:56:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-29 22:56:45,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 344 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:45,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-29 22:56:45,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,163 INFO L124 PetriNetUnfolderBase]: 279/650 cut-off events. [2024-01-29 22:56:45,164 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 650 events. 279/650 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. 2/364 useless extension candidates. Maximal degree in co-relation 1055. Up to 456 conditions per place. [2024-01-29 22:56:45,166 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-01-29 22:56:45,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 164 transitions, 404 flow [2024-01-29 22:56:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:45,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:45,167 INFO L175 Difference]: Start difference. First operand has 176 places, 167 transitions, 344 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:45,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 164 transitions, 404 flow [2024-01-29 22:56:45,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 164 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,169 INFO L231 Difference]: Finished difference. Result has 173 places, 164 transitions, 338 flow [2024-01-29 22:56:45,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=173, PETRI_TRANSITIONS=164} [2024-01-29 22:56:45,170 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -157 predicate places. [2024-01-29 22:56:45,170 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 164 transitions, 338 flow [2024-01-29 22:56:45,170 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:45,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,170 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:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-01-29 22:56:45,171 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -242814545, now seen corresponding path program 1 times [2024-01-29 22:56:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135018255] [2024-01-29 22:56:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135018255] [2024-01-29 22:56:45,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135018255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680019339] [2024-01-29 22:56:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-29 22:56:45,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 164 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-29 22:56:45,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,408 INFO L124 PetriNetUnfolderBase]: 279/648 cut-off events. [2024-01-29 22:56:45,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 648 events. 279/648 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 1045. Up to 459 conditions per place. [2024-01-29 22:56:45,411 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 34 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2024-01-29 22:56:45,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 406 flow [2024-01-29 22:56:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-01-29 22:56:45,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7366255144032922 [2024-01-29 22:56:45,412 INFO L175 Difference]: Start difference. First operand has 173 places, 164 transitions, 338 flow. Second operand 3 states and 716 transitions. [2024-01-29 22:56:45,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 406 flow [2024-01-29 22:56:45,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 162 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,414 INFO L231 Difference]: Finished difference. Result has 171 places, 162 transitions, 334 flow [2024-01-29 22:56:45,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=171, PETRI_TRANSITIONS=162} [2024-01-29 22:56:45,414 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -159 predicate places. [2024-01-29 22:56:45,414 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 162 transitions, 334 flow [2024-01-29 22:56:45,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,415 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] [2024-01-29 22:56:45,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-01-29 22:56:45,415 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1416476527, now seen corresponding path program 1 times [2024-01-29 22:56:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471164837] [2024-01-29 22:56:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,463 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,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471164837] [2024-01-29 22:56:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471164837] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025831730] [2024-01-29 22:56:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:45,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 162 transitions, 334 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:45,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,662 INFO L124 PetriNetUnfolderBase]: 279/647 cut-off events. [2024-01-29 22:56:45,662 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:45,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 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 3236 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1043. Up to 457 conditions per place. [2024-01-29 22:56:45,664 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2024-01-29 22:56:45,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 400 flow [2024-01-29 22:56:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:45,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:45,665 INFO L175 Difference]: Start difference. First operand has 171 places, 162 transitions, 334 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:45,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 400 flow [2024-01-29 22:56:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 161 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,667 INFO L231 Difference]: Finished difference. Result has 170 places, 161 transitions, 332 flow [2024-01-29 22:56:45,667 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:45,667 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -160 predicate places. [2024-01-29 22:56:45,667 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 332 flow [2024-01-29 22:56:45,667 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:45,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,668 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:45,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-01-29 22:56:45,668 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -961097303, now seen corresponding path program 1 times [2024-01-29 22:56:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152351505] [2024-01-29 22:56:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,714 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,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152351505] [2024-01-29 22:56:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152351505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436288979] [2024-01-29 22:56:45,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:45,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 324 [2024-01-29 22:56:45,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 332 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:45,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:45,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 324 [2024-01-29 22:56:45,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,900 INFO L124 PetriNetUnfolderBase]: 279/646 cut-off events. [2024-01-29 22:56:45,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:45,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 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 3229 event pairs, 279 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1043. Up to 457 conditions per place. [2024-01-29 22:56:45,902 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-01-29 22:56:45,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 160 transitions, 398 flow [2024-01-29 22:56:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 22:56:45,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2024-01-29 22:56:45,904 INFO L175 Difference]: Start difference. First operand has 170 places, 161 transitions, 332 flow. Second operand 3 states and 719 transitions. [2024-01-29 22:56:45,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 160 transitions, 398 flow [2024-01-29 22:56:45,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 160 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,905 INFO L231 Difference]: Finished difference. Result has 169 places, 160 transitions, 330 flow [2024-01-29 22:56:45,906 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:45,906 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -161 predicate places. [2024-01-29 22:56:45,906 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 160 transitions, 330 flow [2024-01-29 22:56:45,906 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:45,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,906 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:45,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-01-29 22:56:45,907 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:45,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -196470084, now seen corresponding path program 1 times [2024-01-29 22:56:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537654146] [2024-01-29 22:56:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,946 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,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537654146] [2024-01-29 22:56:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537654146] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19139717] [2024-01-29 22:56:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:46,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 160 transitions, 330 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:46,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:46,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,109 INFO L124 PetriNetUnfolderBase]: 279/643 cut-off events. [2024-01-29 22:56:46,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 643 events. 279/643 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3202 event pairs, 279 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1038. Up to 453 conditions per place. [2024-01-29 22:56:46,111 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-01-29 22:56:46,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 157 transitions, 388 flow [2024-01-29 22:56:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:46,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-29 22:56:46,112 INFO L175 Difference]: Start difference. First operand has 169 places, 160 transitions, 330 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 157 transitions, 388 flow [2024-01-29 22:56:46,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 157 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,114 INFO L231 Difference]: Finished difference. Result has 166 places, 157 transitions, 324 flow [2024-01-29 22:56:46,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=166, PETRI_TRANSITIONS=157} [2024-01-29 22:56:46,115 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -164 predicate places. [2024-01-29 22:56:46,115 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 324 flow [2024-01-29 22:56:46,116 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:46,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,116 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:46,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-01-29 22:56:46,116 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1795603251, now seen corresponding path program 1 times [2024-01-29 22:56:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369449630] [2024-01-29 22:56:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,183 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,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369449630] [2024-01-29 22:56:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369449630] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980063627] [2024-01-29 22:56:46,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 22:56:46,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 22:56:46,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,339 INFO L124 PetriNetUnfolderBase]: 279/642 cut-off events. [2024-01-29 22:56:46,339 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:46,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 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 3203 event pairs, 279 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1029. Up to 455 conditions per place. [2024-01-29 22:56:46,341 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-01-29 22:56:46,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 390 flow [2024-01-29 22:56:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 22:56:46,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742798353909465 [2024-01-29 22:56:46,342 INFO L175 Difference]: Start difference. First operand has 166 places, 157 transitions, 324 flow. Second operand 3 states and 722 transitions. [2024-01-29 22:56:46,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 390 flow [2024-01-29 22:56:46,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 156 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,344 INFO L231 Difference]: Finished difference. Result has 165 places, 156 transitions, 322 flow [2024-01-29 22:56:46,344 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:46,345 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -165 predicate places. [2024-01-29 22:56:46,345 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 156 transitions, 322 flow [2024-01-29 22:56:46,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:46,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-01-29 22:56:46,346 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 170875955, now seen corresponding path program 1 times [2024-01-29 22:56:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085247052] [2024-01-29 22:56:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,405 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,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085247052] [2024-01-29 22:56:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085247052] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070982562] [2024-01-29 22:56:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:46,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 156 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 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,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:46,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,539 INFO L124 PetriNetUnfolderBase]: 279/641 cut-off events. [2024-01-29 22:56:46,539 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:46,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 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 3211 event pairs, 279 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1027. Up to 453 conditions per place. [2024-01-29 22:56:46,542 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-01-29 22:56:46,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 155 transitions, 386 flow [2024-01-29 22:56:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:46,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479423868312757 [2024-01-29 22:56:46,545 INFO L175 Difference]: Start difference. First operand has 165 places, 156 transitions, 322 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 155 transitions, 386 flow [2024-01-29 22:56:46,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 155 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,546 INFO L231 Difference]: Finished difference. Result has 164 places, 155 transitions, 320 flow [2024-01-29 22:56:46,547 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:46,548 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -166 predicate places. [2024-01-29 22:56:46,548 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 155 transitions, 320 flow [2024-01-29 22:56:46,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 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,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,548 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] [2024-01-29 22:56:46,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-01-29 22:56:46,549 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1003101662, now seen corresponding path program 1 times [2024-01-29 22:56:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088656785] [2024-01-29 22:56:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,604 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,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088656785] [2024-01-29 22:56:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088656785] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733657201] [2024-01-29 22:56:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:46,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 155 transitions, 320 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:46,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,756 INFO L124 PetriNetUnfolderBase]: 279/640 cut-off events. [2024-01-29 22:56:46,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 640 events. 279/640 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3203 event pairs, 279 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1027. Up to 453 conditions per place. [2024-01-29 22:56:46,758 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-01-29 22:56:46,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 154 transitions, 382 flow [2024-01-29 22:56:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:46,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:46,769 INFO L175 Difference]: Start difference. First operand has 164 places, 155 transitions, 320 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:46,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 154 transitions, 382 flow [2024-01-29 22:56:46,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 154 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:46,771 INFO L231 Difference]: Finished difference. Result has 163 places, 154 transitions, 318 flow [2024-01-29 22:56:46,771 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:46,771 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -167 predicate places. [2024-01-29 22:56:46,771 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 154 transitions, 318 flow [2024-01-29 22:56:46,771 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:46,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,772 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:46,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-01-29 22:56:46,772 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1908090341, now seen corresponding path program 1 times [2024-01-29 22:56:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667519713] [2024-01-29 22:56:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,809 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,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667519713] [2024-01-29 22:56:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667519713] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468950994] [2024-01-29 22:56:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:46,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:46,884 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.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:46,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:46,944 INFO L124 PetriNetUnfolderBase]: 279/638 cut-off events. [2024-01-29 22:56:46,944 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:46,945 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 3220 event pairs, 279 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1026. Up to 452 conditions per place. [2024-01-29 22:56:46,946 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2024-01-29 22:56:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 152 transitions, 378 flow [2024-01-29 22:56:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 22:56:46,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7510288065843621 [2024-01-29 22:56:46,948 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:46,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 152 transitions, 378 flow [2024-01-29 22:56:46,948 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:46,949 INFO L231 Difference]: Finished difference. Result has 161 places, 152 transitions, 314 flow [2024-01-29 22:56:46,950 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:46,950 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -169 predicate places. [2024-01-29 22:56:46,950 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 152 transitions, 314 flow [2024-01-29 22:56:46,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:46,951 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:46,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-01-29 22:56:46,951 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:46,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -978739567, now seen corresponding path program 1 times [2024-01-29 22:56:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284579575] [2024-01-29 22:56:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:46,997 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,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284579575] [2024-01-29 22:56:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284579575] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524611379] [2024-01-29 22:56:46,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:46,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:47,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 152 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,142 INFO L124 PetriNetUnfolderBase]: 279/636 cut-off events. [2024-01-29 22:56:47,142 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:47,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 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 3191 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:47,144 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-01-29 22:56:47,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 372 flow [2024-01-29 22:56:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:47,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:47,145 INFO L175 Difference]: Start difference. First operand has 161 places, 152 transitions, 314 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:47,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 372 flow [2024-01-29 22:56:47,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 150 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,147 INFO L231 Difference]: Finished difference. Result has 159 places, 150 transitions, 310 flow [2024-01-29 22:56:47,147 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:47,147 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -171 predicate places. [2024-01-29 22:56:47,147 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 310 flow [2024-01-29 22:56:47,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,148 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:47,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-01-29 22:56:47,148 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:47,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -276153602, now seen corresponding path program 1 times [2024-01-29 22:56:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414789131] [2024-01-29 22:56:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,187 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:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414789131] [2024-01-29 22:56:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414789131] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043863320] [2024-01-29 22:56:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:47,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 150 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,323 INFO L124 PetriNetUnfolderBase]: 279/635 cut-off events. [2024-01-29 22:56:47,323 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:47,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 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 3189 event pairs, 279 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 1016. Up to 452 conditions per place. [2024-01-29 22:56:47,325 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2024-01-29 22:56:47,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 149 transitions, 372 flow [2024-01-29 22:56:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:47,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:47,326 INFO L175 Difference]: Start difference. First operand has 159 places, 150 transitions, 310 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 149 transitions, 372 flow [2024-01-29 22:56:47,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 149 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,328 INFO L231 Difference]: Finished difference. Result has 158 places, 149 transitions, 308 flow [2024-01-29 22:56:47,328 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:47,328 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -172 predicate places. [2024-01-29 22:56:47,329 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 149 transitions, 308 flow [2024-01-29 22:56:47,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-01-29 22:56:47,329 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:47,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2027476645, now seen corresponding path program 1 times [2024-01-29 22:56:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032716300] [2024-01-29 22:56:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,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:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032716300] [2024-01-29 22:56:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032716300] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528502292] [2024-01-29 22:56:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 324 [2024-01-29 22:56:47,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 149 transitions, 308 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:47,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 324 [2024-01-29 22:56:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,463 INFO L124 PetriNetUnfolderBase]: 279/634 cut-off events. [2024-01-29 22:56:47,463 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:47,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 634 events. 279/634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3184 event pairs, 279 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1017. Up to 450 conditions per place. [2024-01-29 22:56:47,466 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 47 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2024-01-29 22:56:47,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 148 transitions, 404 flow [2024-01-29 22:56:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-29 22:56:47,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181069958847737 [2024-01-29 22:56:47,468 INFO L175 Difference]: Start difference. First operand has 158 places, 149 transitions, 308 flow. Second operand 3 states and 698 transitions. [2024-01-29 22:56:47,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 148 transitions, 404 flow [2024-01-29 22:56:47,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 148 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,470 INFO L231 Difference]: Finished difference. Result has 157 places, 148 transitions, 306 flow [2024-01-29 22:56:47,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=157, PETRI_TRANSITIONS=148} [2024-01-29 22:56:47,470 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -173 predicate places. [2024-01-29 22:56:47,470 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 306 flow [2024-01-29 22:56:47,471 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:47,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,471 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:47,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-01-29 22:56:47,471 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:47,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1572735545, now seen corresponding path program 1 times [2024-01-29 22:56:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996554255] [2024-01-29 22:56:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,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:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996554255] [2024-01-29 22:56:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996554255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218488315] [2024-01-29 22:56:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 22:56:47,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 22:56:47,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,668 INFO L124 PetriNetUnfolderBase]: 279/632 cut-off events. [2024-01-29 22:56:47,668 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 22:56:47,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 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 3178 event pairs, 279 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1007. Up to 451 conditions per place. [2024-01-29 22:56:47,670 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-01-29 22:56:47,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 146 transitions, 364 flow [2024-01-29 22:56:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:47,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:47,673 INFO L175 Difference]: Start difference. First operand has 157 places, 148 transitions, 306 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 146 transitions, 364 flow [2024-01-29 22:56:47,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 146 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,675 INFO L231 Difference]: Finished difference. Result has 155 places, 146 transitions, 302 flow [2024-01-29 22:56:47,675 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:47,675 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -175 predicate places. [2024-01-29 22:56:47,675 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 146 transitions, 302 flow [2024-01-29 22:56:47,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:47,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,676 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:47,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-01-29 22:56:47,676 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:47,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1510163619, now seen corresponding path program 1 times [2024-01-29 22:56:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475809566] [2024-01-29 22:56:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,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:47,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475809566] [2024-01-29 22:56:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475809566] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185842096] [2024-01-29 22:56:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-29 22:56:47,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 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:47,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-29 22:56:47,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,890 INFO L124 PetriNetUnfolderBase]: 279/631 cut-off events. [2024-01-29 22:56:47,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:47,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 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 3177 event pairs, 279 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 1008. Up to 452 conditions per place. [2024-01-29 22:56:47,892 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 22:56:47,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 145 transitions, 364 flow [2024-01-29 22:56:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-29 22:56:47,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-01-29 22:56:47,894 INFO L175 Difference]: Start difference. First operand has 155 places, 146 transitions, 302 flow. Second operand 3 states and 726 transitions. [2024-01-29 22:56:47,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 145 transitions, 364 flow [2024-01-29 22:56:47,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 145 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,895 INFO L231 Difference]: Finished difference. Result has 154 places, 145 transitions, 300 flow [2024-01-29 22:56:47,896 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:47,896 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -176 predicate places. [2024-01-29 22:56:47,896 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 145 transitions, 300 flow [2024-01-29 22:56:47,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 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:47,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,897 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:47,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-01-29 22:56:47,897 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:47,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash -431645895, now seen corresponding path program 1 times [2024-01-29 22:56:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483016863] [2024-01-29 22:56:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,936 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:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483016863] [2024-01-29 22:56:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483016863] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526250200] [2024-01-29 22:56:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 22:56:47,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 145 transitions, 300 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:47,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 22:56:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:48,026 INFO L124 PetriNetUnfolderBase]: 279/630 cut-off events. [2024-01-29 22:56:48,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:48,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 630 events. 279/630 cut-off events. For 0/0 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/356 useless extension candidates. Maximal degree in co-relation 1007. Up to 476 conditions per place. [2024-01-29 22:56:48,028 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 43 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2024-01-29 22:56:48,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 144 transitions, 386 flow [2024-01-29 22:56:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-01-29 22:56:48,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2024-01-29 22:56:48,034 INFO L175 Difference]: Start difference. First operand has 154 places, 145 transitions, 300 flow. Second operand 3 states and 708 transitions. [2024-01-29 22:56:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 144 transitions, 386 flow [2024-01-29 22:56:48,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 144 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:48,036 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 296 flow [2024-01-29 22:56:48,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2024-01-29 22:56:48,036 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-29 22:56:48,037 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 296 flow [2024-01-29 22:56:48,037 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:48,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:48,037 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:48,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-01-29 22:56:48,037 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:48,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -496118862, now seen corresponding path program 1 times [2024-01-29 22:56:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940591033] [2024-01-29 22:56:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:48,078 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:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940591033] [2024-01-29 22:56:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940591033] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667425641] [2024-01-29 22:56:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:48,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:48,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 22:56:48,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 144 transitions, 296 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:48,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:48,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 22:56:48,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:48,193 INFO L124 PetriNetUnfolderBase]: 279/629 cut-off events. [2024-01-29 22:56:48,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 629 events. 279/629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3206 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1132. Up to 463 conditions per place. [2024-01-29 22:56:48,195 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 30 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2024-01-29 22:56:48,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 143 transitions, 356 flow [2024-01-29 22:56:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-29 22:56:48,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-29 22:56:48,199 INFO L175 Difference]: Start difference. First operand has 153 places, 144 transitions, 296 flow. Second operand 3 states and 731 transitions. [2024-01-29 22:56:48,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 143 transitions, 356 flow [2024-01-29 22:56:48,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 143 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:48,200 INFO L231 Difference]: Finished difference. Result has 153 places, 143 transitions, 295 flow [2024-01-29 22:56:48,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=151, 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=295, PETRI_PLACES=153, PETRI_TRANSITIONS=143} [2024-01-29 22:56:48,201 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-29 22:56:48,201 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 143 transitions, 295 flow [2024-01-29 22:56:48,201 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:48,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:48,201 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] [2024-01-29 22:56:48,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-01-29 22:56:48,202 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:48,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1800186572, now seen corresponding path program 1 times [2024-01-29 22:56:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961757260] [2024-01-29 22:56:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:48,251 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:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961757260] [2024-01-29 22:56:48,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961757260] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:48,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:48,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461259659] [2024-01-29 22:56:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:48,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 22:56:48,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 143 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:48,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:48,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 22:56:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:48,396 INFO L124 PetriNetUnfolderBase]: 279/628 cut-off events. [2024-01-29 22:56:48,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:48,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 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 3205 event pairs, 279 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1129. Up to 461 conditions per place. [2024-01-29 22:56:48,398 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 28 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2024-01-29 22:56:48,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 142 transitions, 351 flow [2024-01-29 22:56:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-29 22:56:48,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-29 22:56:48,400 INFO L175 Difference]: Start difference. First operand has 153 places, 143 transitions, 295 flow. Second operand 3 states and 732 transitions. [2024-01-29 22:56:48,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 142 transitions, 351 flow [2024-01-29 22:56:48,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 142 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:48,401 INFO L231 Difference]: Finished difference. Result has 153 places, 142 transitions, 294 flow [2024-01-29 22:56:48,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=151, 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=294, PETRI_PLACES=153, PETRI_TRANSITIONS=142} [2024-01-29 22:56:48,402 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-29 22:56:48,402 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 142 transitions, 294 flow [2024-01-29 22:56:48,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:48,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:48,402 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:48,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-01-29 22:56:48,402 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:48,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1896196065, now seen corresponding path program 1 times [2024-01-29 22:56:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387249575] [2024-01-29 22:56:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:48,616 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:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387249575] [2024-01-29 22:56:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387249575] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300545291] [2024-01-29 22:56:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:48,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:48,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 22:56:48,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 142 transitions, 294 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:48,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:48,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 22:56:48,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:48,703 INFO L124 PetriNetUnfolderBase]: 279/622 cut-off events. [2024-01-29 22:56:48,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:48,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 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 3048 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:48,705 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-29 22:56:48,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 396 flow [2024-01-29 22:56:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 978 transitions. [2024-01-29 22:56:48,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7546296296296297 [2024-01-29 22:56:48,707 INFO L175 Difference]: Start difference. First operand has 153 places, 142 transitions, 294 flow. Second operand 4 states and 978 transitions. [2024-01-29 22:56:48,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 151 transitions, 396 flow [2024-01-29 22:56:48,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:48,709 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 293 flow [2024-01-29 22:56:48,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=150, 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=293, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2024-01-29 22:56:48,709 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-29 22:56:48,709 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 293 flow [2024-01-29 22:56:48,710 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:48,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:48,710 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:48,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-01-29 22:56:48,710 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 22:56:48,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1347466340, now seen corresponding path program 1 times [2024-01-29 22:56:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:48,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753480654] [2024-01-29 22:56:48,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:48,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:56:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:48,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:56:48,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:56:48,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 241 remaining) [2024-01-29 22:56:48,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 241 remaining) [2024-01-29 22:56:48,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 241 remaining) [2024-01-29 22:56:48,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 241 remaining) [2024-01-29 22:56:48,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 241 remaining) [2024-01-29 22:56:48,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 241 remaining) [2024-01-29 22:56:48,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 241 remaining) [2024-01-29 22:56:48,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 241 remaining) [2024-01-29 22:56:48,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 241 remaining) [2024-01-29 22:56:48,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 241 remaining) [2024-01-29 22:56:48,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 241 remaining) [2024-01-29 22:56:48,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 241 remaining) [2024-01-29 22:56:48,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 241 remaining) [2024-01-29 22:56:48,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 241 remaining) [2024-01-29 22:56:48,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 241 remaining) [2024-01-29 22:56:48,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 241 remaining) [2024-01-29 22:56:48,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 241 remaining) [2024-01-29 22:56:48,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 241 remaining) [2024-01-29 22:56:48,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 241 remaining) [2024-01-29 22:56:48,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 241 remaining) [2024-01-29 22:56:48,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (62 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 241 remaining) [2024-01-29 22:56:48,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 241 remaining) [2024-01-29 22:56:48,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 241 remaining) [2024-01-29 22:56:48,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 241 remaining) [2024-01-29 22:56:48,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 241 remaining) [2024-01-29 22:56:48,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 241 remaining) [2024-01-29 22:56:48,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 241 remaining) [2024-01-29 22:56:48,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 241 remaining) [2024-01-29 22:56:48,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-01-29 22:56:48,890 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, 1, 1] [2024-01-29 22:56:48,899 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:56:48,899 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:56:49,013 INFO L503 ceAbstractionStarter]: Automizer considered 177 witness invariants [2024-01-29 22:56:49,013 INFO L504 ceAbstractionStarter]: WitnessConsidered=177 [2024-01-29 22:56:49,014 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:56:49 BasicIcfg [2024-01-29 22:56:49,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:56:49,015 INFO L158 Benchmark]: Toolchain (without parser) took 26526.43ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 153.1MB in the beginning and 1.1GB in the end (delta: -947.4MB). Peak memory consumption was 757.5MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,015 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:49,015 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 58.4MB in the beginning and 58.2MB in the end (delta: 127.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:49,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.35ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 125.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.24ms. Allocated memory is still 182.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,016 INFO L158 Benchmark]: Boogie Preprocessor took 100.53ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 117.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,017 INFO L158 Benchmark]: RCFGBuilder took 1859.22ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 117.5MB in the beginning and 160.4MB in the end (delta: -43.0MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,017 INFO L158 Benchmark]: TraceAbstraction took 23978.68ms. Allocated memory was 268.4MB in the beginning and 1.2GB in the end (delta: 945.8MB). Free memory was 160.4MB in the beginning and 1.1GB in the end (delta: -940.1MB). Peak memory consumption was 677.9MB. Max. memory is 16.1GB. [2024-01-29 22:56:49,018 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 58.4MB in the beginning and 58.2MB in the end (delta: 127.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.35ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 125.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.24ms. Allocated memory is still 182.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.53ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 117.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1859.22ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 117.5MB in the beginning and 160.4MB in the end (delta: -43.0MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23978.68ms. Allocated memory was 268.4MB in the beginning and 1.2GB in the end (delta: 945.8MB). Free memory was 160.4MB in the beginning and 1.1GB in the end (delta: -940.1MB). Peak memory consumption was 677.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 106]: 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[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[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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],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}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],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}] [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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],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}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],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}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],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[cardType_3],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=-2, 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[cardType_3],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=-2, 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[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=-2, 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[cardType_3],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=-2, 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[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=-2, 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[cardType_3],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=-2, 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[cardType_3],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=-2, 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[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=-2, 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[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=-2, 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[cardType_3],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=-2, 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=-2, 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=-2, 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[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=-2, 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[cardType_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [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[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=-2, 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_8],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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=-2, 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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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=-2, 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[cardType_11],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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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=-2, 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=-2, 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]]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,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=-2, 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=-2, 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[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=-2, 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[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=-2, 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_9],IntegerLiteral[0]]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[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=-2, 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[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,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]]],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=-2, 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}] [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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,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]]],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=-2, 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}] [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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,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]]],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=-2, 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}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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]]],BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [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[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=-2, 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}] [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=-2, 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}] [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=-2, 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}] [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[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=-2, 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}] [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[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=-2, 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}] [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[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=-2, 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}] [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[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=-2, 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}] [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[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=-2, 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}] [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]]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],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=-2, 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}] [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=-2, 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}] [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=-2, 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}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],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=-2, 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}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],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=-2, 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}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],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=-2, 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}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],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=-2, 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}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],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=-2, 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}] [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=-2, 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}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [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=-2, 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}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [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=-2, 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}] [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=-2, 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}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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=-2, 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}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],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[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=-2, 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}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],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=-2, 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}] [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=-2, 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}] [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=-2, 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}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[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=-2, 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}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],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=-2, 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}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],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=-2, 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}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[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=-2, 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}] [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=-2, 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}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_14],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=-2, 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}] [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=-2, cardSet_4=0, 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) [L106] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, 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: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: 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: 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: 100]: 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: 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. - 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: 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. - 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: 23.5s, OverallIterations: 90, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26345 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7505 mSDsluCounter, 2875 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23366 IncrementalHoareTripleChecker+Invalid, 24065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 2872 mSDtfsCounter, 23366 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 268, 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.9s InterpolantComputationTime, 5245 NumberOfCodeBlocks, 5245 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 5034 ConstructedInterpolants, 0 QuantifiedInterpolants, 49120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 89 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:49,089 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