./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-easy6.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/test-easy6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 13967880 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/test-easy6.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/test-easy6.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-wip.fs.extract-columns-1396788-m [2024-02-02 16:15:48,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 16:15:48,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 16:15:48,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 16:15:48,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 16:15:48,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 16:15:48,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 16:15:48,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 16:15:48,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 16:15:48,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 16:15:48,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 16:15:48,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 16:15:48,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 16:15:48,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 16:15:48,967 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 16:15:48,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 16:15:48,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 16:15:48,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 16:15:48,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 16:15:48,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 16:15:48,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 16:15:48,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 16:15:48,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 16:15:48,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 16:15:48,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 16:15:48,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 16:15:48,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 16:15:48,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 16:15:48,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 16:15:48,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 16:15:48,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 16:15:48,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 16:15:48,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 16:15:48,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 16:15:48,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 16:15:48,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 16:15:48,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 16:15:48,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 16:15:48,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 16:15:48,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 16:15:48,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 16:15:48,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 16:15:48,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 16:15:48,974 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-02-02 16:15:49,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 16:15:49,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 16:15:49,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 16:15:49,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 16:15:49,368 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 16:15:49,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-02-02 16:15:50,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 16:15:50,983 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 16:15:50,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-02-02 16:15:50,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4039aafe/13d657b794a94deba1cb9786e3df0918/FLAG3d99f96c3 [2024-02-02 16:15:51,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4039aafe/13d657b794a94deba1cb9786e3df0918 [2024-02-02 16:15:51,011 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 16:15:51,012 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 16:15:51,014 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/test-easy6.wvr.yml/witness.yml [2024-02-02 16:15:51,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 16:15:51,245 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 16:15:51,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 16:15:51,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 16:15:51,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 16:15:51,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 04:15:51" (1/2) ... [2024-02-02 16:15:51,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ba102b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 04:15:51, skipping insertion in model container [2024-02-02 16:15:51,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 04:15:51" (1/2) ... [2024-02-02 16:15:51,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c281e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 04:15:51, skipping insertion in model container [2024-02-02 16:15:51,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:15:51" (2/2) ... [2024-02-02 16:15:51,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ba102b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51, skipping insertion in model container [2024-02-02 16:15:51,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:15:51" (2/2) ... [2024-02-02 16:15:51,254 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 16:15:51,328 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 16:15:51,329 INFO L101 nessWitnessExtractor]: Location invariant before [L91-L91] ((((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n1)) && ((unsigned long )_argptr == 0UL)) && (n1 != 0)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L98-L98] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1)) && (0 <= i2)) && (1 <= i)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L45-L45] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e1 == (_Bool)1)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e2 == (_Bool)0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,330 INFO L101 nessWitnessExtractor]: Location invariant before [L83-L83] (((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] ((((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n2)) && ((unsigned long )_argptr == 0UL)) && (n2 != 0)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e1 == (_Bool)0)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L80-L80] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1)) && (0 <= i2)) && (1 <= i)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,331 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,332 INFO L101 nessWitnessExtractor]: Location invariant before [L103-L103] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,333 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,333 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] (((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,333 INFO L101 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,333 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (n1 == 0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L94-L94] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L95-L95] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L60-L60] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L99-L99] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L101-L101] (((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (n2 == 0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,334 INFO L101 nessWitnessExtractor]: Location invariant before [L63-L63] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,335 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,335 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,335 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,335 INFO L101 nessWitnessExtractor]: Location invariant before [L82-L82] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,336 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,336 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,337 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,337 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,337 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,337 INFO L101 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,337 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L100-L100] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L81-L81] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L62-L62] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L77-L77] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e2 == (_Bool)1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-02-02 16:15:51,338 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L110-L110] ((((((((e1 == (_Bool)0) && (e2 == (_Bool)0)) && (n1 == 0)) && (n2 == 0)) && (tmp1 == 0)) && (tmp2 == 0)) && (i == 0)) && (i1 == 0)) && (i2 == 0) [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L84-L84] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,339 INFO L101 nessWitnessExtractor]: Location invariant before [L48-L48] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,340 INFO L101 nessWitnessExtractor]: Location invariant before [L97-L97] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-02-02 16:15:51,340 INFO L101 nessWitnessExtractor]: Location invariant before [L93-L93] (unsigned long )_argptr == 0UL [2024-02-02 16:15:51,361 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-02 16:15:51,518 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/test-easy6.wvr.c[3072,3085] [2024-02-02 16:15:51,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 16:15:51,530 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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-02-02 16:15:51,656 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/test-easy6.wvr.c[3072,3085] [2024-02-02 16:15:51,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 16:15:51,669 INFO L208 MainTranslator]: Completed translation [2024-02-02 16:15:51,670 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51 WrapperNode [2024-02-02 16:15:51,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 16:15:51,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 16:15:51,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 16:15:51,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 16:15:51,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,721 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-02-02 16:15:51,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 16:15:51,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 16:15:51,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 16:15:51,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 16:15:51,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,750 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-02 16:15:51,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 16:15:51,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 16:15:51,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 16:15:51,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 16:15:51,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (1/1) ... [2024-02-02 16:15:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 16:15:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 16:15:51,829 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-02-02 16:15:51,854 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-02-02 16:15:51,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 16:15:51,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 16:15:51,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 16:15:51,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 16:15:51,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 16:15:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 16:15:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 16:15:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 16:15:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 16:15:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 16:15:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 16:15:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 16:15:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 16:15:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 16:15:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 16:15:51,875 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 16:15:51,998 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 16:15:52,001 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 16:15:52,620 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 16:15:52,620 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 16:15:52,814 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 16:15:52,814 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 16:15:52,814 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 04:15:52 BoogieIcfgContainer [2024-02-02 16:15:52,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 16:15:52,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 16:15:52,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 16:15:52,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 16:15:52,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 04:15:51" (1/4) ... [2024-02-02 16:15:52,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e27a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 04:15:52, skipping insertion in model container [2024-02-02 16:15:52,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:15:51" (2/4) ... [2024-02-02 16:15:52,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e27a97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 04:15:52, skipping insertion in model container [2024-02-02 16:15:52,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:15:51" (3/4) ... [2024-02-02 16:15:52,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e27a97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 04:15:52, skipping insertion in model container [2024-02-02 16:15:52,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 04:15:52" (4/4) ... [2024-02-02 16:15:52,821 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2024-02-02 16:15:52,834 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 16:15:52,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-02-02 16:15:52,834 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 16:15:52,909 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 16:15:52,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 236 flow [2024-02-02 16:15:52,975 INFO L124 PetriNetUnfolderBase]: 0/109 cut-off events. [2024-02-02 16:15:52,975 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 16:15:52,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 0/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 298 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-02 16:15:52,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 236 flow [2024-02-02 16:15:52,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 228 flow [2024-02-02 16:15:52,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 16:15:52,997 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;@59bbe511, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 16:15:52,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 116 error locations. [2024-02-02 16:15:52,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 16:15:52,999 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 16:15:52,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 16:15:53,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:53,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 16:15:53,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:53,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash 16279, now seen corresponding path program 1 times [2024-02-02 16:15:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859893695] [2024-02-02 16:15:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859893695] [2024-02-02 16:15:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859893695] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 16:15:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763757726] [2024-02-02 16:15:53,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:53,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 16:15:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 16:15:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 16:15:53,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 111 [2024-02-02 16:15:53,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:53,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:53,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 111 [2024-02-02 16:15:53,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:54,011 INFO L124 PetriNetUnfolderBase]: 1197/2839 cut-off events. [2024-02-02 16:15:54,011 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-02 16:15:54,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 2839 events. 1197/2839 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21652 event pairs, 655 based on Foata normal form. 0/1723 useless extension candidates. Maximal degree in co-relation 4793. Up to 2061 conditions per place. [2024-02-02 16:15:54,029 INFO L140 encePairwiseOnDemand]: 89/111 looper letters, 52 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-02-02 16:15:54,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 317 flow [2024-02-02 16:15:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 16:15:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 16:15:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-02-02 16:15:54,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156156156156156 [2024-02-02 16:15:54,040 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 228 flow. Second operand 3 states and 205 transitions. [2024-02-02 16:15:54,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 317 flow [2024-02-02 16:15:54,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 307 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 16:15:54,046 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 199 flow [2024-02-02 16:15:54,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-02-02 16:15:54,050 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -20 predicate places. [2024-02-02 16:15:54,050 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 199 flow [2024-02-02 16:15:54,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:54,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:54,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 16:15:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 16:15:54,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:54,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 485639763, now seen corresponding path program 1 times [2024-02-02 16:15:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287663423] [2024-02-02 16:15:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287663423] [2024-02-02 16:15:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287663423] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:15:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571588919] [2024-02-02 16:15:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:54,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:15:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:15:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:15:54,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-02-02 16:15:54,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:54,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:54,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-02-02 16:15:54,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:54,496 INFO L124 PetriNetUnfolderBase]: 1257/2886 cut-off events. [2024-02-02 16:15:54,496 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-02-02 16:15:54,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 2886 events. 1257/2886 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21523 event pairs, 743 based on Foata normal form. 378/2249 useless extension candidates. Maximal degree in co-relation 2402. Up to 2120 conditions per place. [2024-02-02 16:15:54,509 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 71 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2024-02-02 16:15:54,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 373 flow [2024-02-02 16:15:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:15:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:15:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2024-02-02 16:15:54,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-02-02 16:15:54,511 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 199 flow. Second operand 4 states and 213 transitions. [2024-02-02 16:15:54,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 373 flow [2024-02-02 16:15:54,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 16:15:54,513 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 180 flow [2024-02-02 16:15:54,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2024-02-02 16:15:54,514 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-02-02 16:15:54,514 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 180 flow [2024-02-02 16:15:54,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:54,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:54,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 16:15:54,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 16:15:54,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:54,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2125035946, now seen corresponding path program 1 times [2024-02-02 16:15:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352290602] [2024-02-02 16:15:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352290602] [2024-02-02 16:15:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352290602] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:15:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437724005] [2024-02-02 16:15:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:54,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 16:15:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 16:15:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 16:15:54,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:54,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:54,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:54,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:54,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:55,187 INFO L124 PetriNetUnfolderBase]: 1789/3696 cut-off events. [2024-02-02 16:15:55,188 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2024-02-02 16:15:55,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 3696 events. 1789/3696 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 25076 event pairs, 613 based on Foata normal form. 9/2567 useless extension candidates. Maximal degree in co-relation 6664. Up to 2793 conditions per place. [2024-02-02 16:15:55,202 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-02-02 16:15:55,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 111 transitions, 433 flow [2024-02-02 16:15:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 16:15:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 16:15:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-02-02 16:15:55,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3801801801801802 [2024-02-02 16:15:55,204 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 180 flow. Second operand 5 states and 211 transitions. [2024-02-02 16:15:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 111 transitions, 433 flow [2024-02-02 16:15:55,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:15:55,206 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 220 flow [2024-02-02 16:15:55,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2024-02-02 16:15:55,207 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -23 predicate places. [2024-02-02 16:15:55,207 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 220 flow [2024-02-02 16:15:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:55,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:55,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 16:15:55,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:55,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1453984249, now seen corresponding path program 1 times [2024-02-02 16:15:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855495948] [2024-02-02 16:15:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:55,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855495948] [2024-02-02 16:15:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855495948] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:55,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:15:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724728997] [2024-02-02 16:15:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:15:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:15:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:15:55,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-02-02 16:15:55,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:55,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:55,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-02-02 16:15:55,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:55,628 INFO L124 PetriNetUnfolderBase]: 1266/2607 cut-off events. [2024-02-02 16:15:55,628 INFO L125 PetriNetUnfolderBase]: For 276/281 co-relation queries the response was YES. [2024-02-02 16:15:55,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 2607 events. 1266/2607 cut-off events. For 276/281 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 17853 event pairs, 52 based on Foata normal form. 397/2362 useless extension candidates. Maximal degree in co-relation 5105. Up to 2084 conditions per place. [2024-02-02 16:15:55,639 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 91 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-02-02 16:15:55,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 114 transitions, 483 flow [2024-02-02 16:15:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:15:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:15:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-02-02 16:15:55,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-02-02 16:15:55,640 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 220 flow. Second operand 4 states and 230 transitions. [2024-02-02 16:15:55,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 114 transitions, 483 flow [2024-02-02 16:15:55,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:15:55,645 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 197 flow [2024-02-02 16:15:55,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-02-02 16:15:55,646 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -32 predicate places. [2024-02-02 16:15:55,647 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 197 flow [2024-02-02 16:15:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:55,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:55,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:55,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 16:15:55,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:55,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2123838126, now seen corresponding path program 1 times [2024-02-02 16:15:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006255893] [2024-02-02 16:15:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006255893] [2024-02-02 16:15:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006255893] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:15:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541794854] [2024-02-02 16:15:55,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 16:15:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 16:15:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 16:15:55,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:55,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:55,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:55,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:55,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:56,257 INFO L124 PetriNetUnfolderBase]: 1808/3299 cut-off events. [2024-02-02 16:15:56,257 INFO L125 PetriNetUnfolderBase]: For 301/306 co-relation queries the response was YES. [2024-02-02 16:15:56,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6825 conditions, 3299 events. 1808/3299 cut-off events. For 301/306 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 19994 event pairs, 619 based on Foata normal form. 7/2558 useless extension candidates. Maximal degree in co-relation 6808. Up to 2869 conditions per place. [2024-02-02 16:15:56,277 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 79 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2024-02-02 16:15:56,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 440 flow [2024-02-02 16:15:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 16:15:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 16:15:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-02-02 16:15:56,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2024-02-02 16:15:56,297 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 197 flow. Second operand 5 states and 207 transitions. [2024-02-02 16:15:56,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 99 transitions, 440 flow [2024-02-02 16:15:56,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 99 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:15:56,299 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 230 flow [2024-02-02 16:15:56,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-02-02 16:15:56,300 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-02-02 16:15:56,300 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 230 flow [2024-02-02 16:15:56,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:56,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:56,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:56,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 16:15:56,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:56,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2050058727, now seen corresponding path program 1 times [2024-02-02 16:15:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46348235] [2024-02-02 16:15:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46348235] [2024-02-02 16:15:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46348235] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:56,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:56,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:15:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618817852] [2024-02-02 16:15:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:56,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:15:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:15:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:15:56,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:56,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:56,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:56,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:56,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:57,234 INFO L124 PetriNetUnfolderBase]: 1766/3209 cut-off events. [2024-02-02 16:15:57,235 INFO L125 PetriNetUnfolderBase]: For 409/425 co-relation queries the response was YES. [2024-02-02 16:15:57,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3209 events. 1766/3209 cut-off events. For 409/425 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 19870 event pairs, 613 based on Foata normal form. 9/2478 useless extension candidates. Maximal degree in co-relation 6357. Up to 2793 conditions per place. [2024-02-02 16:15:57,252 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2024-02-02 16:15:57,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 106 transitions, 495 flow [2024-02-02 16:15:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:15:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:15:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-02-02 16:15:57,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-02-02 16:15:57,269 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 230 flow. Second operand 6 states and 239 transitions. [2024-02-02 16:15:57,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 106 transitions, 495 flow [2024-02-02 16:15:57,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:15:57,273 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 259 flow [2024-02-02 16:15:57,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-02-02 16:15:57,275 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -24 predicate places. [2024-02-02 16:15:57,275 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 259 flow [2024-02-02 16:15:57,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:57,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:57,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 16:15:57,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:57,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash -898952171, now seen corresponding path program 1 times [2024-02-02 16:15:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072075563] [2024-02-02 16:15:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:57,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-02-02 16:15:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072075563] [2024-02-02 16:15:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072075563] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:15:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392610075] [2024-02-02 16:15:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:57,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:15:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:15:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:15:57,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:57,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:57,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:57,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:57,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:58,155 INFO L124 PetriNetUnfolderBase]: 1766/3153 cut-off events. [2024-02-02 16:15:58,155 INFO L125 PetriNetUnfolderBase]: For 565/570 co-relation queries the response was YES. [2024-02-02 16:15:58,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6858 conditions, 3153 events. 1766/3153 cut-off events. For 565/570 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19266 event pairs, 771 based on Foata normal form. 11/2480 useless extension candidates. Maximal degree in co-relation 6836. Up to 2869 conditions per place. [2024-02-02 16:15:58,171 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 82 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2024-02-02 16:15:58,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 517 flow [2024-02-02 16:15:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:15:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:15:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-02-02 16:15:58,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-02-02 16:15:58,193 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 259 flow. Second operand 6 states and 237 transitions. [2024-02-02 16:15:58,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 517 flow [2024-02-02 16:15:58,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 495 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-02 16:15:58,196 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 279 flow [2024-02-02 16:15:58,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-02-02 16:15:58,196 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -22 predicate places. [2024-02-02 16:15:58,196 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 279 flow [2024-02-02 16:15:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:58,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:58,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 16:15:58,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:58,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2145456550, now seen corresponding path program 1 times [2024-02-02 16:15:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309389269] [2024-02-02 16:15:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:58,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309389269] [2024-02-02 16:15:58,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309389269] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:58,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:15:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957756307] [2024-02-02 16:15:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:58,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:15:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:58,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:15:58,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:15:58,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:58,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:58,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:58,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:58,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:58,972 INFO L124 PetriNetUnfolderBase]: 1772/3227 cut-off events. [2024-02-02 16:15:58,973 INFO L125 PetriNetUnfolderBase]: For 765/770 co-relation queries the response was YES. [2024-02-02 16:15:58,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7092 conditions, 3227 events. 1772/3227 cut-off events. For 765/770 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 19553 event pairs, 618 based on Foata normal form. 9/2586 useless extension candidates. Maximal degree in co-relation 7069. Up to 2871 conditions per place. [2024-02-02 16:15:58,987 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 81 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-02-02 16:15:58,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 543 flow [2024-02-02 16:15:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:15:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:15:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-02-02 16:15:59,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2024-02-02 16:15:59,001 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 279 flow. Second operand 6 states and 236 transitions. [2024-02-02 16:15:59,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 543 flow [2024-02-02 16:15:59,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 106 transitions, 528 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 16:15:59,005 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 318 flow [2024-02-02 16:15:59,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2024-02-02 16:15:59,007 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -18 predicate places. [2024-02-02 16:15:59,008 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 318 flow [2024-02-02 16:15:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:59,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:59,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 16:15:59,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:59,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2099344360, now seen corresponding path program 2 times [2024-02-02 16:15:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408074284] [2024-02-02 16:15:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:59,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:59,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408074284] [2024-02-02 16:15:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408074284] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:59,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:15:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657309663] [2024-02-02 16:15:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:15:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:59,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:15:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:15:59,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:59,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:59,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:59,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:59,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:15:59,632 INFO L124 PetriNetUnfolderBase]: 1766/3207 cut-off events. [2024-02-02 16:15:59,633 INFO L125 PetriNetUnfolderBase]: For 1024/1029 co-relation queries the response was YES. [2024-02-02 16:15:59,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7150 conditions, 3207 events. 1766/3207 cut-off events. For 1024/1029 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 19445 event pairs, 627 based on Foata normal form. 9/2564 useless extension candidates. Maximal degree in co-relation 7125. Up to 2869 conditions per place. [2024-02-02 16:15:59,649 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 78 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-02-02 16:15:59,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 561 flow [2024-02-02 16:15:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:15:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:15:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-02-02 16:15:59,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34984984984984985 [2024-02-02 16:15:59,651 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 318 flow. Second operand 6 states and 233 transitions. [2024-02-02 16:15:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 561 flow [2024-02-02 16:15:59,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 533 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-02 16:15:59,654 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 332 flow [2024-02-02 16:15:59,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-02-02 16:15:59,655 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -16 predicate places. [2024-02-02 16:15:59,655 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 332 flow [2024-02-02 16:15:59,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:59,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:15:59,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:15:59,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 16:15:59,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:15:59,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:15:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2099342920, now seen corresponding path program 1 times [2024-02-02 16:15:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:15:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117014578] [2024-02-02 16:15:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:15:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:15:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:15:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:15:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:15:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117014578] [2024-02-02 16:15:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117014578] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:15:59,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:15:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:15:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815427548] [2024-02-02 16:15:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:15:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:15:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:15:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:15:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:15:59,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:15:59,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:15:59,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:15:59,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:15:59,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:00,485 INFO L124 PetriNetUnfolderBase]: 1770/3339 cut-off events. [2024-02-02 16:16:00,486 INFO L125 PetriNetUnfolderBase]: For 1090/1110 co-relation queries the response was YES. [2024-02-02 16:16:00,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 3339 events. 1770/3339 cut-off events. For 1090/1110 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20196 event pairs, 673 based on Foata normal form. 11/2674 useless extension candidates. Maximal degree in co-relation 6978. Up to 2857 conditions per place. [2024-02-02 16:16:00,517 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2024-02-02 16:16:00,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 615 flow [2024-02-02 16:16:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-02-02 16:16:00,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-02-02 16:16:00,518 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 332 flow. Second operand 6 states and 237 transitions. [2024-02-02 16:16:00,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 615 flow [2024-02-02 16:16:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 590 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:00,522 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 375 flow [2024-02-02 16:16:00,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-02-02 16:16:00,523 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -12 predicate places. [2024-02-02 16:16:00,529 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 375 flow [2024-02-02 16:16:00,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:00,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:00,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 16:16:00,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:00,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -885335720, now seen corresponding path program 2 times [2024-02-02 16:16:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301960702] [2024-02-02 16:16:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301960702] [2024-02-02 16:16:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301960702] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128737815] [2024-02-02 16:16:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:00,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:00,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:00,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:00,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:00,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:00,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:01,467 INFO L124 PetriNetUnfolderBase]: 1764/3333 cut-off events. [2024-02-02 16:16:01,467 INFO L125 PetriNetUnfolderBase]: For 1272/1286 co-relation queries the response was YES. [2024-02-02 16:16:01,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 3333 events. 1764/3333 cut-off events. For 1272/1286 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20088 event pairs, 668 based on Foata normal form. 12/2673 useless extension candidates. Maximal degree in co-relation 7020. Up to 2855 conditions per place. [2024-02-02 16:16:01,483 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 80 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2024-02-02 16:16:01,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 619 flow [2024-02-02 16:16:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-02-02 16:16:01,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-02-02 16:16:01,485 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 375 flow. Second operand 6 states and 234 transitions. [2024-02-02 16:16:01,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 619 flow [2024-02-02 16:16:01,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 599 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:01,488 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 392 flow [2024-02-02 16:16:01,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-02-02 16:16:01,489 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-02-02 16:16:01,489 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 392 flow [2024-02-02 16:16:01,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:01,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:01,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:01,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 16:16:01,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:01,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash 857248063, now seen corresponding path program 1 times [2024-02-02 16:16:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:01,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496155778] [2024-02-02 16:16:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:01,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:01,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496155778] [2024-02-02 16:16:01,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496155778] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:01,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:01,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:01,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880061977] [2024-02-02 16:16:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:01,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:01,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:01,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:01,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:01,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:01,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:01,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:02,620 INFO L124 PetriNetUnfolderBase]: 1596/3003 cut-off events. [2024-02-02 16:16:02,621 INFO L125 PetriNetUnfolderBase]: For 1180/1204 co-relation queries the response was YES. [2024-02-02 16:16:02,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 3003 events. 1596/3003 cut-off events. For 1180/1204 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 17789 event pairs, 497 based on Foata normal form. 7/2410 useless extension candidates. Maximal degree in co-relation 6394. Up to 2397 conditions per place. [2024-02-02 16:16:02,648 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 105 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-02-02 16:16:02,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 799 flow [2024-02-02 16:16:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 305 transitions. [2024-02-02 16:16:02,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34346846846846846 [2024-02-02 16:16:02,664 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 392 flow. Second operand 8 states and 305 transitions. [2024-02-02 16:16:02,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 799 flow [2024-02-02 16:16:02,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 138 transitions, 747 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-02-02 16:16:02,668 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 458 flow [2024-02-02 16:16:02,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2024-02-02 16:16:02,669 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-02-02 16:16:02,669 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 458 flow [2024-02-02 16:16:02,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:02,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:02,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:02,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 16:16:02,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:02,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 391042397, now seen corresponding path program 1 times [2024-02-02 16:16:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696391726] [2024-02-02 16:16:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696391726] [2024-02-02 16:16:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696391726] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:02,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141829713] [2024-02-02 16:16:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:03,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:03,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:03,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:03,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:03,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:03,757 INFO L124 PetriNetUnfolderBase]: 1644/3073 cut-off events. [2024-02-02 16:16:03,758 INFO L125 PetriNetUnfolderBase]: For 1616/1649 co-relation queries the response was YES. [2024-02-02 16:16:03,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 3073 events. 1644/3073 cut-off events. For 1616/1649 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18172 event pairs, 691 based on Foata normal form. 31/2564 useless extension candidates. Maximal degree in co-relation 6924. Up to 2565 conditions per place. [2024-02-02 16:16:03,811 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 91 selfloop transitions, 21 changer transitions 0/125 dead transitions. [2024-02-02 16:16:03,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 125 transitions, 778 flow [2024-02-02 16:16:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-02-02 16:16:03,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633633633633634 [2024-02-02 16:16:03,813 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 458 flow. Second operand 6 states and 242 transitions. [2024-02-02 16:16:03,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 125 transitions, 778 flow [2024-02-02 16:16:03,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 762 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:03,817 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 508 flow [2024-02-02 16:16:03,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2024-02-02 16:16:03,819 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2024-02-02 16:16:03,819 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 508 flow [2024-02-02 16:16:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:03,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:03,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 16:16:03,820 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:03,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1821133157, now seen corresponding path program 1 times [2024-02-02 16:16:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636200555] [2024-02-02 16:16:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636200555] [2024-02-02 16:16:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636200555] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439400446] [2024-02-02 16:16:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:04,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:04,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:04,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:04,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:04,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:04,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:04,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:04,788 INFO L124 PetriNetUnfolderBase]: 1648/2963 cut-off events. [2024-02-02 16:16:04,788 INFO L125 PetriNetUnfolderBase]: For 2251/2260 co-relation queries the response was YES. [2024-02-02 16:16:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7385 conditions, 2963 events. 1648/2963 cut-off events. For 2251/2260 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17740 event pairs, 750 based on Foata normal form. 17/2508 useless extension candidates. Maximal degree in co-relation 7350. Up to 2559 conditions per place. [2024-02-02 16:16:04,804 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 95 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-02-02 16:16:04,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 873 flow [2024-02-02 16:16:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-02-02 16:16:04,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738738738738739 [2024-02-02 16:16:04,806 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 508 flow. Second operand 6 states and 249 transitions. [2024-02-02 16:16:04,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 873 flow [2024-02-02 16:16:04,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 835 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 16:16:04,810 INFO L231 Difference]: Finished difference. Result has 119 places, 103 transitions, 572 flow [2024-02-02 16:16:04,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=119, PETRI_TRANSITIONS=103} [2024-02-02 16:16:04,811 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2024-02-02 16:16:04,811 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 103 transitions, 572 flow [2024-02-02 16:16:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:04,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:04,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:04,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-02 16:16:04,812 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:04,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1451474299, now seen corresponding path program 2 times [2024-02-02 16:16:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295971667] [2024-02-02 16:16:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295971667] [2024-02-02 16:16:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295971667] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:05,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:05,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666899969] [2024-02-02 16:16:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:05,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:05,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:05,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:05,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 103 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:05,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:05,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:05,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:05,413 INFO L124 PetriNetUnfolderBase]: 1981/3604 cut-off events. [2024-02-02 16:16:05,413 INFO L125 PetriNetUnfolderBase]: For 3424/3489 co-relation queries the response was YES. [2024-02-02 16:16:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 3604 events. 1981/3604 cut-off events. For 3424/3489 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 21219 event pairs, 807 based on Foata normal form. 68/3111 useless extension candidates. Maximal degree in co-relation 8948. Up to 2838 conditions per place. [2024-02-02 16:16:05,430 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 96 selfloop transitions, 25 changer transitions 0/136 dead transitions. [2024-02-02 16:16:05,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 956 flow [2024-02-02 16:16:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-02-02 16:16:05,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663663663663664 [2024-02-02 16:16:05,432 INFO L175 Difference]: Start difference. First operand has 119 places, 103 transitions, 572 flow. Second operand 6 states and 244 transitions. [2024-02-02 16:16:05,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 956 flow [2024-02-02 16:16:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 906 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 16:16:05,438 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 611 flow [2024-02-02 16:16:05,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2024-02-02 16:16:05,439 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2024-02-02 16:16:05,439 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 611 flow [2024-02-02 16:16:05,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:05,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:05,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-02 16:16:05,440 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:05,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -449614727, now seen corresponding path program 2 times [2024-02-02 16:16:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501445905] [2024-02-02 16:16:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501445905] [2024-02-02 16:16:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501445905] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:05,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902928603] [2024-02-02 16:16:05,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:05,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:05,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:05,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:05,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:05,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:05,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:06,150 INFO L124 PetriNetUnfolderBase]: 1642/2957 cut-off events. [2024-02-02 16:16:06,150 INFO L125 PetriNetUnfolderBase]: For 2875/2888 co-relation queries the response was YES. [2024-02-02 16:16:06,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 2957 events. 1642/2957 cut-off events. For 2875/2888 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17723 event pairs, 765 based on Foata normal form. 57/2540 useless extension candidates. Maximal degree in co-relation 7720. Up to 2573 conditions per place. [2024-02-02 16:16:06,170 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-02-02 16:16:06,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 902 flow [2024-02-02 16:16:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-02-02 16:16:06,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-02-02 16:16:06,172 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 611 flow. Second operand 6 states and 234 transitions. [2024-02-02 16:16:06,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 902 flow [2024-02-02 16:16:06,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 872 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:06,177 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 649 flow [2024-02-02 16:16:06,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2024-02-02 16:16:06,178 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2024-02-02 16:16:06,178 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 649 flow [2024-02-02 16:16:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:06,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:06,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-02 16:16:06,179 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:06,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1614885897, now seen corresponding path program 3 times [2024-02-02 16:16:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30730408] [2024-02-02 16:16:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30730408] [2024-02-02 16:16:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30730408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 16:16:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217095007] [2024-02-02 16:16:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 16:16:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 16:16:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 16:16:06,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:06,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:06,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:06,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:06,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:06,803 INFO L124 PetriNetUnfolderBase]: 1847/3380 cut-off events. [2024-02-02 16:16:06,804 INFO L125 PetriNetUnfolderBase]: For 4071/4127 co-relation queries the response was YES. [2024-02-02 16:16:06,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8829 conditions, 3380 events. 1847/3380 cut-off events. For 4071/4127 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19696 event pairs, 750 based on Foata normal form. 50/2878 useless extension candidates. Maximal degree in co-relation 8528. Up to 2828 conditions per place. [2024-02-02 16:16:06,815 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 84 selfloop transitions, 31 changer transitions 0/130 dead transitions. [2024-02-02 16:16:06,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 960 flow [2024-02-02 16:16:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 16:16:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 16:16:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-02-02 16:16:06,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-02-02 16:16:06,817 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 649 flow. Second operand 6 states and 239 transitions. [2024-02-02 16:16:06,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 130 transitions, 960 flow [2024-02-02 16:16:06,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 891 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-02-02 16:16:06,822 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 703 flow [2024-02-02 16:16:06,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-02-02 16:16:06,823 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 11 predicate places. [2024-02-02 16:16:06,823 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 703 flow [2024-02-02 16:16:06,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:06,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:06,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-02 16:16:06,823 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:06,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1188807365, now seen corresponding path program 1 times [2024-02-02 16:16:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:06,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53084095] [2024-02-02 16:16:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53084095] [2024-02-02 16:16:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53084095] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480766423] [2024-02-02 16:16:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:07,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:07,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:07,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:07,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 703 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:07,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:07,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:07,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:07,457 INFO L124 PetriNetUnfolderBase]: 1460/2669 cut-off events. [2024-02-02 16:16:07,458 INFO L125 PetriNetUnfolderBase]: For 3341/3390 co-relation queries the response was YES. [2024-02-02 16:16:07,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7325 conditions, 2669 events. 1460/2669 cut-off events. For 3341/3390 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 15616 event pairs, 661 based on Foata normal form. 17/2268 useless extension candidates. Maximal degree in co-relation 7284. Up to 1931 conditions per place. [2024-02-02 16:16:07,473 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 109 selfloop transitions, 26 changer transitions 0/150 dead transitions. [2024-02-02 16:16:07,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 150 transitions, 1101 flow [2024-02-02 16:16:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 16:16:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 16:16:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2024-02-02 16:16:07,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3539253539253539 [2024-02-02 16:16:07,476 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 703 flow. Second operand 7 states and 275 transitions. [2024-02-02 16:16:07,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 150 transitions, 1101 flow [2024-02-02 16:16:07,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 150 transitions, 1047 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-02 16:16:07,485 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 759 flow [2024-02-02 16:16:07,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=759, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-02-02 16:16:07,486 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2024-02-02 16:16:07,486 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 759 flow [2024-02-02 16:16:07,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:07,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:07,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:07,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-02 16:16:07,487 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:07,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash -818312030, now seen corresponding path program 1 times [2024-02-02 16:16:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:07,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431476862] [2024-02-02 16:16:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431476862] [2024-02-02 16:16:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431476862] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296520210] [2024-02-02 16:16:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:07,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:07,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:07,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 759 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:07,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:07,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:07,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:08,202 INFO L124 PetriNetUnfolderBase]: 1495/2748 cut-off events. [2024-02-02 16:16:08,203 INFO L125 PetriNetUnfolderBase]: For 3708/3790 co-relation queries the response was YES. [2024-02-02 16:16:08,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 2748 events. 1495/2748 cut-off events. For 3708/3790 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15625 event pairs, 487 based on Foata normal form. 47/2463 useless extension candidates. Maximal degree in co-relation 7508. Up to 1805 conditions per place. [2024-02-02 16:16:08,219 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 113 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-02-02 16:16:08,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 156 transitions, 1167 flow [2024-02-02 16:16:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 306 transitions. [2024-02-02 16:16:08,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2024-02-02 16:16:08,221 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 759 flow. Second operand 8 states and 306 transitions. [2024-02-02 16:16:08,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 156 transitions, 1167 flow [2024-02-02 16:16:08,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 156 transitions, 1137 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:08,229 INFO L231 Difference]: Finished difference. Result has 138 places, 118 transitions, 831 flow [2024-02-02 16:16:08,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=831, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2024-02-02 16:16:08,230 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2024-02-02 16:16:08,230 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 831 flow [2024-02-02 16:16:08,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:08,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:08,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:08,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-02 16:16:08,231 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:08,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1006496784, now seen corresponding path program 1 times [2024-02-02 16:16:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275259678] [2024-02-02 16:16:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275259678] [2024-02-02 16:16:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275259678] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192566870] [2024-02-02 16:16:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:08,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:08,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:08,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:08,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:08,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:08,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:09,379 INFO L124 PetriNetUnfolderBase]: 1403/2618 cut-off events. [2024-02-02 16:16:09,379 INFO L125 PetriNetUnfolderBase]: For 4505/4558 co-relation queries the response was YES. [2024-02-02 16:16:09,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7704 conditions, 2618 events. 1403/2618 cut-off events. For 4505/4558 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15031 event pairs, 490 based on Foata normal form. 19/2315 useless extension candidates. Maximal degree in co-relation 7658. Up to 1812 conditions per place. [2024-02-02 16:16:09,392 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 34 changer transitions 0/151 dead transitions. [2024-02-02 16:16:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 151 transitions, 1284 flow [2024-02-02 16:16:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-02-02 16:16:09,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-02-02 16:16:09,394 INFO L175 Difference]: Start difference. First operand has 138 places, 118 transitions, 831 flow. Second operand 8 states and 294 transitions. [2024-02-02 16:16:09,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 151 transitions, 1284 flow [2024-02-02 16:16:09,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 151 transitions, 1243 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-02 16:16:09,406 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 969 flow [2024-02-02 16:16:09,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2024-02-02 16:16:09,407 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 29 predicate places. [2024-02-02 16:16:09,407 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 969 flow [2024-02-02 16:16:09,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:09,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:09,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:09,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-02 16:16:09,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1930508408, now seen corresponding path program 2 times [2024-02-02 16:16:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947979909] [2024-02-02 16:16:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947979909] [2024-02-02 16:16:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947979909] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588848578] [2024-02-02 16:16:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:09,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:09,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:09,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 969 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:09,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:09,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:09,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:10,058 INFO L124 PetriNetUnfolderBase]: 1397/2584 cut-off events. [2024-02-02 16:16:10,058 INFO L125 PetriNetUnfolderBase]: For 4654/4707 co-relation queries the response was YES. [2024-02-02 16:16:10,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 2584 events. 1397/2584 cut-off events. For 4654/4707 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14866 event pairs, 492 based on Foata normal form. 19/2283 useless extension candidates. Maximal degree in co-relation 7646. Up to 1787 conditions per place. [2024-02-02 16:16:10,075 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 99 selfloop transitions, 37 changer transitions 0/151 dead transitions. [2024-02-02 16:16:10,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 1363 flow [2024-02-02 16:16:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-02-02 16:16:10,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32882882882882886 [2024-02-02 16:16:10,077 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 969 flow. Second operand 8 states and 292 transitions. [2024-02-02 16:16:10,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 1363 flow [2024-02-02 16:16:10,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 1317 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:10,088 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 1046 flow [2024-02-02 16:16:10,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1046, PETRI_PLACES=150, PETRI_TRANSITIONS=129} [2024-02-02 16:16:10,088 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2024-02-02 16:16:10,089 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 1046 flow [2024-02-02 16:16:10,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:10,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:10,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-02 16:16:10,089 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:10,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash 357732288, now seen corresponding path program 3 times [2024-02-02 16:16:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145431174] [2024-02-02 16:16:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145431174] [2024-02-02 16:16:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145431174] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613465686] [2024-02-02 16:16:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:10,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:10,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:10,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 129 transitions, 1046 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:10,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:10,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:10,829 INFO L124 PetriNetUnfolderBase]: 1394/2579 cut-off events. [2024-02-02 16:16:10,830 INFO L125 PetriNetUnfolderBase]: For 4982/5035 co-relation queries the response was YES. [2024-02-02 16:16:10,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7740 conditions, 2579 events. 1394/2579 cut-off events. For 4982/5035 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14889 event pairs, 492 based on Foata normal form. 19/2278 useless extension candidates. Maximal degree in co-relation 7688. Up to 1787 conditions per place. [2024-02-02 16:16:10,848 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2024-02-02 16:16:10,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1426 flow [2024-02-02 16:16:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 295 transitions. [2024-02-02 16:16:10,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3322072072072072 [2024-02-02 16:16:10,852 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 1046 flow. Second operand 8 states and 295 transitions. [2024-02-02 16:16:10,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1426 flow [2024-02-02 16:16:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 1369 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-02 16:16:10,867 INFO L231 Difference]: Finished difference. Result has 154 places, 129 transitions, 1072 flow [2024-02-02 16:16:10,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=154, PETRI_TRANSITIONS=129} [2024-02-02 16:16:10,868 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 39 predicate places. [2024-02-02 16:16:10,868 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 129 transitions, 1072 flow [2024-02-02 16:16:10,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:10,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:10,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:10,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-02 16:16:10,868 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:10,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1733934478, now seen corresponding path program 4 times [2024-02-02 16:16:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675039102] [2024-02-02 16:16:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675039102] [2024-02-02 16:16:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675039102] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999372241] [2024-02-02 16:16:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:11,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:11,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 129 transitions, 1072 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:11,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:11,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:11,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:11,616 INFO L124 PetriNetUnfolderBase]: 1411/2599 cut-off events. [2024-02-02 16:16:11,617 INFO L125 PetriNetUnfolderBase]: For 5394/5447 co-relation queries the response was YES. [2024-02-02 16:16:11,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 2599 events. 1411/2599 cut-off events. For 5394/5447 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15062 event pairs, 495 based on Foata normal form. 19/2295 useless extension candidates. Maximal degree in co-relation 7781. Up to 1791 conditions per place. [2024-02-02 16:16:11,634 INFO L140 encePairwiseOnDemand]: 98/111 looper letters, 101 selfloop transitions, 39 changer transitions 0/155 dead transitions. [2024-02-02 16:16:11,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 1478 flow [2024-02-02 16:16:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-02-02 16:16:11,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-02-02 16:16:11,636 INFO L175 Difference]: Start difference. First operand has 154 places, 129 transitions, 1072 flow. Second operand 8 states and 294 transitions. [2024-02-02 16:16:11,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 1478 flow [2024-02-02 16:16:11,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 1401 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-02-02 16:16:11,651 INFO L231 Difference]: Finished difference. Result has 159 places, 135 transitions, 1149 flow [2024-02-02 16:16:11,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1149, PETRI_PLACES=159, PETRI_TRANSITIONS=135} [2024-02-02 16:16:11,651 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2024-02-02 16:16:11,652 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 1149 flow [2024-02-02 16:16:11,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:11,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:11,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:11,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-02 16:16:11,652 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:11,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -949804910, now seen corresponding path program 1 times [2024-02-02 16:16:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322471377] [2024-02-02 16:16:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:12,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:12,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322471377] [2024-02-02 16:16:12,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322471377] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:12,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:12,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108475765] [2024-02-02 16:16:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:12,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:12,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:12,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 135 transitions, 1149 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:12,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:12,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:12,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:12,710 INFO L124 PetriNetUnfolderBase]: 1474/2701 cut-off events. [2024-02-02 16:16:12,711 INFO L125 PetriNetUnfolderBase]: For 5781/5860 co-relation queries the response was YES. [2024-02-02 16:16:12,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 2701 events. 1474/2701 cut-off events. For 5781/5860 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15996 event pairs, 689 based on Foata normal form. 26/2330 useless extension candidates. Maximal degree in co-relation 8146. Up to 1854 conditions per place. [2024-02-02 16:16:12,728 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 123 selfloop transitions, 31 changer transitions 0/173 dead transitions. [2024-02-02 16:16:12,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 1612 flow [2024-02-02 16:16:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 16:16:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 16:16:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2024-02-02 16:16:12,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552123552123552 [2024-02-02 16:16:12,733 INFO L175 Difference]: Start difference. First operand has 159 places, 135 transitions, 1149 flow. Second operand 7 states and 276 transitions. [2024-02-02 16:16:12,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 1612 flow [2024-02-02 16:16:12,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 173 transitions, 1569 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:12,775 INFO L231 Difference]: Finished difference. Result has 164 places, 141 transitions, 1220 flow [2024-02-02 16:16:12,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1220, PETRI_PLACES=164, PETRI_TRANSITIONS=141} [2024-02-02 16:16:12,776 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 49 predicate places. [2024-02-02 16:16:12,776 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 141 transitions, 1220 flow [2024-02-02 16:16:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:12,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:12,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:12,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-02 16:16:12,777 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:12,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash -210045352, now seen corresponding path program 2 times [2024-02-02 16:16:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39305560] [2024-02-02 16:16:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39305560] [2024-02-02 16:16:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39305560] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:13,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409797695] [2024-02-02 16:16:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:13,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:13,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:13,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 141 transitions, 1220 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:13,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:13,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:13,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:13,480 INFO L124 PetriNetUnfolderBase]: 1485/2724 cut-off events. [2024-02-02 16:16:13,480 INFO L125 PetriNetUnfolderBase]: For 6167/6239 co-relation queries the response was YES. [2024-02-02 16:16:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 2724 events. 1485/2724 cut-off events. For 6167/6239 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16087 event pairs, 698 based on Foata normal form. 28/2368 useless extension candidates. Maximal degree in co-relation 8421. Up to 1856 conditions per place. [2024-02-02 16:16:13,494 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 119 selfloop transitions, 32 changer transitions 0/170 dead transitions. [2024-02-02 16:16:13,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 1654 flow [2024-02-02 16:16:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 16:16:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 16:16:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 267 transitions. [2024-02-02 16:16:13,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3436293436293436 [2024-02-02 16:16:13,495 INFO L175 Difference]: Start difference. First operand has 164 places, 141 transitions, 1220 flow. Second operand 7 states and 267 transitions. [2024-02-02 16:16:13,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 1654 flow [2024-02-02 16:16:13,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 1615 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:13,508 INFO L231 Difference]: Finished difference. Result has 169 places, 145 transitions, 1291 flow [2024-02-02 16:16:13,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1291, PETRI_PLACES=169, PETRI_TRANSITIONS=145} [2024-02-02 16:16:13,508 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 54 predicate places. [2024-02-02 16:16:13,509 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 145 transitions, 1291 flow [2024-02-02 16:16:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:13,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:13,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:13,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-02 16:16:13,509 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:13,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -208316482, now seen corresponding path program 3 times [2024-02-02 16:16:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924102950] [2024-02-02 16:16:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924102950] [2024-02-02 16:16:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924102950] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256110] [2024-02-02 16:16:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:13,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:13,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:13,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 145 transitions, 1291 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:13,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:13,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:13,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:14,248 INFO L124 PetriNetUnfolderBase]: 1482/2719 cut-off events. [2024-02-02 16:16:14,249 INFO L125 PetriNetUnfolderBase]: For 6523/6595 co-relation queries the response was YES. [2024-02-02 16:16:14,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8702 conditions, 2719 events. 1482/2719 cut-off events. For 6523/6595 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16109 event pairs, 700 based on Foata normal form. 22/2357 useless extension candidates. Maximal degree in co-relation 8534. Up to 1856 conditions per place. [2024-02-02 16:16:14,268 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 117 selfloop transitions, 33 changer transitions 0/169 dead transitions. [2024-02-02 16:16:14,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 169 transitions, 1679 flow [2024-02-02 16:16:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 16:16:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 16:16:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2024-02-02 16:16:14,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3410553410553411 [2024-02-02 16:16:14,270 INFO L175 Difference]: Start difference. First operand has 169 places, 145 transitions, 1291 flow. Second operand 7 states and 265 transitions. [2024-02-02 16:16:14,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 169 transitions, 1679 flow [2024-02-02 16:16:14,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 1628 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:14,284 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 1311 flow [2024-02-02 16:16:14,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1311, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2024-02-02 16:16:14,285 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 58 predicate places. [2024-02-02 16:16:14,285 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 1311 flow [2024-02-02 16:16:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:14,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:14,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:14,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-02 16:16:14,286 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:14,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash 17444766, now seen corresponding path program 1 times [2024-02-02 16:16:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878021327] [2024-02-02 16:16:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878021327] [2024-02-02 16:16:14,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878021327] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:14,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 16:16:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733649782] [2024-02-02 16:16:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:14,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-02 16:16:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-02 16:16:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-02 16:16:14,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-02 16:16:14,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:14,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:14,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-02 16:16:14,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:14,974 INFO L124 PetriNetUnfolderBase]: 1453/2690 cut-off events. [2024-02-02 16:16:14,974 INFO L125 PetriNetUnfolderBase]: For 6640/6717 co-relation queries the response was YES. [2024-02-02 16:16:14,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8560 conditions, 2690 events. 1453/2690 cut-off events. For 6640/6717 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15604 event pairs, 623 based on Foata normal form. 29/2391 useless extension candidates. Maximal degree in co-relation 8498. Up to 1861 conditions per place. [2024-02-02 16:16:14,991 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 129 selfloop transitions, 33 changer transitions 0/180 dead transitions. [2024-02-02 16:16:14,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 180 transitions, 1757 flow [2024-02-02 16:16:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 16:16:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 16:16:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2024-02-02 16:16:14,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367117117117117 [2024-02-02 16:16:14,993 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 1311 flow. Second operand 8 states and 299 transitions. [2024-02-02 16:16:14,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 180 transitions, 1757 flow [2024-02-02 16:16:15,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 180 transitions, 1685 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-02-02 16:16:15,005 INFO L231 Difference]: Finished difference. Result has 175 places, 145 transitions, 1312 flow [2024-02-02 16:16:15,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1312, PETRI_PLACES=175, PETRI_TRANSITIONS=145} [2024-02-02 16:16:15,012 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 60 predicate places. [2024-02-02 16:16:15,012 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 1312 flow [2024-02-02 16:16:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 16:16:15,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:15,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-02 16:16:15,013 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-02 16:16:15,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -418825243, now seen corresponding path program 1 times [2024-02-02 16:16:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032693364] [2024-02-02 16:16:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 16:16:15,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 16:16:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 16:16:15,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 16:16:15,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 16:16:15,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 116 remaining) [2024-02-02 16:16:15,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 116 remaining) [2024-02-02 16:16:15,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 116 remaining) [2024-02-02 16:16:15,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 116 remaining) [2024-02-02 16:16:15,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 116 remaining) [2024-02-02 16:16:15,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 116 remaining) [2024-02-02 16:16:15,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 116 remaining) [2024-02-02 16:16:15,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 116 remaining) [2024-02-02 16:16:15,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 116 remaining) [2024-02-02 16:16:15,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 116 remaining) [2024-02-02 16:16:15,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 116 remaining) [2024-02-02 16:16:15,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 116 remaining) [2024-02-02 16:16:15,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 116 remaining) [2024-02-02 16:16:15,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 116 remaining) [2024-02-02 16:16:15,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 116 remaining) [2024-02-02 16:16:15,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 116 remaining) [2024-02-02 16:16:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 116 remaining) [2024-02-02 16:16:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 116 remaining) [2024-02-02 16:16:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 116 remaining) [2024-02-02 16:16:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 116 remaining) [2024-02-02 16:16:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 116 remaining) [2024-02-02 16:16:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 116 remaining) [2024-02-02 16:16:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (57 of 116 remaining) [2024-02-02 16:16:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 116 remaining) [2024-02-02 16:16:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 116 remaining) [2024-02-02 16:16:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 116 remaining) [2024-02-02 16:16:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 116 remaining) [2024-02-02 16:16:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 116 remaining) [2024-02-02 16:16:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 116 remaining) [2024-02-02 16:16:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 116 remaining) [2024-02-02 16:16:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 116 remaining) [2024-02-02 16:16:15,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 116 remaining) [2024-02-02 16:16:15,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 116 remaining) [2024-02-02 16:16:15,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 116 remaining) [2024-02-02 16:16:15,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 116 remaining) [2024-02-02 16:16:15,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-02 16:16:15,167 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:15,174 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 16:16:15,174 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 16:16:15,218 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-02-02 16:16:15,218 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-02-02 16:16:15,220 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 04:16:15 BasicIcfg [2024-02-02 16:16:15,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 16:16:15,220 INFO L158 Benchmark]: Toolchain (without parser) took 23975.23ms. Allocated memory was 159.4MB in the beginning and 922.7MB in the end (delta: 763.4MB). Free memory was 118.1MB in the beginning and 717.7MB in the end (delta: -599.6MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,221 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 16:16:15,221 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 16:16:15,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.03ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 86.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.23ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 83.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,222 INFO L158 Benchmark]: Boogie Preprocessor took 76.23ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,222 INFO L158 Benchmark]: RCFGBuilder took 1015.06ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 121.3MB in the end (delta: -41.0MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,222 INFO L158 Benchmark]: TraceAbstraction took 22404.21ms. Allocated memory was 159.4MB in the beginning and 922.7MB in the end (delta: 763.4MB). Free memory was 120.3MB in the beginning and 717.7MB in the end (delta: -597.4MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. [2024-02-02 16:16:15,223 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.03ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 86.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.23ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 83.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.23ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1015.06ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 121.3MB in the end (delta: -41.0MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22404.21ms. Allocated memory was 159.4MB in the beginning and 922.7MB in the end (delta: 763.4MB). Free memory was 120.3MB in the beginning and 717.7MB in the end (delta: -597.4MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 59]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, tmp1, tmp2, i, i1, i2; [L107] 0 pthread_t t1, t2; VAL [e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[tmp1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[tmp2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] [L110] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L44] 1 e1 = 1 [L45] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L46] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L47] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L47] 1 tmp1 = n2 [L48] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L49] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L50] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L50] 1 n1 = tmp1 + 1 [L51] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[n1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L52] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L53] 1 e1 = 0 [L54] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L55] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L57] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L58] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L59] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[n2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 45]: 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: 47]: 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: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: 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: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: 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: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: 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: 71]: 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: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 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: 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: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: 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 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: 116]: 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: 111]: 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: 110]: 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, 212 locations, 116 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.2s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2636 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2121 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 913 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6089 IncrementalHoareTripleChecker+Invalid, 6715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 316 mSDtfsCounter, 6089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1312occurred in iteration=27, InterpolantAutomatonStates: 171, 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.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 8922 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-02-02 16:16:15,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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