./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-1.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/parallel-misc-1.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/parallel-misc-1.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.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:57:28,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:57:28,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:57:28,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:57:28,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:57:28,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:57:28,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:57:28,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:57:28,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:57:28,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:57:28,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:57:28,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:57:28,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:57:28,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:57:28,307 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:57:28,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:57:28,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:57:28,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:57:28,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:57:28,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:57:28,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:57:28,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:57:28,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:57:28,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:57:28,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:57:28,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:57:28,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:57:28,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:57:28,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:57:28,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:57:28,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:57:28,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:57:28,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:28,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:57:28,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:57:28,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:57:28,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:57:28,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:57:28,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:57:28,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:57:28,313 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:57:28,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:57:28,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:57:28,314 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:57:28,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:57:28,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:57:28,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:57:28,554 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:57:28,554 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:57:28,555 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/parallel-misc-1.wvr.yml/witness.yml [2024-01-29 22:57:28,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:57:28,686 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:57:28,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-29 22:57:29,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:57:29,894 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:57:29,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-29 22:57:29,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382ded2c7/5751ad70abc5422b9a49822a35e84511/FLAG23b48f013 [2024-01-29 22:57:29,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382ded2c7/5751ad70abc5422b9a49822a35e84511 [2024-01-29 22:57:29,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:57:29,919 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:57:29,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:29,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:57:29,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:57:29,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:28" (1/2) ... [2024-01-29 22:57:29,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0f33dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:29, skipping insertion in model container [2024-01-29 22:57:29,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:28" (1/2) ... [2024-01-29 22:57:29,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@328a1f27 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:29, skipping insertion in model container [2024-01-29 22:57:29,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:29" (2/2) ... [2024-01-29 22:57:29,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0f33dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:29, skipping insertion in model container [2024-01-29 22:57:29,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:29" (2/2) ... [2024-01-29 22:57:29,938 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:57:29,974 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:57:29,975 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,975 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (A == 0) && (sum1 == 0) [2024-01-29 22:57:29,975 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((A == 0) && (sum1 == 0)) && (j == 0) [2024-01-29 22:57:29,975 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((A == 0) && (sum1 == 0)) && (sum2 == 0) [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] A == 0 [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((A == 0) && (sum1 == 0)) && (N == 0) [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (A == 0) && (cap2 == 0) [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((A == 0) && (sum1 == 0)) && (i == 0) [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,976 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (0 <= i) && ((long long )i - (long long )size >= 0LL) [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] 0 <= i [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0) [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (A == 0) && (N == 0) [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-29 22:57:29,977 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (A == 0) && (sum2 == 0) [2024-01-29 22:57:29,978 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] A == 0 [2024-01-29 22:57:29,978 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((A == 0) && (sum2 == 0)) && (i == 0) [2024-01-29 22:57:29,978 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((A == 0) && (sum2 == 0)) && (N == 0) [2024-01-29 22:57:29,978 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (A == 0) && (cap2 == 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (A == 0) && (sum1 == 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (A == 0) && (cap1 == 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((A == 0) && (sum2 == 0)) && (j == 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((-1LL - (long long )i) + (long long )size >= 0LL) && (size != 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (((-1LL - (long long )i) + (long long )size >= 0LL) && (size != 0)) && (((((((((((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) [2024-01-29 22:57:29,979 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-29 22:57:29,980 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,980 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,980 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-29 22:57:29,980 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (A == 0) && (N == 0) [2024-01-29 22:57:29,980 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-29 22:57:29,981 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (A == 0) && (j == 0) [2024-01-29 22:57:29,981 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,982 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((A == 0) && (sum1 == 0)) && (i == 0) [2024-01-29 22:57:29,982 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (A == 0) && (sum1 == 0) [2024-01-29 22:57:29,982 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] A == 0 [2024-01-29 22:57:29,982 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((A == 0) && (sum1 == 0)) && (i == 0)) && (j == 0) [2024-01-29 22:57:29,982 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((A == 0) && (sum1 == 0)) && (i == 0)) && (N == 0) [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((A == 0) && (sum1 == 0)) && (sum2 == 0) [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (b <= -1) && (b != 0) [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b <= -1 [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,983 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (A == 0) && (sum2 == 0) [2024-01-29 22:57:29,984 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((A == 0) && (sum2 == 0)) && (i == 0) [2024-01-29 22:57:29,984 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] A == 0 [2024-01-29 22:57:29,984 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (A == 0) && (bag2 == 0) [2024-01-29 22:57:29,984 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (A == 0) && (cap1 == 0) [2024-01-29 22:57:29,985 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (A == 0) && (sum1 == 0) [2024-01-29 22:57:29,985 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (A == 0) && (cap2 == 0) [2024-01-29 22:57:29,985 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((A == 0) && (sum2 == 0)) && (N == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((A == 0) && (sum2 == 0)) && (j == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((A == 0) && (sum2 == 0)) && (i == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((A == 0) && (sum2 == 0)) && (i == 0)) && (N == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (A == 0) && (sum2 == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((A == 0) && (sum2 == 0)) && (i == 0)) && (j == 0) [2024-01-29 22:57:29,986 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (A == 0) && (N == 0) [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (A == 0) && (i == 0) [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (A == 0) && (j == 0) [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] (1 <= b) && (b != 0) [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] 1 <= b [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-29 22:57:29,987 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,988 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((A == 0) && (bag1 == 0)) && (sum1 == 0)) && (sum2 == 0) [2024-01-29 22:57:29,988 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((A == 0) && (bag1 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (j == 0) [2024-01-29 22:57:29,988 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((A == 0) && (bag1 == 0)) && (sum1 == 0) [2024-01-29 22:57:29,988 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((A == 0) && (bag1 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (N == 0) [2024-01-29 22:57:29,988 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (A == 0) && (bag1 == 0) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((A == 0) && (bag1 == 0)) && (cap1 == 0) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((((A == 0) && (bag1 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((A == 0) && (bag1 == 0)) && (bag2 == 0) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] A == 0 [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((A == 0) && (bag1 == 0)) && (cap2 == 0) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] (A == 0) && ((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && i != 1) || ((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] A == 0 [2024-01-29 22:57:29,989 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,990 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 22:57:29,990 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 22:57:30,010 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:30,220 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/parallel-misc-1.wvr.c[2781,2794] [2024-01-29 22:57:30,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:30,242 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:30,250 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 [2024-01-29 22:57:30,306 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/parallel-misc-1.wvr.c[2781,2794] 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:57:30,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:30,344 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:30,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30 WrapperNode [2024-01-29 22:57:30,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:30,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:30,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:30,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:30,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,413 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 408 [2024-01-29 22:57:30,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:30,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:30,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:30,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:30,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,461 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 2, 7, 2]. 54 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:57:30,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:30,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:30,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:30,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:30,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (1/1) ... [2024-01-29 22:57:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:30,547 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:57:30,577 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:57:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:57:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:57:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:30,607 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:57:30,703 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:30,705 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:31,394 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:31,394 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:31,590 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:31,590 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-29 22:57:31,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:31 BoogieIcfgContainer [2024-01-29 22:57:31,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:31,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:31,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:31,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:28" (1/4) ... [2024-01-29 22:57:31,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2b9c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:31, skipping insertion in model container [2024-01-29 22:57:31,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:57:29" (2/4) ... [2024-01-29 22:57:31,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2b9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:31, skipping insertion in model container [2024-01-29 22:57:31,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:30" (3/4) ... [2024-01-29 22:57:31,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2b9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:31, skipping insertion in model container [2024-01-29 22:57:31,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:31" (4/4) ... [2024-01-29 22:57:31,598 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-29 22:57:31,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:31,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-29 22:57:31,613 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:31,681 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:57:31,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 263 transitions, 540 flow [2024-01-29 22:57:31,755 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2024-01-29 22:57:31,755 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:57:31,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 261 events. 5/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 616 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2024-01-29 22:57:31,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 263 transitions, 540 flow [2024-01-29 22:57:31,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 260 transitions, 532 flow [2024-01-29 22:57:31,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:31,778 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;@7ec01d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:31,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 172 error locations. [2024-01-29 22:57:31,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:31,781 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:31,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:31,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:31,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:31,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:31,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash 42637, now seen corresponding path program 1 times [2024-01-29 22:57:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758859640] [2024-01-29 22:57:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:31,930 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:57:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758859640] [2024-01-29 22:57:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758859640] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:31,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:31,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732853636] [2024-01-29 22:57:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:31,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:32,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2024-01-29 22:57:32,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 260 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:32,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:32,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2024-01-29 22:57:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:32,710 INFO L124 PetriNetUnfolderBase]: 1192/3430 cut-off events. [2024-01-29 22:57:32,710 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-29 22:57:32,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 3430 events. 1192/3430 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28767 event pairs, 969 based on Foata normal form. 2/2884 useless extension candidates. Maximal degree in co-relation 5068. Up to 1941 conditions per place. [2024-01-29 22:57:32,734 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 77 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-01-29 22:57:32,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 257 transitions, 684 flow [2024-01-29 22:57:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-01-29 22:57:32,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.788339670468948 [2024-01-29 22:57:32,753 INFO L175 Difference]: Start difference. First operand has 262 places, 260 transitions, 532 flow. Second operand 3 states and 622 transitions. [2024-01-29 22:57:32,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 257 transitions, 684 flow [2024-01-29 22:57:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 257 transitions, 676 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:57:32,765 INFO L231 Difference]: Finished difference. Result has 257 places, 257 transitions, 522 flow [2024-01-29 22:57:32,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=255, 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=522, PETRI_PLACES=257, PETRI_TRANSITIONS=257} [2024-01-29 22:57:32,771 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -5 predicate places. [2024-01-29 22:57:32,771 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 257 transitions, 522 flow [2024-01-29 22:57:32,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:32,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:32,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:57:32,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:32,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:32,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 41012416, now seen corresponding path program 1 times [2024-01-29 22:57:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234349855] [2024-01-29 22:57:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:32,875 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:57:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234349855] [2024-01-29 22:57:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234349855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738696309] [2024-01-29 22:57:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:33,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 263 [2024-01-29 22:57:33,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 257 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:33,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:33,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 263 [2024-01-29 22:57:33,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:33,411 INFO L124 PetriNetUnfolderBase]: 1192/3429 cut-off events. [2024-01-29 22:57:33,411 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:33,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5393 conditions, 3429 events. 1192/3429 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28716 event pairs, 969 based on Foata normal form. 0/2880 useless extension candidates. Maximal degree in co-relation 5368. Up to 1939 conditions per place. [2024-01-29 22:57:33,426 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2024-01-29 22:57:33,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 256 transitions, 674 flow [2024-01-29 22:57:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2024-01-29 22:57:33,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908745247148289 [2024-01-29 22:57:33,429 INFO L175 Difference]: Start difference. First operand has 257 places, 257 transitions, 522 flow. Second operand 3 states and 624 transitions. [2024-01-29 22:57:33,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 256 transitions, 674 flow [2024-01-29 22:57:33,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 256 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:33,433 INFO L231 Difference]: Finished difference. Result has 256 places, 256 transitions, 520 flow [2024-01-29 22:57:33,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=256, PETRI_TRANSITIONS=256} [2024-01-29 22:57:33,434 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -6 predicate places. [2024-01-29 22:57:33,434 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 256 transitions, 520 flow [2024-01-29 22:57:33,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:33,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:33,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:33,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:33,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:33,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1271386181, now seen corresponding path program 1 times [2024-01-29 22:57:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256074845] [2024-01-29 22:57:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:33,492 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:57:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256074845] [2024-01-29 22:57:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256074845] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287934910] [2024-01-29 22:57:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:33,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:33,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 263 [2024-01-29 22:57:33,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 256 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:33,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:33,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 263 [2024-01-29 22:57:33,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:33,999 INFO L124 PetriNetUnfolderBase]: 1192/3426 cut-off events. [2024-01-29 22:57:33,999 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:34,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 3426 events. 1192/3426 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28743 event pairs, 969 based on Foata normal form. 2/2886 useless extension candidates. Maximal degree in co-relation 5383. Up to 1954 conditions per place. [2024-01-29 22:57:34,012 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 90 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-01-29 22:57:34,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 253 transitions, 698 flow [2024-01-29 22:57:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2024-01-29 22:57:34,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7477820025348543 [2024-01-29 22:57:34,014 INFO L175 Difference]: Start difference. First operand has 256 places, 256 transitions, 520 flow. Second operand 3 states and 590 transitions. [2024-01-29 22:57:34,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 253 transitions, 698 flow [2024-01-29 22:57:34,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 253 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:34,017 INFO L231 Difference]: Finished difference. Result has 253 places, 253 transitions, 514 flow [2024-01-29 22:57:34,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=251, 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=514, PETRI_PLACES=253, PETRI_TRANSITIONS=253} [2024-01-29 22:57:34,018 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -9 predicate places. [2024-01-29 22:57:34,019 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 253 transitions, 514 flow [2024-01-29 22:57:34,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:34,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:34,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:57:34,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:34,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:34,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 758267242, now seen corresponding path program 1 times [2024-01-29 22:57:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897908625] [2024-01-29 22:57:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:34,052 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:57:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897908625] [2024-01-29 22:57:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897908625] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330941582] [2024-01-29 22:57:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:34,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2024-01-29 22:57:34,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 253 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:34,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:34,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2024-01-29 22:57:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:34,535 INFO L124 PetriNetUnfolderBase]: 1192/3425 cut-off events. [2024-01-29 22:57:34,535 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:34,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5390 conditions, 3425 events. 1192/3425 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28735 event pairs, 969 based on Foata normal form. 0/2880 useless extension candidates. Maximal degree in co-relation 5369. Up to 1940 conditions per place. [2024-01-29 22:57:34,551 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 76 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 22:57:34,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 252 transitions, 668 flow [2024-01-29 22:57:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-01-29 22:57:34,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.788339670468948 [2024-01-29 22:57:34,553 INFO L175 Difference]: Start difference. First operand has 253 places, 253 transitions, 514 flow. Second operand 3 states and 622 transitions. [2024-01-29 22:57:34,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 252 transitions, 668 flow [2024-01-29 22:57:34,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 252 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:34,556 INFO L231 Difference]: Finished difference. Result has 252 places, 252 transitions, 512 flow [2024-01-29 22:57:34,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=250, 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=512, PETRI_PLACES=252, PETRI_TRANSITIONS=252} [2024-01-29 22:57:34,557 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -10 predicate places. [2024-01-29 22:57:34,558 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 252 transitions, 512 flow [2024-01-29 22:57:34,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:34,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:34,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:34,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:34,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:34,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1449576677, now seen corresponding path program 1 times [2024-01-29 22:57:34,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417609019] [2024-01-29 22:57:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:34,607 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:57:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417609019] [2024-01-29 22:57:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417609019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385179054] [2024-01-29 22:57:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:34,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 263 [2024-01-29 22:57:34,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 252 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:34,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:34,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 263 [2024-01-29 22:57:34,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:35,146 INFO L124 PetriNetUnfolderBase]: 1192/3424 cut-off events. [2024-01-29 22:57:35,147 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:35,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 3424 events. 1192/3424 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28751 event pairs, 969 based on Foata normal form. 0/2883 useless extension candidates. Maximal degree in co-relation 5382. Up to 1953 conditions per place. [2024-01-29 22:57:35,166 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 89 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-01-29 22:57:35,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 251 transitions, 692 flow [2024-01-29 22:57:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2024-01-29 22:57:35,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7477820025348543 [2024-01-29 22:57:35,168 INFO L175 Difference]: Start difference. First operand has 252 places, 252 transitions, 512 flow. Second operand 3 states and 590 transitions. [2024-01-29 22:57:35,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 251 transitions, 692 flow [2024-01-29 22:57:35,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:35,172 INFO L231 Difference]: Finished difference. Result has 251 places, 251 transitions, 510 flow [2024-01-29 22:57:35,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=249, 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=510, PETRI_PLACES=251, PETRI_TRANSITIONS=251} [2024-01-29 22:57:35,175 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -11 predicate places. [2024-01-29 22:57:35,175 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 251 transitions, 510 flow [2024-01-29 22:57:35,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:35,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:35,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:35,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:35,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:35,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1473736885, now seen corresponding path program 1 times [2024-01-29 22:57:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:35,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697230327] [2024-01-29 22:57:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:35,241 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:57:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697230327] [2024-01-29 22:57:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697230327] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40028036] [2024-01-29 22:57:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:35,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 263 [2024-01-29 22:57:35,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 251 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:35,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:35,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 263 [2024-01-29 22:57:35,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:35,778 INFO L124 PetriNetUnfolderBase]: 1192/3423 cut-off events. [2024-01-29 22:57:35,779 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:35,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5400 conditions, 3423 events. 1192/3423 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28736 event pairs, 969 based on Foata normal form. 0/2886 useless extension candidates. Maximal degree in co-relation 5381. Up to 1952 conditions per place. [2024-01-29 22:57:35,791 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 88 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-01-29 22:57:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 250 transitions, 688 flow [2024-01-29 22:57:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2024-01-29 22:57:35,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7503168567807351 [2024-01-29 22:57:35,797 INFO L175 Difference]: Start difference. First operand has 251 places, 251 transitions, 510 flow. Second operand 3 states and 592 transitions. [2024-01-29 22:57:35,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 250 transitions, 688 flow [2024-01-29 22:57:35,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 250 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:35,800 INFO L231 Difference]: Finished difference. Result has 250 places, 250 transitions, 508 flow [2024-01-29 22:57:35,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=248, 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=508, PETRI_PLACES=250, PETRI_TRANSITIONS=250} [2024-01-29 22:57:35,803 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -12 predicate places. [2024-01-29 22:57:35,804 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 250 transitions, 508 flow [2024-01-29 22:57:35,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:35,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:35,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:35,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:35,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:35,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1078105117, now seen corresponding path program 1 times [2024-01-29 22:57:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494949881] [2024-01-29 22:57:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:35,853 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:57:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494949881] [2024-01-29 22:57:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494949881] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477319731] [2024-01-29 22:57:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:36,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 263 [2024-01-29 22:57:36,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 250 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:36,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:36,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 263 [2024-01-29 22:57:36,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:36,332 INFO L124 PetriNetUnfolderBase]: 1192/3413 cut-off events. [2024-01-29 22:57:36,332 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:36,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5376 conditions, 3413 events. 1192/3413 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28758 event pairs, 969 based on Foata normal form. 6/2880 useless extension candidates. Maximal degree in co-relation 5357. Up to 1930 conditions per place. [2024-01-29 22:57:36,344 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 74 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-29 22:57:36,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 640 flow [2024-01-29 22:57:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2024-01-29 22:57:36,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7743979721166033 [2024-01-29 22:57:36,346 INFO L175 Difference]: Start difference. First operand has 250 places, 250 transitions, 508 flow. Second operand 3 states and 611 transitions. [2024-01-29 22:57:36,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 640 flow [2024-01-29 22:57:36,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 240 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:36,353 INFO L231 Difference]: Finished difference. Result has 240 places, 240 transitions, 488 flow [2024-01-29 22:57:36,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=238, 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=488, PETRI_PLACES=240, PETRI_TRANSITIONS=240} [2024-01-29 22:57:36,354 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -22 predicate places. [2024-01-29 22:57:36,354 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 240 transitions, 488 flow [2024-01-29 22:57:36,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:36,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:36,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:36,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:36,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:36,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash -938478436, now seen corresponding path program 1 times [2024-01-29 22:57:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73763032] [2024-01-29 22:57:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73763032] [2024-01-29 22:57:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73763032] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:36,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167278232] [2024-01-29 22:57:36,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:36,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:36,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:36,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 263 [2024-01-29 22:57:36,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 240 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:36,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:36,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 263 [2024-01-29 22:57:36,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:36,900 INFO L124 PetriNetUnfolderBase]: 1192/3411 cut-off events. [2024-01-29 22:57:36,900 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:36,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 3411 events. 1192/3411 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28653 event pairs, 969 based on Foata normal form. 0/2871 useless extension candidates. Maximal degree in co-relation 5290. Up to 1931 conditions per place. [2024-01-29 22:57:36,913 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 22:57:36,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 238 transitions, 638 flow [2024-01-29 22:57:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2024-01-29 22:57:36,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761723700887199 [2024-01-29 22:57:36,916 INFO L175 Difference]: Start difference. First operand has 240 places, 240 transitions, 488 flow. Second operand 3 states and 601 transitions. [2024-01-29 22:57:36,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 238 transitions, 638 flow [2024-01-29 22:57:36,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 238 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:36,919 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 484 flow [2024-01-29 22:57:36,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=236, 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=484, PETRI_PLACES=238, PETRI_TRANSITIONS=238} [2024-01-29 22:57:36,921 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -24 predicate places. [2024-01-29 22:57:36,921 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 484 flow [2024-01-29 22:57:36,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:36,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:36,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:36,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:36,922 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:36,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 971940756, now seen corresponding path program 1 times [2024-01-29 22:57:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480545809] [2024-01-29 22:57:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:36,972 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:57:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:36,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480545809] [2024-01-29 22:57:36,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480545809] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932517279] [2024-01-29 22:57:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:37,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 263 [2024-01-29 22:57:37,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 238 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:37,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:37,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 263 [2024-01-29 22:57:37,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:37,450 INFO L124 PetriNetUnfolderBase]: 1192/3408 cut-off events. [2024-01-29 22:57:37,451 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:37,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5369 conditions, 3408 events. 1192/3408 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28737 event pairs, 969 based on Foata normal form. 0/2871 useless extension candidates. Maximal degree in co-relation 5287. Up to 1930 conditions per place. [2024-01-29 22:57:37,468 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 72 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-01-29 22:57:37,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 235 transitions, 626 flow [2024-01-29 22:57:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2024-01-29 22:57:37,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7782002534854245 [2024-01-29 22:57:37,470 INFO L175 Difference]: Start difference. First operand has 238 places, 238 transitions, 484 flow. Second operand 3 states and 614 transitions. [2024-01-29 22:57:37,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 235 transitions, 626 flow [2024-01-29 22:57:37,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 235 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:37,474 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 478 flow [2024-01-29 22:57:37,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=233, 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=478, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2024-01-29 22:57:37,475 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -27 predicate places. [2024-01-29 22:57:37,475 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 478 flow [2024-01-29 22:57:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:37,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:37,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:37,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:57:37,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:37,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 65393612, now seen corresponding path program 1 times [2024-01-29 22:57:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806062327] [2024-01-29 22:57:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:37,504 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:57:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806062327] [2024-01-29 22:57:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806062327] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60019160] [2024-01-29 22:57:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:37,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 263 [2024-01-29 22:57:37,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:37,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:37,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 263 [2024-01-29 22:57:37,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:37,914 INFO L124 PetriNetUnfolderBase]: 1192/3404 cut-off events. [2024-01-29 22:57:37,914 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:37,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 3404 events. 1192/3404 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28669 event pairs, 969 based on Foata normal form. 1/2878 useless extension candidates. Maximal degree in co-relation 5311. Up to 1929 conditions per place. [2024-01-29 22:57:37,927 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 82 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-01-29 22:57:37,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 638 flow [2024-01-29 22:57:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2024-01-29 22:57:37,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7503168567807351 [2024-01-29 22:57:37,929 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 478 flow. Second operand 3 states and 592 transitions. [2024-01-29 22:57:37,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 638 flow [2024-01-29 22:57:37,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 231 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:37,932 INFO L231 Difference]: Finished difference. Result has 231 places, 231 transitions, 470 flow [2024-01-29 22:57:37,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=229, 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=470, PETRI_PLACES=231, PETRI_TRANSITIONS=231} [2024-01-29 22:57:37,933 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -31 predicate places. [2024-01-29 22:57:37,933 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 231 transitions, 470 flow [2024-01-29 22:57:37,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:37,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:37,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:37,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:57:37,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:37,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2027203351, now seen corresponding path program 1 times [2024-01-29 22:57:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787692619] [2024-01-29 22:57:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:37,966 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:57:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:37,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787692619] [2024-01-29 22:57:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787692619] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44179257] [2024-01-29 22:57:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:37,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:38,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2024-01-29 22:57:38,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:38,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:38,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2024-01-29 22:57:38,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:38,384 INFO L124 PetriNetUnfolderBase]: 1192/3402 cut-off events. [2024-01-29 22:57:38,385 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:38,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 3402 events. 1192/3402 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28753 event pairs, 969 based on Foata normal form. 0/2872 useless extension candidates. Maximal degree in co-relation 5296. Up to 1931 conditions per place. [2024-01-29 22:57:38,399 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 71 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2024-01-29 22:57:38,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 612 flow [2024-01-29 22:57:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2024-01-29 22:57:38,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7832699619771863 [2024-01-29 22:57:38,402 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 470 flow. Second operand 3 states and 618 transitions. [2024-01-29 22:57:38,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 612 flow [2024-01-29 22:57:38,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 229 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:38,405 INFO L231 Difference]: Finished difference. Result has 229 places, 229 transitions, 466 flow [2024-01-29 22:57:38,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=229, PETRI_TRANSITIONS=229} [2024-01-29 22:57:38,406 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -33 predicate places. [2024-01-29 22:57:38,406 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 229 transitions, 466 flow [2024-01-29 22:57:38,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:38,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:38,407 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:57:38,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:57:38,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:38,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1581204281, now seen corresponding path program 1 times [2024-01-29 22:57:38,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:38,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382793372] [2024-01-29 22:57:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:38,454 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:57:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382793372] [2024-01-29 22:57:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382793372] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:38,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526022627] [2024-01-29 22:57:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:38,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:38,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 263 [2024-01-29 22:57:38,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 229 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:38,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:38,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 263 [2024-01-29 22:57:38,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:38,953 INFO L124 PetriNetUnfolderBase]: 1192/3401 cut-off events. [2024-01-29 22:57:38,953 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:38,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 3401 events. 1192/3401 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28725 event pairs, 969 based on Foata normal form. 0/2872 useless extension candidates. Maximal degree in co-relation 5319. Up to 1932 conditions per place. [2024-01-29 22:57:38,966 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 70 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-01-29 22:57:38,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 228 transitions, 608 flow [2024-01-29 22:57:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-01-29 22:57:38,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.788339670468948 [2024-01-29 22:57:38,968 INFO L175 Difference]: Start difference. First operand has 229 places, 229 transitions, 466 flow. Second operand 3 states and 622 transitions. [2024-01-29 22:57:38,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 228 transitions, 608 flow [2024-01-29 22:57:38,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:38,971 INFO L231 Difference]: Finished difference. Result has 228 places, 228 transitions, 464 flow [2024-01-29 22:57:38,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=228, PETRI_TRANSITIONS=228} [2024-01-29 22:57:38,972 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -34 predicate places. [2024-01-29 22:57:38,972 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 228 transitions, 464 flow [2024-01-29 22:57:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:38,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:38,973 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:57:38,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:57:38,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:38,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 881147299, now seen corresponding path program 1 times [2024-01-29 22:57:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398825746] [2024-01-29 22:57:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:38,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398825746] [2024-01-29 22:57:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398825746] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:39,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162564073] [2024-01-29 22:57:39,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:39,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:39,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 263 [2024-01-29 22:57:39,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 228 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:39,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:39,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 263 [2024-01-29 22:57:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:39,482 INFO L124 PetriNetUnfolderBase]: 1192/3398 cut-off events. [2024-01-29 22:57:39,482 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:39,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 3398 events. 1192/3398 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28707 event pairs, 969 based on Foata normal form. 0/2875 useless extension candidates. Maximal degree in co-relation 5332. Up to 1930 conditions per place. [2024-01-29 22:57:39,509 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-01-29 22:57:39,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 612 flow [2024-01-29 22:57:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions. [2024-01-29 22:57:39,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7591888466413181 [2024-01-29 22:57:39,511 INFO L175 Difference]: Start difference. First operand has 228 places, 228 transitions, 464 flow. Second operand 3 states and 599 transitions. [2024-01-29 22:57:39,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 612 flow [2024-01-29 22:57:39,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:39,513 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 458 flow [2024-01-29 22:57:39,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=223, 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=458, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-01-29 22:57:39,524 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -37 predicate places. [2024-01-29 22:57:39,524 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 458 flow [2024-01-29 22:57:39,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:39,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:39,525 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:57:39,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:57:39,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:39,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -266483073, now seen corresponding path program 1 times [2024-01-29 22:57:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593713039] [2024-01-29 22:57:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:39,564 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:57:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593713039] [2024-01-29 22:57:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593713039] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:39,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714312731] [2024-01-29 22:57:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:39,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:39,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:39,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 263 [2024-01-29 22:57:39,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:39,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:39,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 263 [2024-01-29 22:57:39,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:39,939 INFO L124 PetriNetUnfolderBase]: 1192/3396 cut-off events. [2024-01-29 22:57:39,939 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:39,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5359 conditions, 3396 events. 1192/3396 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28725 event pairs, 969 based on Foata normal form. 0/2874 useless extension candidates. Maximal degree in co-relation 5289. Up to 1931 conditions per place. [2024-01-29 22:57:39,953 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 74 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-01-29 22:57:39,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 223 transitions, 606 flow [2024-01-29 22:57:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2024-01-29 22:57:39,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7604562737642585 [2024-01-29 22:57:39,955 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 458 flow. Second operand 3 states and 600 transitions. [2024-01-29 22:57:39,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 223 transitions, 606 flow [2024-01-29 22:57:39,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 223 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:39,958 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 454 flow [2024-01-29 22:57:39,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2024-01-29 22:57:39,959 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -39 predicate places. [2024-01-29 22:57:39,959 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 454 flow [2024-01-29 22:57:39,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:39,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:39,960 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:57:39,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:57:39,960 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:39,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1607844792, now seen corresponding path program 1 times [2024-01-29 22:57:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869429748] [2024-01-29 22:57:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869429748] [2024-01-29 22:57:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869429748] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490319796] [2024-01-29 22:57:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:40,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:40,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 263 [2024-01-29 22:57:40,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:40,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:40,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 263 [2024-01-29 22:57:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:40,374 INFO L124 PetriNetUnfolderBase]: 1192/3395 cut-off events. [2024-01-29 22:57:40,374 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:40,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 3395 events. 1192/3395 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28713 event pairs, 969 based on Foata normal form. 0/2870 useless extension candidates. Maximal degree in co-relation 5298. Up to 1932 conditions per place. [2024-01-29 22:57:40,388 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 74 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-01-29 22:57:40,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 222 transitions, 604 flow [2024-01-29 22:57:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2024-01-29 22:57:40,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7629911280101395 [2024-01-29 22:57:40,390 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 454 flow. Second operand 3 states and 602 transitions. [2024-01-29 22:57:40,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 222 transitions, 604 flow [2024-01-29 22:57:40,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 222 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:40,393 INFO L231 Difference]: Finished difference. Result has 222 places, 222 transitions, 452 flow [2024-01-29 22:57:40,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, 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=452, PETRI_PLACES=222, PETRI_TRANSITIONS=222} [2024-01-29 22:57:40,394 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -40 predicate places. [2024-01-29 22:57:40,394 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 222 transitions, 452 flow [2024-01-29 22:57:40,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:40,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:40,395 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:57:40,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:57:40,395 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:40,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1049337740, now seen corresponding path program 1 times [2024-01-29 22:57:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:40,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800559161] [2024-01-29 22:57:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:40,441 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:57:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800559161] [2024-01-29 22:57:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800559161] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068102243] [2024-01-29 22:57:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:40,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:40,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 263 [2024-01-29 22:57:40,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:40,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:40,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 263 [2024-01-29 22:57:40,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:40,804 INFO L124 PetriNetUnfolderBase]: 1192/3393 cut-off events. [2024-01-29 22:57:40,804 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 3393 events. 1192/3393 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28652 event pairs, 969 based on Foata normal form. 0/2870 useless extension candidates. Maximal degree in co-relation 5295. Up to 1929 conditions per place. [2024-01-29 22:57:40,817 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 73 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-01-29 22:57:40,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 220 transitions, 598 flow [2024-01-29 22:57:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2024-01-29 22:57:40,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7515842839036755 [2024-01-29 22:57:40,820 INFO L175 Difference]: Start difference. First operand has 222 places, 222 transitions, 452 flow. Second operand 3 states and 593 transitions. [2024-01-29 22:57:40,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 220 transitions, 598 flow [2024-01-29 22:57:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:40,822 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 448 flow [2024-01-29 22:57:40,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=218, 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=448, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2024-01-29 22:57:40,823 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -42 predicate places. [2024-01-29 22:57:40,823 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 448 flow [2024-01-29 22:57:40,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:40,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:40,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] [2024-01-29 22:57:40,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:57:40,824 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:40,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1830269761, now seen corresponding path program 1 times [2024-01-29 22:57:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13128929] [2024-01-29 22:57:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:40,878 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:57:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13128929] [2024-01-29 22:57:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13128929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850783953] [2024-01-29 22:57:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:40,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:40,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:41,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 263 [2024-01-29 22:57:41,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:41,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:41,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 263 [2024-01-29 22:57:41,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:41,252 INFO L124 PetriNetUnfolderBase]: 1192/3392 cut-off events. [2024-01-29 22:57:41,252 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:41,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5354 conditions, 3392 events. 1192/3392 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28700 event pairs, 969 based on Foata normal form. 0/2873 useless extension candidates. Maximal degree in co-relation 5297. Up to 1931 conditions per place. [2024-01-29 22:57:41,264 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 73 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2024-01-29 22:57:41,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 219 transitions, 596 flow [2024-01-29 22:57:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2024-01-29 22:57:41,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7655259822560203 [2024-01-29 22:57:41,267 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 448 flow. Second operand 3 states and 604 transitions. [2024-01-29 22:57:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 219 transitions, 596 flow [2024-01-29 22:57:41,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 219 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:41,270 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 446 flow [2024-01-29 22:57:41,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=217, 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=446, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2024-01-29 22:57:41,271 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -43 predicate places. [2024-01-29 22:57:41,271 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 446 flow [2024-01-29 22:57:41,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:41,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:41,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:41,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:57:41,272 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:41,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 958026685, now seen corresponding path program 1 times [2024-01-29 22:57:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177221358] [2024-01-29 22:57:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:41,314 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:57:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177221358] [2024-01-29 22:57:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177221358] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947794849] [2024-01-29 22:57:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:41,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:41,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 263 [2024-01-29 22:57:41,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:41,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:41,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 263 [2024-01-29 22:57:41,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:41,705 INFO L124 PetriNetUnfolderBase]: 1254/3522 cut-off events. [2024-01-29 22:57:41,705 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:41,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5588 conditions, 3522 events. 1254/3522 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29764 event pairs, 1023 based on Foata normal form. 0/2912 useless extension candidates. Maximal degree in co-relation 5534. Up to 2036 conditions per place. [2024-01-29 22:57:41,717 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2024-01-29 22:57:41,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 598 flow [2024-01-29 22:57:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2024-01-29 22:57:41,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7490494296577946 [2024-01-29 22:57:41,719 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 446 flow. Second operand 3 states and 591 transitions. [2024-01-29 22:57:41,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 598 flow [2024-01-29 22:57:41,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:41,722 INFO L231 Difference]: Finished difference. Result has 218 places, 218 transitions, 444 flow [2024-01-29 22:57:41,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=216, 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=444, PETRI_PLACES=218, PETRI_TRANSITIONS=218} [2024-01-29 22:57:41,723 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -44 predicate places. [2024-01-29 22:57:41,723 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 218 transitions, 444 flow [2024-01-29 22:57:41,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:41,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:41,723 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:57:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:57:41,724 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:41,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash -365942659, now seen corresponding path program 1 times [2024-01-29 22:57:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085411662] [2024-01-29 22:57:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:41,769 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:57:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085411662] [2024-01-29 22:57:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085411662] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971767499] [2024-01-29 22:57:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:41,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:41,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 263 [2024-01-29 22:57:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 218 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:41,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:41,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 263 [2024-01-29 22:57:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:42,148 INFO L124 PetriNetUnfolderBase]: 1192/3390 cut-off events. [2024-01-29 22:57:42,148 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:42,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 3390 events. 1192/3390 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28684 event pairs, 969 based on Foata normal form. 0/2874 useless extension candidates. Maximal degree in co-relation 5299. Up to 1933 conditions per place. [2024-01-29 22:57:42,160 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 73 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-01-29 22:57:42,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 592 flow [2024-01-29 22:57:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2024-01-29 22:57:42,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7541191381495564 [2024-01-29 22:57:42,162 INFO L175 Difference]: Start difference. First operand has 218 places, 218 transitions, 444 flow. Second operand 3 states and 595 transitions. [2024-01-29 22:57:42,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 592 flow [2024-01-29 22:57:42,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:42,164 INFO L231 Difference]: Finished difference. Result has 217 places, 217 transitions, 442 flow [2024-01-29 22:57:42,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=215, 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=442, PETRI_PLACES=217, PETRI_TRANSITIONS=217} [2024-01-29 22:57:42,165 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -45 predicate places. [2024-01-29 22:57:42,165 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 217 transitions, 442 flow [2024-01-29 22:57:42,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:42,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:42,166 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] [2024-01-29 22:57:42,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:57:42,166 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:42,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1448857401, now seen corresponding path program 1 times [2024-01-29 22:57:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296353448] [2024-01-29 22:57:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:42,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:42,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296353448] [2024-01-29 22:57:42,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296353448] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:42,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:42,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:42,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629845992] [2024-01-29 22:57:42,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:42,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:42,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:42,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 263 [2024-01-29 22:57:42,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 217 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:42,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:42,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 263 [2024-01-29 22:57:42,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:42,598 INFO L124 PetriNetUnfolderBase]: 1192/3389 cut-off events. [2024-01-29 22:57:42,598 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:42,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 3389 events. 1192/3389 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28697 event pairs, 969 based on Foata normal form. 0/2874 useless extension candidates. Maximal degree in co-relation 5299. Up to 1932 conditions per place. [2024-01-29 22:57:42,610 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 73 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-01-29 22:57:42,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 590 flow [2024-01-29 22:57:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2024-01-29 22:57:42,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7503168567807351 [2024-01-29 22:57:42,618 INFO L175 Difference]: Start difference. First operand has 217 places, 217 transitions, 442 flow. Second operand 3 states and 592 transitions. [2024-01-29 22:57:42,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 590 flow [2024-01-29 22:57:42,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 216 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:42,635 INFO L231 Difference]: Finished difference. Result has 216 places, 216 transitions, 440 flow [2024-01-29 22:57:42,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=216, PETRI_TRANSITIONS=216} [2024-01-29 22:57:42,636 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -46 predicate places. [2024-01-29 22:57:42,636 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 216 transitions, 440 flow [2024-01-29 22:57:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:42,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:42,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, 1, 1, 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:57:42,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:57:42,637 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:42,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 782596610, now seen corresponding path program 1 times [2024-01-29 22:57:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785431368] [2024-01-29 22:57:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:42,716 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:57:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785431368] [2024-01-29 22:57:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785431368] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845609973] [2024-01-29 22:57:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:42,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:42,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:42,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 263 [2024-01-29 22:57:42,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:42,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:42,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 263 [2024-01-29 22:57:42,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:43,120 INFO L124 PetriNetUnfolderBase]: 1254/3519 cut-off events. [2024-01-29 22:57:43,120 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:43,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 3519 events. 1254/3519 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29744 event pairs, 1023 based on Foata normal form. 0/2912 useless extension candidates. Maximal degree in co-relation 5526. Up to 2035 conditions per place. [2024-01-29 22:57:43,133 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-01-29 22:57:43,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 215 transitions, 592 flow [2024-01-29 22:57:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2024-01-29 22:57:43,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7452471482889734 [2024-01-29 22:57:43,135 INFO L175 Difference]: Start difference. First operand has 216 places, 216 transitions, 440 flow. Second operand 3 states and 588 transitions. [2024-01-29 22:57:43,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 215 transitions, 592 flow [2024-01-29 22:57:43,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:43,137 INFO L231 Difference]: Finished difference. Result has 215 places, 215 transitions, 438 flow [2024-01-29 22:57:43,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=213, 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=438, PETRI_PLACES=215, PETRI_TRANSITIONS=215} [2024-01-29 22:57:43,138 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -47 predicate places. [2024-01-29 22:57:43,138 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 215 transitions, 438 flow [2024-01-29 22:57:43,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:43,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:43,138 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:57:43,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:57:43,139 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:43,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash 456111284, now seen corresponding path program 1 times [2024-01-29 22:57:43,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653493525] [2024-01-29 22:57:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:43,170 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:57:43,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653493525] [2024-01-29 22:57:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653493525] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931657128] [2024-01-29 22:57:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:43,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:43,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 263 [2024-01-29 22:57:43,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 215 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:43,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:43,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 263 [2024-01-29 22:57:43,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:43,555 INFO L124 PetriNetUnfolderBase]: 1192/3384 cut-off events. [2024-01-29 22:57:43,555 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 3384 events. 1192/3384 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 28661 event pairs, 969 based on Foata normal form. 2/2868 useless extension candidates. Maximal degree in co-relation 5283. Up to 1924 conditions per place. [2024-01-29 22:57:43,568 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 74 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-01-29 22:57:43,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 582 flow [2024-01-29 22:57:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2024-01-29 22:57:43,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.770595690747782 [2024-01-29 22:57:43,570 INFO L175 Difference]: Start difference. First operand has 215 places, 215 transitions, 438 flow. Second operand 3 states and 608 transitions. [2024-01-29 22:57:43,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 582 flow [2024-01-29 22:57:43,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 211 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:43,573 INFO L231 Difference]: Finished difference. Result has 211 places, 211 transitions, 430 flow [2024-01-29 22:57:43,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, 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=430, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2024-01-29 22:57:43,573 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -51 predicate places. [2024-01-29 22:57:43,573 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 430 flow [2024-01-29 22:57:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:43,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:43,574 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:57:43,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:57:43,574 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:43,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1254549281, now seen corresponding path program 1 times [2024-01-29 22:57:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027051976] [2024-01-29 22:57:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:43,606 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:57:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027051976] [2024-01-29 22:57:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027051976] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:43,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:43,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993698743] [2024-01-29 22:57:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:43,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:43,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:43,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 263 [2024-01-29 22:57:43,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 263 [2024-01-29 22:57:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:43,975 INFO L124 PetriNetUnfolderBase]: 1192/3383 cut-off events. [2024-01-29 22:57:43,975 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:43,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 3383 events. 1192/3383 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 28624 event pairs, 969 based on Foata normal form. 0/2867 useless extension candidates. Maximal degree in co-relation 5270. Up to 1926 conditions per place. [2024-01-29 22:57:43,984 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 76 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-01-29 22:57:43,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 584 flow [2024-01-29 22:57:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2024-01-29 22:57:43,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7655259822560203 [2024-01-29 22:57:43,986 INFO L175 Difference]: Start difference. First operand has 211 places, 211 transitions, 430 flow. Second operand 3 states and 604 transitions. [2024-01-29 22:57:43,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 584 flow [2024-01-29 22:57:43,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:43,989 INFO L231 Difference]: Finished difference. Result has 210 places, 210 transitions, 428 flow [2024-01-29 22:57:43,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, 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=428, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2024-01-29 22:57:43,989 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-29 22:57:43,989 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 428 flow [2024-01-29 22:57:43,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:43,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:43,990 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:57:43,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:57:43,990 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:43,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1263910834, now seen corresponding path program 1 times [2024-01-29 22:57:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:43,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627522459] [2024-01-29 22:57:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:44,019 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:57:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627522459] [2024-01-29 22:57:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627522459] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484392557] [2024-01-29 22:57:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:44,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:44,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:44,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:44,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 263 [2024-01-29 22:57:44,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:44,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:44,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 263 [2024-01-29 22:57:44,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:44,387 INFO L124 PetriNetUnfolderBase]: 1192/3379 cut-off events. [2024-01-29 22:57:44,387 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:44,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5340 conditions, 3379 events. 1192/3379 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28638 event pairs, 969 based on Foata normal form. 1/2865 useless extension candidates. Maximal degree in co-relation 5271. Up to 1922 conditions per place. [2024-01-29 22:57:44,399 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 72 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-01-29 22:57:44,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 568 flow [2024-01-29 22:57:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2024-01-29 22:57:44,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7680608365019012 [2024-01-29 22:57:44,401 INFO L175 Difference]: Start difference. First operand has 210 places, 210 transitions, 428 flow. Second operand 3 states and 606 transitions. [2024-01-29 22:57:44,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 568 flow [2024-01-29 22:57:44,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 206 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:44,404 INFO L231 Difference]: Finished difference. Result has 206 places, 206 transitions, 420 flow [2024-01-29 22:57:44,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, 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=420, PETRI_PLACES=206, PETRI_TRANSITIONS=206} [2024-01-29 22:57:44,404 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -56 predicate places. [2024-01-29 22:57:44,404 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 206 transitions, 420 flow [2024-01-29 22:57:44,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:44,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:44,405 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:57:44,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:57:44,405 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:44,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1313685957, now seen corresponding path program 1 times [2024-01-29 22:57:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762930430] [2024-01-29 22:57:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:44,432 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:57:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762930430] [2024-01-29 22:57:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762930430] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446462788] [2024-01-29 22:57:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:44,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:44,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:44,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 263 [2024-01-29 22:57:44,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:44,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:44,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 263 [2024-01-29 22:57:44,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:44,780 INFO L124 PetriNetUnfolderBase]: 1192/3373 cut-off events. [2024-01-29 22:57:44,780 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:57:44,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5372 conditions, 3373 events. 1192/3373 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28573 event pairs, 969 based on Foata normal form. 0/2866 useless extension candidates. Maximal degree in co-relation 5257. Up to 1909 conditions per place. [2024-01-29 22:57:44,792 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 110 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-01-29 22:57:44,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 632 flow [2024-01-29 22:57:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-01-29 22:57:44,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628643852978454 [2024-01-29 22:57:44,794 INFO L175 Difference]: Start difference. First operand has 206 places, 206 transitions, 420 flow. Second operand 3 states and 523 transitions. [2024-01-29 22:57:44,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 632 flow [2024-01-29 22:57:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:44,796 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 408 flow [2024-01-29 22:57:44,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, 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=408, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2024-01-29 22:57:44,797 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -62 predicate places. [2024-01-29 22:57:44,797 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 408 flow [2024-01-29 22:57:44,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:44,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:44,798 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:57:44,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:57:44,798 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:44,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash 62653126, now seen corresponding path program 1 times [2024-01-29 22:57:44,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963220509] [2024-01-29 22:57:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:44,877 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:57:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963220509] [2024-01-29 22:57:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963220509] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:57:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793449999] [2024-01-29 22:57:44,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:44,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:44,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:45,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2024-01-29 22:57:45,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:45,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:45,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2024-01-29 22:57:45,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:45,358 INFO L124 PetriNetUnfolderBase]: 1193/3382 cut-off events. [2024-01-29 22:57:45,358 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 22:57:45,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 3382 events. 1193/3382 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28705 event pairs, 969 based on Foata normal form. 0/2872 useless extension candidates. Maximal degree in co-relation 5218. Up to 1909 conditions per place. [2024-01-29 22:57:45,368 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 111 selfloop transitions, 5 changer transitions 0/202 dead transitions. [2024-01-29 22:57:45,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 644 flow [2024-01-29 22:57:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2024-01-29 22:57:45,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6169201520912547 [2024-01-29 22:57:45,370 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 408 flow. Second operand 4 states and 649 transitions. [2024-01-29 22:57:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 644 flow [2024-01-29 22:57:45,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:45,373 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 423 flow [2024-01-29 22:57:45,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2024-01-29 22:57:45,374 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -61 predicate places. [2024-01-29 22:57:45,374 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 423 flow [2024-01-29 22:57:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:45,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:45,374 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:57:45,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:57:45,374 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:45,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148476, now seen corresponding path program 1 times [2024-01-29 22:57:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732768797] [2024-01-29 22:57:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:45,470 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:57:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732768797] [2024-01-29 22:57:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732768797] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:45,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:57:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753925276] [2024-01-29 22:57:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:45,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:45,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:45,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:45,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 263 [2024-01-29 22:57:45,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 201 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:45,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:45,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 263 [2024-01-29 22:57:45,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:45,781 INFO L124 PetriNetUnfolderBase]: 1193/3379 cut-off events. [2024-01-29 22:57:45,781 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-29 22:57:45,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 3379 events. 1193/3379 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28703 event pairs, 969 based on Foata normal form. 1/2871 useless extension candidates. Maximal degree in co-relation 5226. Up to 1933 conditions per place. [2024-01-29 22:57:45,794 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 70 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-01-29 22:57:45,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 205 transitions, 579 flow [2024-01-29 22:57:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 853 transitions. [2024-01-29 22:57:45,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8108365019011406 [2024-01-29 22:57:45,797 INFO L175 Difference]: Start difference. First operand has 201 places, 201 transitions, 423 flow. Second operand 4 states and 853 transitions. [2024-01-29 22:57:45,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 205 transitions, 579 flow [2024-01-29 22:57:45,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 205 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:45,800 INFO L231 Difference]: Finished difference. Result has 204 places, 202 transitions, 439 flow [2024-01-29 22:57:45,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2024-01-29 22:57:45,800 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -58 predicate places. [2024-01-29 22:57:45,800 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 439 flow [2024-01-29 22:57:45,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:45,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:45,801 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:57:45,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:57:45,801 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 22:57:45,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148343, now seen corresponding path program 1 times [2024-01-29 22:57:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887513087] [2024-01-29 22:57:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:45,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:45,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:45,861 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:45,862 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 172 remaining) [2024-01-29 22:57:45,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 172 remaining) [2024-01-29 22:57:45,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 172 remaining) [2024-01-29 22:57:45,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 172 remaining) [2024-01-29 22:57:45,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 172 remaining) [2024-01-29 22:57:45,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 172 remaining) [2024-01-29 22:57:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 172 remaining) [2024-01-29 22:57:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 172 remaining) [2024-01-29 22:57:45,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 172 remaining) [2024-01-29 22:57:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 172 remaining) [2024-01-29 22:57:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 172 remaining) [2024-01-29 22:57:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 172 remaining) [2024-01-29 22:57:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 172 remaining) [2024-01-29 22:57:45,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 172 remaining) [2024-01-29 22:57:45,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 172 remaining) [2024-01-29 22:57:45,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 172 remaining) [2024-01-29 22:57:45,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 172 remaining) [2024-01-29 22:57:45,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 172 remaining) [2024-01-29 22:57:45,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 172 remaining) [2024-01-29 22:57:45,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 172 remaining) [2024-01-29 22:57:45,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 172 remaining) [2024-01-29 22:57:45,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 172 remaining) [2024-01-29 22:57:45,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 172 remaining) [2024-01-29 22:57:45,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 172 remaining) [2024-01-29 22:57:45,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 172 remaining) [2024-01-29 22:57:45,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 172 remaining) [2024-01-29 22:57:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 172 remaining) [2024-01-29 22:57:45,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 172 remaining) [2024-01-29 22:57:45,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 172 remaining) [2024-01-29 22:57:45,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 172 remaining) [2024-01-29 22:57:45,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:57:45,883 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] [2024-01-29 22:57:45,891 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:45,891 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:45,932 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-29 22:57:45,941 INFO L503 ceAbstractionStarter]: Automizer considered 119 witness invariants [2024-01-29 22:57:45,941 INFO L504 ceAbstractionStarter]: WitnessConsidered=119 [2024-01-29 22:57:45,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:45 BasicIcfg [2024-01-29 22:57:45,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:45,942 INFO L158 Benchmark]: Toolchain (without parser) took 16023.81ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 442.2MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,942 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 86.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:45,942 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 125.8MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:45,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.03ms. Allocated memory is still 125.8MB. Free memory was 65.3MB in the beginning and 84.8MB in the end (delta: -19.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.07ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 80.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,943 INFO L158 Benchmark]: Boogie Preprocessor took 80.85ms. Allocated memory is still 125.8MB. Free memory was 80.6MB in the beginning and 76.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,943 INFO L158 Benchmark]: RCFGBuilder took 1078.67ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 76.4MB in the beginning and 113.2MB in the end (delta: -36.8MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,943 INFO L158 Benchmark]: TraceAbstraction took 14349.45ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 112.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 456.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:45,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 86.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 125.8MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.03ms. Allocated memory is still 125.8MB. Free memory was 65.3MB in the beginning and 84.8MB in the end (delta: -19.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.07ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 80.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.85ms. Allocated memory is still 125.8MB. Free memory was 80.6MB in the beginning and 76.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1078.67ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 76.4MB in the beginning and 113.2MB in the end (delta: -36.8MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14349.45ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 112.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 456.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 116]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L39] int* A; [L40] int bag1, bag2, cap1, cap2, sum1, sum2, i, j, N; [L80] pthread_t t1, t2; VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] [L83] bag1 = __VERIFIER_nondet_int() [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] [L84] bag2 = __VERIFIER_nondet_int() [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]]] [L86] cap2 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L87] sum1 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L89] i = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L90] j = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L91] N = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(N) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size >= 0) [L36] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size >= 0) [L110] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L110] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE !(!cond) [L110] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L112] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L113] int i = 0; VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] COND FALSE !(i < size) [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, size=0, sum1=0, sum2=0] - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: 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: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: 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: 63]: 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: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: 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: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: 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: 98]: 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: 97]: 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 5 procedures, 369 locations, 172 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: 14.2s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8148 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2584 mSDsluCounter, 1380 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8581 IncrementalHoareTripleChecker+Invalid, 9334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 753 mSolverCounterUnsat, 1371 mSDtfsCounter, 8581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=0, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 8048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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:57:45,992 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