./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.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/test-easy6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b 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.2024-01-24_13-31-21.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-dev-d8006e4-m [2024-02-05 10:36:34,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:36:34,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:36:34,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:36:34,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:36:34,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:36:34,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:36:34,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:36:34,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:36:34,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:36:34,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:36:34,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:36:34,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:36:34,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:36:34,190 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:36:34,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:36:34,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:36:34,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:36:34,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:36:34,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:36:34,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:36:34,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:36:34,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:36:34,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:36:34,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:36:34,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:36:34,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:36:34,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:36:34,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:36:34,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:36:34,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:36:34,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:36:34,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:36:34,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:36:34,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:36:34,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:36:34,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:36:34,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:36:34,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:36:34,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:36:34,196 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:36:34,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:36:34,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:36:34,197 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-05 10:36:34,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:36:34,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:36:34,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:36:34,502 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:36:34,503 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:36:34,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/test-easy6.wvr.yml/witness.yml [2024-02-05 10:36:34,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:36:34,699 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:36:34,700 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-05 10:36:35,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:36:36,004 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:36:36,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-02-05 10:36:36,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc5b6cb7/8a8ec8cf5dd04c6ca9ae83feef363070/FLAGb635ac489 [2024-02-05 10:36:36,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc5b6cb7/8a8ec8cf5dd04c6ca9ae83feef363070 [2024-02-05 10:36:36,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:36:36,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:36:36,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:36:36,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:36:36,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:36:36,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:36:34" (1/2) ... [2024-02-05 10:36:36,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c64cdf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:36:36, skipping insertion in model container [2024-02-05 10:36:36,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:36:34" (1/2) ... [2024-02-05 10:36:36,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64e56b50 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:36:36, skipping insertion in model container [2024-02-05 10:36:36,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:36:36" (2/2) ... [2024-02-05 10:36:36,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c64cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36, skipping insertion in model container [2024-02-05 10:36:36,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:36:36" (2/2) ... [2024-02-05 10:36:36,037 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:36:36,131 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:36:36,133 INFO L101 nessWitnessExtractor]: Location invariant before [L93-L93] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,133 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,133 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,133 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,133 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-05 10:36:36,133 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-05 10:36:36,133 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-05 10:36:36,133 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-05 10:36:36,134 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,134 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-05 10:36:36,134 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-05 10:36:36,134 INFO L101 nessWitnessExtractor]: Location invariant before [L81-L81] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,134 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-05 10:36:36,134 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,134 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-05 10:36:36,135 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-05 10:36:36,135 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,135 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-05 10:36:36,135 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-05 10:36:36,135 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,135 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-05 10:36:36,136 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,136 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-05 10:36:36,136 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-05 10:36:36,136 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,136 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-05 10:36:36,136 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-05 10:36:36,137 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-05 10:36:36,137 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-05 10:36:36,137 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-05 10:36:36,137 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-05 10:36:36,137 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-05 10:36:36,137 INFO L101 nessWitnessExtractor]: Location invariant before [L99-L99] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,137 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-05 10:36:36,138 INFO L101 nessWitnessExtractor]: Location invariant before [L84-L84] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,138 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-05 10:36:36,138 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-05 10:36:36,138 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,139 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-05 10:36:36,140 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-05 10:36:36,140 INFO L101 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,140 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-05 10:36:36,140 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-05 10:36:36,140 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-05 10:36:36,140 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-05 10:36:36,140 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-05 10:36:36,141 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-05 10:36:36,141 INFO L101 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,141 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,141 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-05 10:36:36,141 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-05 10:36:36,141 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-05 10:36:36,142 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,142 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-05 10:36:36,142 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,143 INFO L101 nessWitnessExtractor]: Location invariant before [L103-L103] (unsigned long )_argptr == 0UL [2024-02-05 10:36:36,143 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-05 10:36:36,165 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:36:36,346 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-05 10:36:36,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:36:36,359 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-05 10:36:36,489 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-05 10:36:36,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:36:36,517 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:36:36,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36 WrapperNode [2024-02-05 10:36:36,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:36:36,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:36:36,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:36:36,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:36:36,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,601 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-02-05 10:36:36,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:36:36,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:36:36,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:36:36,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:36:36,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,630 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-05 10:36:36,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:36:36,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:36:36,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:36:36,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:36:36,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (1/1) ... [2024-02-05 10:36:36,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:36:36,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:36:36,685 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-05 10:36:36,712 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-05 10:36:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:36:36,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:36:36,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:36:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:36:36,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:36:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:36:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:36:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:36:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:36:36,744 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:36:36,850 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:36:36,852 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:36:37,450 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:36:37,451 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:36:37,652 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:36:37,653 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-05 10:36:37,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:36:37 BoogieIcfgContainer [2024-02-05 10:36:37,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:36:37,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:36:37,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:36:37,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:36:37,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:36:34" (1/4) ... [2024-02-05 10:36:37,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c40920e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:36:37, skipping insertion in model container [2024-02-05 10:36:37,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:36:36" (2/4) ... [2024-02-05 10:36:37,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c40920e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:36:37, skipping insertion in model container [2024-02-05 10:36:37,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:36:36" (3/4) ... [2024-02-05 10:36:37,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c40920e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:36:37, skipping insertion in model container [2024-02-05 10:36:37,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:36:37" (4/4) ... [2024-02-05 10:36:37,659 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2024-02-05 10:36:37,677 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:36:37,677 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-02-05 10:36:37,677 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:36:37,763 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:36:37,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 236 flow [2024-02-05 10:36:37,825 INFO L124 PetriNetUnfolderBase]: 0/109 cut-off events. [2024-02-05 10:36:37,826 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:36:37,827 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-05 10:36:37,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 236 flow [2024-02-05 10:36:37,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 228 flow [2024-02-05 10:36:37,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:36:37,845 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;@7f264acc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:36:37,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 116 error locations. [2024-02-05 10:36:37,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:36:37,848 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:36:37,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:36:37,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:37,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:36:37,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:37,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 16279, now seen corresponding path program 1 times [2024-02-05 10:36:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:37,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307138447] [2024-02-05 10:36:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:38,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:38,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307138447] [2024-02-05 10:36:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307138447] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:38,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:36:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361275665] [2024-02-05 10:36:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:36:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:36:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:36:38,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 111 [2024-02-05 10:36:38,157 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-05 10:36:38,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:38,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 111 [2024-02-05 10:36:38,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:38,664 INFO L124 PetriNetUnfolderBase]: 1197/2839 cut-off events. [2024-02-05 10:36:38,664 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:36:38,673 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-05 10:36:38,690 INFO L140 encePairwiseOnDemand]: 89/111 looper letters, 52 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-02-05 10:36:38,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 317 flow [2024-02-05 10:36:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:36:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:36:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-02-05 10:36:38,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156156156156156 [2024-02-05 10:36:38,733 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 228 flow. Second operand 3 states and 205 transitions. [2024-02-05 10:36:38,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 317 flow [2024-02-05 10:36:38,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 307 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:38,741 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 199 flow [2024-02-05 10:36:38,743 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-05 10:36:38,745 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -20 predicate places. [2024-02-05 10:36:38,746 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 199 flow [2024-02-05 10:36:38,746 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-05 10:36:38,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:38,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:36:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:36:38,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:38,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 485639763, now seen corresponding path program 1 times [2024-02-05 10:36:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052875254] [2024-02-05 10:36:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:38,860 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-05 10:36:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:38,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052875254] [2024-02-05 10:36:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052875254] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:38,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:38,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:36:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774475387] [2024-02-05 10:36:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:38,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:36:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:36:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:36:38,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-02-05 10:36:38,888 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-05 10:36:38,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:38,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-02-05 10:36:38,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:39,225 INFO L124 PetriNetUnfolderBase]: 1257/2886 cut-off events. [2024-02-05 10:36:39,226 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-02-05 10:36:39,229 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-05 10:36:39,238 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 71 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2024-02-05 10:36:39,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 373 flow [2024-02-05 10:36:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:36:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:36:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2024-02-05 10:36:39,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-02-05 10:36:39,241 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 199 flow. Second operand 4 states and 213 transitions. [2024-02-05 10:36:39,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 373 flow [2024-02-05 10:36:39,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:36:39,243 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 180 flow [2024-02-05 10:36:39,244 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-05 10:36:39,244 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-02-05 10:36:39,245 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 180 flow [2024-02-05 10:36:39,245 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-05 10:36:39,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:39,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-05 10:36:39,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:36:39,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:39,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2125035946, now seen corresponding path program 1 times [2024-02-05 10:36:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139924173] [2024-02-05 10:36:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139924173] [2024-02-05 10:36:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139924173] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:36:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072675495] [2024-02-05 10:36:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:39,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:36:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:39,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:36:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:36:39,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:39,491 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-05 10:36:39,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:39,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:39,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:39,915 INFO L124 PetriNetUnfolderBase]: 1789/3696 cut-off events. [2024-02-05 10:36:39,915 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2024-02-05 10:36:39,920 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-05 10:36:39,933 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-02-05 10:36:39,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 111 transitions, 433 flow [2024-02-05 10:36:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:36:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:36:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-02-05 10:36:39,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3801801801801802 [2024-02-05 10:36:39,936 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 180 flow. Second operand 5 states and 211 transitions. [2024-02-05 10:36:39,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 111 transitions, 433 flow [2024-02-05 10:36:39,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:39,940 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 220 flow [2024-02-05 10:36:39,940 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-05 10:36:39,941 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -23 predicate places. [2024-02-05 10:36:39,941 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 220 flow [2024-02-05 10:36:39,942 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-05 10:36:39,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:39,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:39,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:36:39,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:39,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1453984249, now seen corresponding path program 1 times [2024-02-05 10:36:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399923991] [2024-02-05 10:36:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:40,022 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-05 10:36:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399923991] [2024-02-05 10:36:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399923991] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:36:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685560731] [2024-02-05 10:36:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:36:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:36:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:36:40,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-02-05 10:36:40,081 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-05 10:36:40,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:40,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-02-05 10:36:40,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:40,358 INFO L124 PetriNetUnfolderBase]: 1266/2607 cut-off events. [2024-02-05 10:36:40,359 INFO L125 PetriNetUnfolderBase]: For 276/281 co-relation queries the response was YES. [2024-02-05 10:36:40,362 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-05 10:36:40,371 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 91 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-02-05 10:36:40,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 114 transitions, 483 flow [2024-02-05 10:36:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:36:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:36:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-02-05 10:36:40,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-02-05 10:36:40,372 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 220 flow. Second operand 4 states and 230 transitions. [2024-02-05 10:36:40,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 114 transitions, 483 flow [2024-02-05 10:36:40,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:40,375 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 197 flow [2024-02-05 10:36:40,375 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-05 10:36:40,375 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -32 predicate places. [2024-02-05 10:36:40,376 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 197 flow [2024-02-05 10:36:40,376 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-05 10:36:40,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:40,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:40,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:36:40,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:40,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2123838126, now seen corresponding path program 1 times [2024-02-05 10:36:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027150177] [2024-02-05 10:36:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027150177] [2024-02-05 10:36:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027150177] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:36:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049146242] [2024-02-05 10:36:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-05 10:36:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-05 10:36:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-05 10:36:40,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:40,565 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-05 10:36:40,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:40,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:40,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:40,852 INFO L124 PetriNetUnfolderBase]: 1808/3299 cut-off events. [2024-02-05 10:36:40,853 INFO L125 PetriNetUnfolderBase]: For 301/306 co-relation queries the response was YES. [2024-02-05 10:36:40,857 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-05 10:36:40,867 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 79 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2024-02-05 10:36:40,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 440 flow [2024-02-05 10:36:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:36:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:36:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-02-05 10:36:40,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2024-02-05 10:36:40,868 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 197 flow. Second operand 5 states and 207 transitions. [2024-02-05 10:36:40,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 99 transitions, 440 flow [2024-02-05 10:36:40,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 99 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:40,871 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 230 flow [2024-02-05 10:36:40,871 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-05 10:36:40,871 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-02-05 10:36:40,872 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 230 flow [2024-02-05 10:36:40,872 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-05 10:36:40,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:40,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:40,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:36:40,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:40,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2050058727, now seen corresponding path program 1 times [2024-02-05 10:36:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966331179] [2024-02-05 10:36:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:41,065 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-05 10:36:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966331179] [2024-02-05 10:36:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966331179] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221886508] [2024-02-05 10:36:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:41,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:41,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:41,126 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-05 10:36:41,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:41,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:41,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:41,428 INFO L124 PetriNetUnfolderBase]: 1766/3209 cut-off events. [2024-02-05 10:36:41,428 INFO L125 PetriNetUnfolderBase]: For 409/425 co-relation queries the response was YES. [2024-02-05 10:36:41,433 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-05 10:36:41,473 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2024-02-05 10:36:41,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 106 transitions, 495 flow [2024-02-05 10:36:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-02-05 10:36:41,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-02-05 10:36:41,475 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 230 flow. Second operand 6 states and 239 transitions. [2024-02-05 10:36:41,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 106 transitions, 495 flow [2024-02-05 10:36:41,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:41,477 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 259 flow [2024-02-05 10:36:41,478 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-05 10:36:41,478 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -24 predicate places. [2024-02-05 10:36:41,478 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 259 flow [2024-02-05 10:36:41,478 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-05 10:36:41,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:41,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:41,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:36:41,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:41,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash -898952171, now seen corresponding path program 1 times [2024-02-05 10:36:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740514455] [2024-02-05 10:36:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:41,655 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-05 10:36:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740514455] [2024-02-05 10:36:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740514455] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914918405] [2024-02-05 10:36:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:41,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:41,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:41,702 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-05 10:36:41,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:41,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:41,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:42,142 INFO L124 PetriNetUnfolderBase]: 1766/3153 cut-off events. [2024-02-05 10:36:42,143 INFO L125 PetriNetUnfolderBase]: For 565/570 co-relation queries the response was YES. [2024-02-05 10:36:42,147 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-05 10:36:42,155 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 82 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2024-02-05 10:36:42,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 517 flow [2024-02-05 10:36:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-02-05 10:36:42,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-02-05 10:36:42,156 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 259 flow. Second operand 6 states and 237 transitions. [2024-02-05 10:36:42,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 517 flow [2024-02-05 10:36:42,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 495 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:42,159 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 279 flow [2024-02-05 10:36:42,160 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-05 10:36:42,161 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -22 predicate places. [2024-02-05 10:36:42,161 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 279 flow [2024-02-05 10:36:42,161 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-05 10:36:42,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:42,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:42,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:36:42,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:42,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2145456550, now seen corresponding path program 1 times [2024-02-05 10:36:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605339686] [2024-02-05 10:36:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:42,409 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-05 10:36:42,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605339686] [2024-02-05 10:36:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605339686] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456349444] [2024-02-05 10:36:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:42,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:42,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:42,449 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-05 10:36:42,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:42,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:42,846 INFO L124 PetriNetUnfolderBase]: 1772/3227 cut-off events. [2024-02-05 10:36:42,846 INFO L125 PetriNetUnfolderBase]: For 765/770 co-relation queries the response was YES. [2024-02-05 10:36:42,851 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-05 10:36:42,858 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 81 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-02-05 10:36:42,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 543 flow [2024-02-05 10:36:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-02-05 10:36:42,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2024-02-05 10:36:42,861 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 279 flow. Second operand 6 states and 236 transitions. [2024-02-05 10:36:42,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 543 flow [2024-02-05 10:36:42,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 106 transitions, 528 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:42,864 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 318 flow [2024-02-05 10:36:42,865 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-05 10:36:42,867 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -18 predicate places. [2024-02-05 10:36:42,867 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 318 flow [2024-02-05 10:36:42,867 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-05 10:36:42,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:42,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:42,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:36:42,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:42,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2099344360, now seen corresponding path program 2 times [2024-02-05 10:36:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956015096] [2024-02-05 10:36:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:43,077 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-05 10:36:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956015096] [2024-02-05 10:36:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956015096] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636823949] [2024-02-05 10:36:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:43,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:43,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:43,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:43,137 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-05 10:36:43,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:43,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:43,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:43,524 INFO L124 PetriNetUnfolderBase]: 1766/3207 cut-off events. [2024-02-05 10:36:43,524 INFO L125 PetriNetUnfolderBase]: For 1024/1029 co-relation queries the response was YES. [2024-02-05 10:36:43,529 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-05 10:36:43,536 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 78 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-02-05 10:36:43,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 561 flow [2024-02-05 10:36:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-02-05 10:36:43,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34984984984984985 [2024-02-05 10:36:43,538 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 318 flow. Second operand 6 states and 233 transitions. [2024-02-05 10:36:43,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 561 flow [2024-02-05 10:36:43,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 533 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:43,540 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 332 flow [2024-02-05 10:36:43,540 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-05 10:36:43,541 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -16 predicate places. [2024-02-05 10:36:43,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 332 flow [2024-02-05 10:36:43,541 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-05 10:36:43,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:43,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:36:43,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:43,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2099342920, now seen corresponding path program 1 times [2024-02-05 10:36:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242595837] [2024-02-05 10:36:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:43,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:43,758 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-05 10:36:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242595837] [2024-02-05 10:36:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242595837] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350344732] [2024-02-05 10:36:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:43,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:43,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:43,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:43,826 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-05 10:36:43,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:43,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:43,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:44,171 INFO L124 PetriNetUnfolderBase]: 1770/3339 cut-off events. [2024-02-05 10:36:44,171 INFO L125 PetriNetUnfolderBase]: For 1090/1110 co-relation queries the response was YES. [2024-02-05 10:36:44,177 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-05 10:36:44,187 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2024-02-05 10:36:44,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 615 flow [2024-02-05 10:36:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-02-05 10:36:44,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-02-05 10:36:44,189 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 332 flow. Second operand 6 states and 237 transitions. [2024-02-05 10:36:44,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 615 flow [2024-02-05 10:36:44,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 590 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:44,193 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 375 flow [2024-02-05 10:36:44,194 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-05 10:36:44,195 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -12 predicate places. [2024-02-05 10:36:44,195 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 375 flow [2024-02-05 10:36:44,195 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-05 10:36:44,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:44,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:44,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:36:44,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:44,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -885335720, now seen corresponding path program 2 times [2024-02-05 10:36:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976607704] [2024-02-05 10:36:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:44,401 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-05 10:36:44,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976607704] [2024-02-05 10:36:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976607704] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321303763] [2024-02-05 10:36:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:44,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:44,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:44,451 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-05 10:36:44,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:44,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:44,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:44,851 INFO L124 PetriNetUnfolderBase]: 1764/3333 cut-off events. [2024-02-05 10:36:44,851 INFO L125 PetriNetUnfolderBase]: For 1272/1286 co-relation queries the response was YES. [2024-02-05 10:36:44,857 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-05 10:36:44,865 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 80 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2024-02-05 10:36:44,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 619 flow [2024-02-05 10:36:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-02-05 10:36:44,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-02-05 10:36:44,866 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 375 flow. Second operand 6 states and 234 transitions. [2024-02-05 10:36:44,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 619 flow [2024-02-05 10:36:44,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 599 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:44,870 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 392 flow [2024-02-05 10:36:44,870 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-05 10:36:44,871 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-02-05 10:36:44,871 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 392 flow [2024-02-05 10:36:44,871 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-05 10:36:44,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:44,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-05 10:36:44,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:44,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 857248063, now seen corresponding path program 1 times [2024-02-05 10:36:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:44,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849216470] [2024-02-05 10:36:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:45,147 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-05 10:36:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849216470] [2024-02-05 10:36:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849216470] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974800077] [2024-02-05 10:36:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:45,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:45,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:45,213 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-05 10:36:45,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:45,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:45,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:45,662 INFO L124 PetriNetUnfolderBase]: 1596/3003 cut-off events. [2024-02-05 10:36:45,662 INFO L125 PetriNetUnfolderBase]: For 1180/1204 co-relation queries the response was YES. [2024-02-05 10:36:45,668 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-05 10:36:45,676 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 105 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-02-05 10:36:45,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 799 flow [2024-02-05 10:36:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 305 transitions. [2024-02-05 10:36:45,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34346846846846846 [2024-02-05 10:36:45,678 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 392 flow. Second operand 8 states and 305 transitions. [2024-02-05 10:36:45,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 799 flow [2024-02-05 10:36:45,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 138 transitions, 747 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-02-05 10:36:45,681 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 458 flow [2024-02-05 10:36:45,682 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-05 10:36:45,682 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-02-05 10:36:45,683 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 458 flow [2024-02-05 10:36:45,683 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-05 10:36:45,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:45,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:45,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-05 10:36:45,683 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:45,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 391042397, now seen corresponding path program 1 times [2024-02-05 10:36:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892293541] [2024-02-05 10:36:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892293541] [2024-02-05 10:36:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892293541] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61732252] [2024-02-05 10:36:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:45,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:45,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:45,915 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-05 10:36:45,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:45,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:45,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:46,361 INFO L124 PetriNetUnfolderBase]: 1644/3073 cut-off events. [2024-02-05 10:36:46,362 INFO L125 PetriNetUnfolderBase]: For 1616/1649 co-relation queries the response was YES. [2024-02-05 10:36:46,369 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-05 10:36:46,378 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 91 selfloop transitions, 21 changer transitions 0/125 dead transitions. [2024-02-05 10:36:46,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 125 transitions, 778 flow [2024-02-05 10:36:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-02-05 10:36:46,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633633633633634 [2024-02-05 10:36:46,380 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 458 flow. Second operand 6 states and 242 transitions. [2024-02-05 10:36:46,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 125 transitions, 778 flow [2024-02-05 10:36:46,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 762 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:46,385 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 508 flow [2024-02-05 10:36:46,385 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-05 10:36:46,386 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2024-02-05 10:36:46,386 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 508 flow [2024-02-05 10:36:46,386 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-05 10:36:46,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:46,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:46,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-05 10:36:46,386 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:46,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1821133157, now seen corresponding path program 1 times [2024-02-05 10:36:46,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:46,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810217684] [2024-02-05 10:36:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810217684] [2024-02-05 10:36:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810217684] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630856257] [2024-02-05 10:36:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:46,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:46,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:46,661 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-05 10:36:46,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:46,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:46,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:47,130 INFO L124 PetriNetUnfolderBase]: 1648/2963 cut-off events. [2024-02-05 10:36:47,130 INFO L125 PetriNetUnfolderBase]: For 2251/2260 co-relation queries the response was YES. [2024-02-05 10:36:47,138 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-05 10:36:47,147 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 95 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-02-05 10:36:47,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 873 flow [2024-02-05 10:36:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-02-05 10:36:47,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738738738738739 [2024-02-05 10:36:47,149 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 508 flow. Second operand 6 states and 249 transitions. [2024-02-05 10:36:47,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 873 flow [2024-02-05 10:36:47,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 835 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:47,153 INFO L231 Difference]: Finished difference. Result has 119 places, 103 transitions, 572 flow [2024-02-05 10:36:47,154 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-05 10:36:47,154 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2024-02-05 10:36:47,154 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 103 transitions, 572 flow [2024-02-05 10:36:47,154 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-05 10:36:47,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:47,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:47,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-05 10:36:47,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:47,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1451474299, now seen corresponding path program 2 times [2024-02-05 10:36:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282336202] [2024-02-05 10:36:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:47,357 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-05 10:36:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282336202] [2024-02-05 10:36:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282336202] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203885290] [2024-02-05 10:36:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:47,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:47,408 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-05 10:36:47,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:47,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:47,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:47,823 INFO L124 PetriNetUnfolderBase]: 1981/3604 cut-off events. [2024-02-05 10:36:47,823 INFO L125 PetriNetUnfolderBase]: For 3424/3489 co-relation queries the response was YES. [2024-02-05 10:36:47,834 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-05 10:36:47,846 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 96 selfloop transitions, 25 changer transitions 0/136 dead transitions. [2024-02-05 10:36:47,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 956 flow [2024-02-05 10:36:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-02-05 10:36:47,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663663663663664 [2024-02-05 10:36:47,847 INFO L175 Difference]: Start difference. First operand has 119 places, 103 transitions, 572 flow. Second operand 6 states and 244 transitions. [2024-02-05 10:36:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 956 flow [2024-02-05 10:36:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 906 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:47,854 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 611 flow [2024-02-05 10:36:47,854 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-05 10:36:47,855 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2024-02-05 10:36:47,855 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 611 flow [2024-02-05 10:36:47,856 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-05 10:36:47,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:47,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:47,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-05 10:36:47,856 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:47,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -449614727, now seen corresponding path program 2 times [2024-02-05 10:36:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:47,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409785347] [2024-02-05 10:36:47,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:48,068 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-05 10:36:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409785347] [2024-02-05 10:36:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409785347] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458893177] [2024-02-05 10:36:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:48,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:48,133 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-05 10:36:48,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:48,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:48,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:48,492 INFO L124 PetriNetUnfolderBase]: 1642/2957 cut-off events. [2024-02-05 10:36:48,492 INFO L125 PetriNetUnfolderBase]: For 2875/2888 co-relation queries the response was YES. [2024-02-05 10:36:48,499 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-05 10:36:48,506 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-02-05 10:36:48,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 902 flow [2024-02-05 10:36:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-02-05 10:36:48,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-02-05 10:36:48,508 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 611 flow. Second operand 6 states and 234 transitions. [2024-02-05 10:36:48,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 902 flow [2024-02-05 10:36:48,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 872 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:48,514 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 649 flow [2024-02-05 10:36:48,514 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-05 10:36:48,515 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2024-02-05 10:36:48,515 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 649 flow [2024-02-05 10:36:48,515 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-05 10:36:48,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:48,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:48,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-05 10:36:48,516 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:48,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1614885897, now seen corresponding path program 3 times [2024-02-05 10:36:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781234402] [2024-02-05 10:36:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781234402] [2024-02-05 10:36:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781234402] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:36:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255319927] [2024-02-05 10:36:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:36:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:36:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:36:48,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:48,750 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-05 10:36:48,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:48,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:49,192 INFO L124 PetriNetUnfolderBase]: 1847/3380 cut-off events. [2024-02-05 10:36:49,193 INFO L125 PetriNetUnfolderBase]: For 4071/4127 co-relation queries the response was YES. [2024-02-05 10:36:49,204 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-05 10:36:49,214 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 84 selfloop transitions, 31 changer transitions 0/130 dead transitions. [2024-02-05 10:36:49,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 960 flow [2024-02-05 10:36:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-05 10:36:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-05 10:36:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-02-05 10:36:49,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-02-05 10:36:49,216 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 649 flow. Second operand 6 states and 239 transitions. [2024-02-05 10:36:49,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 130 transitions, 960 flow [2024-02-05 10:36:49,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 891 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-02-05 10:36:49,222 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 703 flow [2024-02-05 10:36:49,223 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-05 10:36:49,223 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 11 predicate places. [2024-02-05 10:36:49,223 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 703 flow [2024-02-05 10:36:49,223 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-05 10:36:49,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:49,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:49,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-05 10:36:49,224 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:49,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1188807365, now seen corresponding path program 1 times [2024-02-05 10:36:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151809779] [2024-02-05 10:36:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:49,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151809779] [2024-02-05 10:36:49,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151809779] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260684764] [2024-02-05 10:36:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:49,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:49,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:49,562 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-05 10:36:49,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:49,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:49,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:49,975 INFO L124 PetriNetUnfolderBase]: 1460/2669 cut-off events. [2024-02-05 10:36:49,976 INFO L125 PetriNetUnfolderBase]: For 3341/3390 co-relation queries the response was YES. [2024-02-05 10:36:49,982 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-05 10:36:49,988 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 109 selfloop transitions, 26 changer transitions 0/150 dead transitions. [2024-02-05 10:36:49,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 150 transitions, 1101 flow [2024-02-05 10:36:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:36:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:36:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2024-02-05 10:36:49,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3539253539253539 [2024-02-05 10:36:49,989 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 703 flow. Second operand 7 states and 275 transitions. [2024-02-05 10:36:49,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 150 transitions, 1101 flow [2024-02-05 10:36:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 150 transitions, 1047 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:49,995 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 759 flow [2024-02-05 10:36:49,996 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-05 10:36:49,996 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2024-02-05 10:36:49,996 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 759 flow [2024-02-05 10:36:49,996 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-05 10:36:49,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:49,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:49,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-05 10:36:49,997 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:49,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -818312030, now seen corresponding path program 1 times [2024-02-05 10:36:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79975244] [2024-02-05 10:36:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:49,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:50,281 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-05 10:36:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79975244] [2024-02-05 10:36:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79975244] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020715261] [2024-02-05 10:36:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:50,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:50,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:50,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:50,334 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-05 10:36:50,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:50,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:50,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:50,762 INFO L124 PetriNetUnfolderBase]: 1495/2748 cut-off events. [2024-02-05 10:36:50,763 INFO L125 PetriNetUnfolderBase]: For 3708/3790 co-relation queries the response was YES. [2024-02-05 10:36:50,774 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-05 10:36:50,784 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 113 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-02-05 10:36:50,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 156 transitions, 1167 flow [2024-02-05 10:36:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 306 transitions. [2024-02-05 10:36:50,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2024-02-05 10:36:50,787 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 759 flow. Second operand 8 states and 306 transitions. [2024-02-05 10:36:50,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 156 transitions, 1167 flow [2024-02-05 10:36:50,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 156 transitions, 1137 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:50,802 INFO L231 Difference]: Finished difference. Result has 138 places, 118 transitions, 831 flow [2024-02-05 10:36:50,803 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-05 10:36:50,803 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2024-02-05 10:36:50,803 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 831 flow [2024-02-05 10:36:50,803 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-05 10:36:50,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:50,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-05 10:36:50,804 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:50,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1006496784, now seen corresponding path program 1 times [2024-02-05 10:36:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660537895] [2024-02-05 10:36:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:51,105 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-05 10:36:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660537895] [2024-02-05 10:36:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660537895] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097810009] [2024-02-05 10:36:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:51,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:51,177 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-05 10:36:51,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:51,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:51,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:51,715 INFO L124 PetriNetUnfolderBase]: 1403/2618 cut-off events. [2024-02-05 10:36:51,716 INFO L125 PetriNetUnfolderBase]: For 4505/4558 co-relation queries the response was YES. [2024-02-05 10:36:51,727 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-05 10:36:51,737 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 34 changer transitions 0/151 dead transitions. [2024-02-05 10:36:51,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 151 transitions, 1284 flow [2024-02-05 10:36:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-02-05 10:36:51,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-02-05 10:36:51,740 INFO L175 Difference]: Start difference. First operand has 138 places, 118 transitions, 831 flow. Second operand 8 states and 294 transitions. [2024-02-05 10:36:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 151 transitions, 1284 flow [2024-02-05 10:36:51,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 151 transitions, 1243 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:51,763 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 969 flow [2024-02-05 10:36:51,763 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-05 10:36:51,764 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 29 predicate places. [2024-02-05 10:36:51,764 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 969 flow [2024-02-05 10:36:51,764 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-05 10:36:51,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:51,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:51,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-05 10:36:51,765 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:51,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1930508408, now seen corresponding path program 2 times [2024-02-05 10:36:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071105604] [2024-02-05 10:36:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:52,082 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-05 10:36:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071105604] [2024-02-05 10:36:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071105604] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220430192] [2024-02-05 10:36:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:52,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:52,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:52,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:52,128 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-05 10:36:52,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:52,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:52,661 INFO L124 PetriNetUnfolderBase]: 1397/2584 cut-off events. [2024-02-05 10:36:52,661 INFO L125 PetriNetUnfolderBase]: For 4654/4707 co-relation queries the response was YES. [2024-02-05 10:36:52,668 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-05 10:36:52,675 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 99 selfloop transitions, 37 changer transitions 0/151 dead transitions. [2024-02-05 10:36:52,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 1363 flow [2024-02-05 10:36:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-02-05 10:36:52,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32882882882882886 [2024-02-05 10:36:52,689 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 969 flow. Second operand 8 states and 292 transitions. [2024-02-05 10:36:52,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 1363 flow [2024-02-05 10:36:52,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 1317 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:52,700 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 1046 flow [2024-02-05 10:36:52,700 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-05 10:36:52,700 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2024-02-05 10:36:52,700 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 1046 flow [2024-02-05 10:36:52,701 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-05 10:36:52,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:52,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:52,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-05 10:36:52,701 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:52,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 357732288, now seen corresponding path program 3 times [2024-02-05 10:36:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059210685] [2024-02-05 10:36:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:52,980 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-05 10:36:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059210685] [2024-02-05 10:36:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059210685] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424028146] [2024-02-05 10:36:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:52,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:53,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:53,023 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-05 10:36:53,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:53,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:53,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:53,392 INFO L124 PetriNetUnfolderBase]: 1394/2579 cut-off events. [2024-02-05 10:36:53,392 INFO L125 PetriNetUnfolderBase]: For 4982/5035 co-relation queries the response was YES. [2024-02-05 10:36:53,403 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-05 10:36:53,411 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2024-02-05 10:36:53,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1426 flow [2024-02-05 10:36:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 295 transitions. [2024-02-05 10:36:53,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3322072072072072 [2024-02-05 10:36:53,415 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 1046 flow. Second operand 8 states and 295 transitions. [2024-02-05 10:36:53,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1426 flow [2024-02-05 10:36:53,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 1369 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-05 10:36:53,431 INFO L231 Difference]: Finished difference. Result has 154 places, 129 transitions, 1072 flow [2024-02-05 10:36:53,432 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-05 10:36:53,432 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 39 predicate places. [2024-02-05 10:36:53,432 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 129 transitions, 1072 flow [2024-02-05 10:36:53,433 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-05 10:36:53,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:53,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:53,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-05 10:36:53,433 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:53,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1733934478, now seen corresponding path program 4 times [2024-02-05 10:36:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536807140] [2024-02-05 10:36:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:53,710 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-05 10:36:53,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:53,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536807140] [2024-02-05 10:36:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536807140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490591918] [2024-02-05 10:36:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:53,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:53,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:53,813 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-05 10:36:53,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:53,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:53,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:54,301 INFO L124 PetriNetUnfolderBase]: 1411/2599 cut-off events. [2024-02-05 10:36:54,301 INFO L125 PetriNetUnfolderBase]: For 5394/5447 co-relation queries the response was YES. [2024-02-05 10:36:54,310 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-05 10:36:54,316 INFO L140 encePairwiseOnDemand]: 98/111 looper letters, 101 selfloop transitions, 39 changer transitions 0/155 dead transitions. [2024-02-05 10:36:54,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 1478 flow [2024-02-05 10:36:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-02-05 10:36:54,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-02-05 10:36:54,322 INFO L175 Difference]: Start difference. First operand has 154 places, 129 transitions, 1072 flow. Second operand 8 states and 294 transitions. [2024-02-05 10:36:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 1478 flow [2024-02-05 10:36:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 1401 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-02-05 10:36:54,336 INFO L231 Difference]: Finished difference. Result has 159 places, 135 transitions, 1149 flow [2024-02-05 10:36:54,336 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-05 10:36:54,336 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2024-02-05 10:36:54,337 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 1149 flow [2024-02-05 10:36:54,337 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-05 10:36:54,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:54,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:54,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-05 10:36:54,337 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:54,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -949804910, now seen corresponding path program 1 times [2024-02-05 10:36:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653335465] [2024-02-05 10:36:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:54,627 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-05 10:36:54,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:54,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653335465] [2024-02-05 10:36:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653335465] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:54,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522769218] [2024-02-05 10:36:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:54,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:54,743 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-05 10:36:54,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:55,158 INFO L124 PetriNetUnfolderBase]: 1474/2701 cut-off events. [2024-02-05 10:36:55,158 INFO L125 PetriNetUnfolderBase]: For 5781/5860 co-relation queries the response was YES. [2024-02-05 10:36:55,167 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-05 10:36:55,175 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 123 selfloop transitions, 31 changer transitions 0/173 dead transitions. [2024-02-05 10:36:55,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 1612 flow [2024-02-05 10:36:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:36:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:36:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2024-02-05 10:36:55,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552123552123552 [2024-02-05 10:36:55,177 INFO L175 Difference]: Start difference. First operand has 159 places, 135 transitions, 1149 flow. Second operand 7 states and 276 transitions. [2024-02-05 10:36:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 1612 flow [2024-02-05 10:36:55,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 173 transitions, 1569 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:55,189 INFO L231 Difference]: Finished difference. Result has 164 places, 141 transitions, 1220 flow [2024-02-05 10:36:55,190 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-05 10:36:55,190 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 49 predicate places. [2024-02-05 10:36:55,190 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 141 transitions, 1220 flow [2024-02-05 10:36:55,190 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-05 10:36:55,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:55,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:55,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-05 10:36:55,191 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:55,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -210045352, now seen corresponding path program 2 times [2024-02-05 10:36:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637410161] [2024-02-05 10:36:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:55,414 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-05 10:36:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637410161] [2024-02-05 10:36:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637410161] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647437772] [2024-02-05 10:36:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:55,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:55,450 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-05 10:36:55,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:55,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:55,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:55,828 INFO L124 PetriNetUnfolderBase]: 1485/2724 cut-off events. [2024-02-05 10:36:55,828 INFO L125 PetriNetUnfolderBase]: For 6167/6239 co-relation queries the response was YES. [2024-02-05 10:36:55,839 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-05 10:36:55,846 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 119 selfloop transitions, 32 changer transitions 0/170 dead transitions. [2024-02-05 10:36:55,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 1654 flow [2024-02-05 10:36:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:36:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:36:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 267 transitions. [2024-02-05 10:36:55,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3436293436293436 [2024-02-05 10:36:55,851 INFO L175 Difference]: Start difference. First operand has 164 places, 141 transitions, 1220 flow. Second operand 7 states and 267 transitions. [2024-02-05 10:36:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 1654 flow [2024-02-05 10:36:55,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 1615 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:55,869 INFO L231 Difference]: Finished difference. Result has 169 places, 145 transitions, 1291 flow [2024-02-05 10:36:55,870 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-05 10:36:55,870 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 54 predicate places. [2024-02-05 10:36:55,870 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 145 transitions, 1291 flow [2024-02-05 10:36:55,870 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-05 10:36:55,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:55,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-05 10:36:55,871 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:55,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash -208316482, now seen corresponding path program 3 times [2024-02-05 10:36:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928703933] [2024-02-05 10:36:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:56,107 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-05 10:36:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928703933] [2024-02-05 10:36:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928703933] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289936511] [2024-02-05 10:36:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:56,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:56,148 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-05 10:36:56,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:56,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:56,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:56,564 INFO L124 PetriNetUnfolderBase]: 1482/2719 cut-off events. [2024-02-05 10:36:56,564 INFO L125 PetriNetUnfolderBase]: For 6523/6595 co-relation queries the response was YES. [2024-02-05 10:36:56,577 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-05 10:36:56,585 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 117 selfloop transitions, 33 changer transitions 0/169 dead transitions. [2024-02-05 10:36:56,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 169 transitions, 1679 flow [2024-02-05 10:36:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:36:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:36:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2024-02-05 10:36:56,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3410553410553411 [2024-02-05 10:36:56,587 INFO L175 Difference]: Start difference. First operand has 169 places, 145 transitions, 1291 flow. Second operand 7 states and 265 transitions. [2024-02-05 10:36:56,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 169 transitions, 1679 flow [2024-02-05 10:36:56,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 1628 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-05 10:36:56,604 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 1311 flow [2024-02-05 10:36:56,605 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-05 10:36:56,605 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 58 predicate places. [2024-02-05 10:36:56,605 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 1311 flow [2024-02-05 10:36:56,605 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-05 10:36:56,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:56,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:56,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-05 10:36:56,606 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:56,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 17444766, now seen corresponding path program 1 times [2024-02-05 10:36:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240000785] [2024-02-05 10:36:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:56,851 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-05 10:36:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240000785] [2024-02-05 10:36:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240000785] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:36:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:36:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:36:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967887412] [2024-02-05 10:36:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:36:56,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:36:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:36:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:36:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:36:56,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-02-05 10:36:56,911 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-05 10:36:56,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:36:56,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-02-05 10:36:56,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:36:57,386 INFO L124 PetriNetUnfolderBase]: 1453/2690 cut-off events. [2024-02-05 10:36:57,386 INFO L125 PetriNetUnfolderBase]: For 6640/6717 co-relation queries the response was YES. [2024-02-05 10:36:57,399 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-05 10:36:57,408 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 129 selfloop transitions, 33 changer transitions 0/180 dead transitions. [2024-02-05 10:36:57,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 180 transitions, 1757 flow [2024-02-05 10:36:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:36:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:36:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2024-02-05 10:36:57,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367117117117117 [2024-02-05 10:36:57,411 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 1311 flow. Second operand 8 states and 299 transitions. [2024-02-05 10:36:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 180 transitions, 1757 flow [2024-02-05 10:36:57,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 180 transitions, 1685 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-02-05 10:36:57,428 INFO L231 Difference]: Finished difference. Result has 175 places, 145 transitions, 1312 flow [2024-02-05 10:36:57,428 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-05 10:36:57,428 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 60 predicate places. [2024-02-05 10:36:57,429 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 1312 flow [2024-02-05 10:36:57,429 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-05 10:36:57,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:57,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:57,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-05 10:36:57,429 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-02-05 10:36:57,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -418825243, now seen corresponding path program 1 times [2024-02-05 10:36:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506391611] [2024-02-05 10:36:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:36:57,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:36:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:36:57,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:36:57,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:36:57,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 116 remaining) [2024-02-05 10:36:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 116 remaining) [2024-02-05 10:36:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 116 remaining) [2024-02-05 10:36:57,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 116 remaining) [2024-02-05 10:36:57,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 116 remaining) [2024-02-05 10:36:57,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 116 remaining) [2024-02-05 10:36:57,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 116 remaining) [2024-02-05 10:36:57,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 116 remaining) [2024-02-05 10:36:57,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 116 remaining) [2024-02-05 10:36:57,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 116 remaining) [2024-02-05 10:36:57,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 116 remaining) [2024-02-05 10:36:57,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 116 remaining) [2024-02-05 10:36:57,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 116 remaining) [2024-02-05 10:36:57,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 116 remaining) [2024-02-05 10:36:57,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 116 remaining) [2024-02-05 10:36:57,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 116 remaining) [2024-02-05 10:36:57,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (57 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 116 remaining) [2024-02-05 10:36:57,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 116 remaining) [2024-02-05 10:36:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 116 remaining) [2024-02-05 10:36:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 116 remaining) [2024-02-05 10:36:57,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 116 remaining) [2024-02-05 10:36:57,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 116 remaining) [2024-02-05 10:36:57,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 116 remaining) [2024-02-05 10:36:57,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 116 remaining) [2024-02-05 10:36:57,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 116 remaining) [2024-02-05 10:36:57,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 116 remaining) [2024-02-05 10:36:57,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 116 remaining) [2024-02-05 10:36:57,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 116 remaining) [2024-02-05 10:36:57,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-05 10:36:57,536 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-05 10:36:57,542 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:36:57,543 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:36:57,586 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-02-05 10:36:57,588 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-02-05 10:36:57,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:36:57 BasicIcfg [2024-02-05 10:36:57,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:36:57,590 INFO L158 Benchmark]: Toolchain (without parser) took 21565.48ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 924.8MB). Free memory was 165.3MB in the beginning and 776.4MB in the end (delta: -611.1MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,590 INFO L158 Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 197.1MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:36:57,590 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:36:57,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.98ms. Allocated memory is still 197.1MB. Free memory was 165.3MB in the beginning and 135.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.02ms. Allocated memory is still 197.1MB. Free memory was 135.4MB in the beginning and 131.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,591 INFO L158 Benchmark]: Boogie Preprocessor took 55.44ms. Allocated memory is still 197.1MB. Free memory was 131.9MB in the beginning and 129.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,591 INFO L158 Benchmark]: RCFGBuilder took 994.31ms. Allocated memory was 197.1MB in the beginning and 255.9MB in the end (delta: 58.7MB). Free memory was 129.1MB in the beginning and 216.4MB in the end (delta: -87.2MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,591 INFO L158 Benchmark]: TraceAbstraction took 19934.61ms. Allocated memory was 255.9MB in the beginning and 1.1GB in the end (delta: 866.1MB). Free memory was 215.3MB in the beginning and 776.4MB in the end (delta: -561.1MB). Peak memory consumption was 304.0MB. Max. memory is 16.1GB. [2024-02-05 10:36:57,592 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.23ms. Allocated memory is still 197.1MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.98ms. Allocated memory is still 197.1MB. Free memory was 165.3MB in the beginning and 135.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.02ms. Allocated memory is still 197.1MB. Free memory was 135.4MB in the beginning and 131.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.44ms. Allocated memory is still 197.1MB. Free memory was 131.9MB in the beginning and 129.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 994.31ms. Allocated memory was 197.1MB in the beginning and 255.9MB in the end (delta: 58.7MB). Free memory was 129.1MB in the beginning and 216.4MB in the end (delta: -87.2MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19934.61ms. Allocated memory was 255.9MB in the beginning and 1.1GB in the end (delta: 866.1MB). Free memory was 215.3MB in the beginning and 776.4MB in the end (delta: -561.1MB). Peak memory consumption was 304.0MB. 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: 19.8s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2636 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2121 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 4.3s 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, 1.9s 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.1s SatisfiabilityAnalysisTime, 5.7s 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-05 10:36:57,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE