./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/clever.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 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/clever.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.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-ab2e0ac-m [2024-01-29 14:18:17,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:18:18,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:18:18,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:18:18,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:18:18,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:18:18,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:18:18,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:18:18,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:18:18,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:18:18,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:18:18,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:18:18,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:18:18,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:18:18,185 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:18:18,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:18:18,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:18:18,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:18:18,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:18:18,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:18:18,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:18:18,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:18:18,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:18:18,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:18:18,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:18:18,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:18:18,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:18:18,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:18:18,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:18:18,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:18:18,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:18:18,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:18:18,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:18,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:18:18,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:18:18,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:18:18,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:18:18,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:18:18,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:18:18,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:18:18,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:18:18,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:18:18,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:18:18,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:18:18,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:18:18,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:18:18,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:18:18,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:18:18,457 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:18:18,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-29 14:18:19,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:18:19,650 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:18:19,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-29 14:18:19,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d079460/53a66b000f7c4f1e95caec29de39f44a/FLAG562860202 [2024-01-29 14:18:20,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d079460/53a66b000f7c4f1e95caec29de39f44a [2024-01-29 14:18:20,058 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:18:20,060 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:18:20,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml [2024-01-29 14:18:20,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:18:20,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:18:20,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:20,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:18:20,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:18:20,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:20" (1/2) ... [2024-01-29 14:18:20,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a64f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:20, skipping insertion in model container [2024-01-29 14:18:20,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:20" (1/2) ... [2024-01-29 14:18:20,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6dd5bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:20, skipping insertion in model container [2024-01-29 14:18:20,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:20" (2/2) ... [2024-01-29 14:18:20,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a64f6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20, skipping insertion in model container [2024-01-29 14:18:20,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:20" (2/2) ... [2024-01-29 14:18:20,174 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:18:20,190 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:18:20,191 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-29 14:18:20,191 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 14:18:20,191 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] m == 0 [2024-01-29 14:18:20,191 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] i2 == 0 [2024-01-29 14:18:20,191 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (long long )i2 + (long long )j1 >= 0LL [2024-01-29 14:18:20,192 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (long long )i2 - (long long )j1 >= 0LL [2024-01-29 14:18:20,192 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] j1 == 0 [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] i1 == 0 [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] k1 == 0U [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] k2 == 0U [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant after [L41-L43] k2 == 0U [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Loop invariant at [L41-L43] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] k2 == 0U [2024-01-29 14:18:20,193 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] k2 == 0U [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] j1 == 0 [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] k1 == 0U [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Loop invariant at [L40-L45] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,194 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 14:18:20,195 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] n == 0 [2024-01-29 14:18:20,195 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] i1 == 0 [2024-01-29 14:18:20,195 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] k2 == 0U [2024-01-29 14:18:20,195 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-29 14:18:20,195 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (long long )i2 - (long long )j1 >= 0LL [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] k1 == 0U [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (long long )i2 + (long long )j1 >= 0LL [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] m == 0 [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] i2 == 0 [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] j1 == 0 [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Loop invariant at [L51-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (long long )i2 + (long long )j1 >= 0LL [2024-01-29 14:18:20,196 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-29 14:18:20,197 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 14:18:20,197 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] i2 == 0 [2024-01-29 14:18:20,197 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] k2 == 0U [2024-01-29 14:18:20,197 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] k1 == 0U [2024-01-29 14:18:20,198 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] j1 == 0 [2024-01-29 14:18:20,199 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] i1 == 0 [2024-01-29 14:18:20,199 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (long long )i2 - (long long )j1 >= 0LL [2024-01-29 14:18:20,199 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,199 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,199 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-29 14:18:20,200 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] k1 == 0U [2024-01-29 14:18:20,200 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] k2 == 0U [2024-01-29 14:18:20,200 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j1 == 0 [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] k2 == 0U [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] k1 == 0U [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] k1 == 0U [2024-01-29 14:18:20,201 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (long long )i2 + (long long )j1 >= 0LL [2024-01-29 14:18:20,202 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (long long )i2 - (long long )j1 >= 0LL [2024-01-29 14:18:20,202 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] k2 == 0U [2024-01-29 14:18:20,202 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] i2 == 0 [2024-01-29 14:18:20,203 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] j1 == 0 [2024-01-29 14:18:20,218 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:18:20,365 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/clever.wvr.c[2159,2172] [2024-01-29 14:18:20,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:20,386 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:18:20,396 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:18:20,443 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/clever.wvr.c[2159,2172] [2024-01-29 14:18:20,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:20,454 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:18:20,461 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20 WrapperNode [2024-01-29 14:18:20,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:20,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:20,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:18:20,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:18:20,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,506 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-01-29 14:18:20,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:20,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:18:20,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:18:20,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:18:20,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,543 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-01-29 14:18:20,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:18:20,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:18:20,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:18:20,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:18:20,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (1/1) ... [2024-01-29 14:18:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:18:20,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:18:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:18:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:18:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:18:20,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:18:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:18:20,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:18:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:18:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:18:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:18:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:18:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:18:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:18:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:18:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:18:20,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:18:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:18:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:18:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:18:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:18:20,651 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:18:20,734 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:18:20,736 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:18:21,028 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:18:21,029 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:18:21,139 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:18:21,140 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-29 14:18:21,140 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:21 BoogieIcfgContainer [2024-01-29 14:18:21,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:18:21,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:18:21,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:18:21,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:18:21,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:18:20" (1/4) ... [2024-01-29 14:18:21,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7247c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:18:21, skipping insertion in model container [2024-01-29 14:18:21,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:20" (2/4) ... [2024-01-29 14:18:21,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7247c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:18:21, skipping insertion in model container [2024-01-29 14:18:21,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:20" (3/4) ... [2024-01-29 14:18:21,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7247c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:18:21, skipping insertion in model container [2024-01-29 14:18:21,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:21" (4/4) ... [2024-01-29 14:18:21,147 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-01-29 14:18:21,159 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:18:21,160 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 14:18:21,160 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:18:21,201 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:18:21,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 135 transitions, 284 flow [2024-01-29 14:18:21,260 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2024-01-29 14:18:21,260 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:18:21,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 3/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2024-01-29 14:18:21,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 135 transitions, 284 flow [2024-01-29 14:18:21,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 276 flow [2024-01-29 14:18:21,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:18:21,279 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;@53871716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:18:21,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-29 14:18:21,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:18:21,281 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:18:21,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:18:21,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:21,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:18:21,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:21,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash 14330, now seen corresponding path program 1 times [2024-01-29 14:18:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92762325] [2024-01-29 14:18:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92762325] [2024-01-29 14:18:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92762325] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444022346] [2024-01-29 14:18:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:21,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:21,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 135 [2024-01-29 14:18:21,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:21,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 135 [2024-01-29 14:18:21,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:21,834 INFO L124 PetriNetUnfolderBase]: 250/701 cut-off events. [2024-01-29 14:18:21,835 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 14:18:21,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 701 events. 250/701 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3817 event pairs, 99 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 939. Up to 209 conditions per place. [2024-01-29 14:18:21,846 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 44 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2024-01-29 14:18:21,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 144 transitions, 405 flow [2024-01-29 14:18:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2024-01-29 14:18:21,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8567901234567902 [2024-01-29 14:18:21,866 INFO L175 Difference]: Start difference. First operand has 136 places, 132 transitions, 276 flow. Second operand 3 states and 347 transitions. [2024-01-29 14:18:21,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 144 transitions, 405 flow [2024-01-29 14:18:21,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 144 transitions, 391 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:18:21,876 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 282 flow [2024-01-29 14:18:21,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-01-29 14:18:21,882 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -5 predicate places. [2024-01-29 14:18:21,882 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 282 flow [2024-01-29 14:18:21,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:21,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:21,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:18:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:18:21,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:21,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 444645, now seen corresponding path program 1 times [2024-01-29 14:18:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001650851] [2024-01-29 14:18:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001650851] [2024-01-29 14:18:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001650851] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:21,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:21,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928916067] [2024-01-29 14:18:21,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-29 14:18:22,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-29 14:18:22,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:22,184 INFO L124 PetriNetUnfolderBase]: 338/901 cut-off events. [2024-01-29 14:18:22,184 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-01-29 14:18:22,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 901 events. 338/901 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5338 event pairs, 135 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 647. Up to 294 conditions per place. [2024-01-29 14:18:22,190 INFO L140 encePairwiseOnDemand]: 127/135 looper letters, 45 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-01-29 14:18:22,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 142 transitions, 420 flow [2024-01-29 14:18:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-01-29 14:18:22,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2024-01-29 14:18:22,195 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 282 flow. Second operand 3 states and 349 transitions. [2024-01-29 14:18:22,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 142 transitions, 420 flow [2024-01-29 14:18:22,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 142 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:22,201 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 282 flow [2024-01-29 14:18:22,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2024-01-29 14:18:22,202 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -8 predicate places. [2024-01-29 14:18:22,202 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 282 flow [2024-01-29 14:18:22,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:22,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:18:22,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:18:22,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:22,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 13784512, now seen corresponding path program 1 times [2024-01-29 14:18:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257252677] [2024-01-29 14:18:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257252677] [2024-01-29 14:18:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257252677] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:22,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:22,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066821021] [2024-01-29 14:18:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:22,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2024-01-29 14:18:22,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2024-01-29 14:18:22,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:22,396 INFO L124 PetriNetUnfolderBase]: 338/875 cut-off events. [2024-01-29 14:18:22,396 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-01-29 14:18:22,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 875 events. 338/875 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5153 event pairs, 275 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 710. Up to 582 conditions per place. [2024-01-29 14:18:22,401 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 29 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-01-29 14:18:22,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 340 flow [2024-01-29 14:18:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-29 14:18:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2024-01-29 14:18:22,403 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 282 flow. Second operand 3 states and 342 transitions. [2024-01-29 14:18:22,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 340 flow [2024-01-29 14:18:22,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:22,407 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 278 flow [2024-01-29 14:18:22,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2024-01-29 14:18:22,409 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-01-29 14:18:22,409 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 278 flow [2024-01-29 14:18:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:22,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:18:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:18:22,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:22,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 427320310, now seen corresponding path program 1 times [2024-01-29 14:18:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678918619] [2024-01-29 14:18:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678918619] [2024-01-29 14:18:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678918619] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:22,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:22,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912382113] [2024-01-29 14:18:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:22,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 135 [2024-01-29 14:18:22,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 135 [2024-01-29 14:18:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:22,666 INFO L124 PetriNetUnfolderBase]: 338/859 cut-off events. [2024-01-29 14:18:22,666 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-01-29 14:18:22,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 859 events. 338/859 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5123 event pairs, 275 based on Foata normal form. 14/777 useless extension candidates. Maximal degree in co-relation 1549. Up to 580 conditions per place. [2024-01-29 14:18:22,670 INFO L140 encePairwiseOnDemand]: 117/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2024-01-29 14:18:22,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 108 transitions, 304 flow [2024-01-29 14:18:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-01-29 14:18:22,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-01-29 14:18:22,672 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 278 flow. Second operand 3 states and 291 transitions. [2024-01-29 14:18:22,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 108 transitions, 304 flow [2024-01-29 14:18:22,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 108 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:22,690 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 246 flow [2024-01-29 14:18:22,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2024-01-29 14:18:22,691 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2024-01-29 14:18:22,691 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 246 flow [2024-01-29 14:18:22,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:22,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:18:22,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:18:22,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:22,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 362028227, now seen corresponding path program 1 times [2024-01-29 14:18:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374979057] [2024-01-29 14:18:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374979057] [2024-01-29 14:18:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374979057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:22,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:22,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374656922] [2024-01-29 14:18:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:22,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:22,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-29 14:18:22,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-29 14:18:22,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:22,823 INFO L124 PetriNetUnfolderBase]: 338/853 cut-off events. [2024-01-29 14:18:22,823 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-01-29 14:18:22,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 853 events. 338/853 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5107 event pairs, 275 based on Foata normal form. 6/769 useless extension candidates. Maximal degree in co-relation 1522. Up to 578 conditions per place. [2024-01-29 14:18:22,828 INFO L140 encePairwiseOnDemand]: 127/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-01-29 14:18:22,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 292 flow [2024-01-29 14:18:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-01-29 14:18:22,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8345679012345679 [2024-01-29 14:18:22,829 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 246 flow. Second operand 3 states and 338 transitions. [2024-01-29 14:18:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 292 flow [2024-01-29 14:18:22,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:22,831 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 234 flow [2024-01-29 14:18:22,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-01-29 14:18:22,832 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-01-29 14:18:22,832 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 234 flow [2024-01-29 14:18:22,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:22,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:22,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:18:22,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:22,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 520516095, now seen corresponding path program 1 times [2024-01-29 14:18:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882849852] [2024-01-29 14:18:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882849852] [2024-01-29 14:18:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882849852] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367905306] [2024-01-29 14:18:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:22,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:22,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-29 14:18:22,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-29 14:18:22,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:22,964 INFO L124 PetriNetUnfolderBase]: 390/956 cut-off events. [2024-01-29 14:18:22,965 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-01-29 14:18:22,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 956 events. 390/956 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5905 event pairs, 323 based on Foata normal form. 7/867 useless extension candidates. Maximal degree in co-relation 1719. Up to 665 conditions per place. [2024-01-29 14:18:22,969 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 28 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-01-29 14:18:22,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 280 flow [2024-01-29 14:18:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-01-29 14:18:22,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8246913580246914 [2024-01-29 14:18:22,971 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 234 flow. Second operand 3 states and 334 transitions. [2024-01-29 14:18:22,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 280 flow [2024-01-29 14:18:22,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:22,973 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 220 flow [2024-01-29 14:18:22,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-01-29 14:18:22,974 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -38 predicate places. [2024-01-29 14:18:22,974 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 220 flow [2024-01-29 14:18:22,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:22,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:22,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:18:22,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:22,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1043869766, now seen corresponding path program 1 times [2024-01-29 14:18:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375795020] [2024-01-29 14:18:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375795020] [2024-01-29 14:18:22,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375795020] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:22,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:22,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954917917] [2024-01-29 14:18:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:22,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:22,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-29 14:18:22,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:22,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:22,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-29 14:18:22,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:23,135 INFO L124 PetriNetUnfolderBase]: 563/1485 cut-off events. [2024-01-29 14:18:23,135 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-01-29 14:18:23,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1485 events. 563/1485 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10528 event pairs, 165 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 2592. Up to 589 conditions per place. [2024-01-29 14:18:23,142 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 47 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2024-01-29 14:18:23,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 367 flow [2024-01-29 14:18:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2024-01-29 14:18:23,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2024-01-29 14:18:23,143 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 220 flow. Second operand 3 states and 355 transitions. [2024-01-29 14:18:23,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 367 flow [2024-01-29 14:18:23,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 111 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:23,145 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 226 flow [2024-01-29 14:18:23,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-01-29 14:18:23,146 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-01-29 14:18:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 226 flow [2024-01-29 14:18:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:18:23,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:23,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1999776076, now seen corresponding path program 1 times [2024-01-29 14:18:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485697069] [2024-01-29 14:18:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:23,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485697069] [2024-01-29 14:18:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485697069] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:23,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:23,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025504740] [2024-01-29 14:18:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:23,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:23,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 135 [2024-01-29 14:18:23,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:23,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 135 [2024-01-29 14:18:23,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:23,272 INFO L124 PetriNetUnfolderBase]: 563/1320 cut-off events. [2024-01-29 14:18:23,273 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2024-01-29 14:18:23,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1320 events. 563/1320 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8673 event pairs, 433 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 1213. Up to 937 conditions per place. [2024-01-29 14:18:23,279 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 29 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-29 14:18:23,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 286 flow [2024-01-29 14:18:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-01-29 14:18:23,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.854320987654321 [2024-01-29 14:18:23,281 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 226 flow. Second operand 3 states and 346 transitions. [2024-01-29 14:18:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 286 flow [2024-01-29 14:18:23,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:23,283 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 224 flow [2024-01-29 14:18:23,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2024-01-29 14:18:23,284 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-01-29 14:18:23,284 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 224 flow [2024-01-29 14:18:23,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:23,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:18:23,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:23,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 656019219, now seen corresponding path program 1 times [2024-01-29 14:18:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634656189] [2024-01-29 14:18:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634656189] [2024-01-29 14:18:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634656189] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:18:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10177695] [2024-01-29 14:18:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:18:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:18:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:18:23,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-29 14:18:23,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:23,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-29 14:18:23,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:23,556 INFO L124 PetriNetUnfolderBase]: 589/1385 cut-off events. [2024-01-29 14:18:23,556 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2024-01-29 14:18:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1385 events. 589/1385 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9123 event pairs, 7 based on Foata normal form. 270/1574 useless extension candidates. Maximal degree in co-relation 2658. Up to 946 conditions per place. [2024-01-29 14:18:23,562 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 37 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 14:18:23,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 309 flow [2024-01-29 14:18:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:18:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:18:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2024-01-29 14:18:23,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-01-29 14:18:23,564 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 224 flow. Second operand 4 states and 441 transitions. [2024-01-29 14:18:23,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 309 flow [2024-01-29 14:18:23,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:23,566 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 210 flow [2024-01-29 14:18:23,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2024-01-29 14:18:23,567 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -46 predicate places. [2024-01-29 14:18:23,567 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 210 flow [2024-01-29 14:18:23,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:23,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:23,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:18:23,568 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:23,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash -926475597, now seen corresponding path program 1 times [2024-01-29 14:18:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865879044] [2024-01-29 14:18:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:23,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865879044] [2024-01-29 14:18:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865879044] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:23,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:18:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322352158] [2024-01-29 14:18:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:18:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:18:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:18:23,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-29 14:18:23,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:23,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-29 14:18:23,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:23,818 INFO L124 PetriNetUnfolderBase]: 628/1265 cut-off events. [2024-01-29 14:18:23,818 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-01-29 14:18:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1265 events. 628/1265 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7254 event pairs, 16 based on Foata normal form. 160/1403 useless extension candidates. Maximal degree in co-relation 2568. Up to 892 conditions per place. [2024-01-29 14:18:23,823 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 50 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-01-29 14:18:23,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 371 flow [2024-01-29 14:18:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:18:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:18:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2024-01-29 14:18:23,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2024-01-29 14:18:23,825 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 210 flow. Second operand 4 states and 455 transitions. [2024-01-29 14:18:23,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 371 flow [2024-01-29 14:18:23,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 101 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:23,827 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 201 flow [2024-01-29 14:18:23,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2024-01-29 14:18:23,828 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -50 predicate places. [2024-01-29 14:18:23,828 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 201 flow [2024-01-29 14:18:23,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:23,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:18:23,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:23,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -544689350, now seen corresponding path program 1 times [2024-01-29 14:18:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:23,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425080317] [2024-01-29 14:18:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425080317] [2024-01-29 14:18:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425080317] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:18:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089793714] [2024-01-29 14:18:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:18:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:18:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:18:23,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 135 [2024-01-29 14:18:23,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:23,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:23,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 135 [2024-01-29 14:18:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:24,141 INFO L124 PetriNetUnfolderBase]: 977/1900 cut-off events. [2024-01-29 14:18:24,141 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-01-29 14:18:24,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 1900 events. 977/1900 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11423 event pairs, 226 based on Foata normal form. 0/1813 useless extension candidates. Maximal degree in co-relation 3973. Up to 772 conditions per place. [2024-01-29 14:18:24,152 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 71 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2024-01-29 14:18:24,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 463 flow [2024-01-29 14:18:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:18:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:18:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2024-01-29 14:18:24,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8074074074074075 [2024-01-29 14:18:24,154 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 201 flow. Second operand 4 states and 436 transitions. [2024-01-29 14:18:24,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 463 flow [2024-01-29 14:18:24,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:24,156 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 236 flow [2024-01-29 14:18:24,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-01-29 14:18:24,157 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -46 predicate places. [2024-01-29 14:18:24,157 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 236 flow [2024-01-29 14:18:24,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:24,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:24,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:18:24,158 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:24,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1658948107, now seen corresponding path program 1 times [2024-01-29 14:18:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748185546] [2024-01-29 14:18:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748185546] [2024-01-29 14:18:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748185546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:24,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 14:18:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480455193] [2024-01-29 14:18:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:18:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:18:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:18:24,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 135 [2024-01-29 14:18:24,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:24,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:24,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 135 [2024-01-29 14:18:24,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:25,190 INFO L124 PetriNetUnfolderBase]: 1919/3763 cut-off events. [2024-01-29 14:18:25,190 INFO L125 PetriNetUnfolderBase]: For 1485/1501 co-relation queries the response was YES. [2024-01-29 14:18:25,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8723 conditions, 3763 events. 1919/3763 cut-off events. For 1485/1501 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 25194 event pairs, 275 based on Foata normal form. 40/3765 useless extension candidates. Maximal degree in co-relation 8629. Up to 1028 conditions per place. [2024-01-29 14:18:25,210 INFO L140 encePairwiseOnDemand]: 125/135 looper letters, 137 selfloop transitions, 14 changer transitions 0/185 dead transitions. [2024-01-29 14:18:25,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 185 transitions, 867 flow [2024-01-29 14:18:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 14:18:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 14:18:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 771 transitions. [2024-01-29 14:18:25,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2024-01-29 14:18:25,213 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 236 flow. Second operand 8 states and 771 transitions. [2024-01-29 14:18:25,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 185 transitions, 867 flow [2024-01-29 14:18:25,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 185 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 14:18:25,216 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 372 flow [2024-01-29 14:18:25,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2024-01-29 14:18:25,217 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -32 predicate places. [2024-01-29 14:18:25,217 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 372 flow [2024-01-29 14:18:25,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:25,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:25,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:25,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:18:25,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:25,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash -150781515, now seen corresponding path program 2 times [2024-01-29 14:18:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:25,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270583630] [2024-01-29 14:18:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270583630] [2024-01-29 14:18:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270583630] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:25,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:25,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 14:18:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95397099] [2024-01-29 14:18:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:18:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:18:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:18:25,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 135 [2024-01-29 14:18:25,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:25,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:25,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 135 [2024-01-29 14:18:25,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:26,281 INFO L124 PetriNetUnfolderBase]: 2264/4404 cut-off events. [2024-01-29 14:18:26,281 INFO L125 PetriNetUnfolderBase]: For 5312/5422 co-relation queries the response was YES. [2024-01-29 14:18:26,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11626 conditions, 4404 events. 2264/4404 cut-off events. For 5312/5422 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30137 event pairs, 237 based on Foata normal form. 52/4411 useless extension candidates. Maximal degree in co-relation 11519. Up to 1421 conditions per place. [2024-01-29 14:18:26,305 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 130 selfloop transitions, 33 changer transitions 0/197 dead transitions. [2024-01-29 14:18:26,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 197 transitions, 1112 flow [2024-01-29 14:18:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 14:18:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 14:18:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 777 transitions. [2024-01-29 14:18:26,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7194444444444444 [2024-01-29 14:18:26,308 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 372 flow. Second operand 8 states and 777 transitions. [2024-01-29 14:18:26,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 197 transitions, 1112 flow [2024-01-29 14:18:26,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 197 transitions, 1112 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 14:18:26,320 INFO L231 Difference]: Finished difference. Result has 116 places, 114 transitions, 676 flow [2024-01-29 14:18:26,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=116, PETRI_TRANSITIONS=114} [2024-01-29 14:18:26,321 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-01-29 14:18:26,321 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 114 transitions, 676 flow [2024-01-29 14:18:26,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:26,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:26,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:26,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:18:26,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:26,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1500686945, now seen corresponding path program 3 times [2024-01-29 14:18:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:26,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743012042] [2024-01-29 14:18:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:26,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:26,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743012042] [2024-01-29 14:18:26,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743012042] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 14:18:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656828959] [2024-01-29 14:18:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:26,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:18:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:18:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:18:26,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 135 [2024-01-29 14:18:26,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 114 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:26,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:26,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 135 [2024-01-29 14:18:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:27,270 INFO L124 PetriNetUnfolderBase]: 2709/5278 cut-off events. [2024-01-29 14:18:27,270 INFO L125 PetriNetUnfolderBase]: For 13166/13296 co-relation queries the response was YES. [2024-01-29 14:18:27,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15676 conditions, 5278 events. 2709/5278 cut-off events. For 13166/13296 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37792 event pairs, 373 based on Foata normal form. 84/5301 useless extension candidates. Maximal degree in co-relation 15556. Up to 1561 conditions per place. [2024-01-29 14:18:27,294 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 134 selfloop transitions, 46 changer transitions 0/214 dead transitions. [2024-01-29 14:18:27,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 214 transitions, 1497 flow [2024-01-29 14:18:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 14:18:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 14:18:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 777 transitions. [2024-01-29 14:18:27,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7194444444444444 [2024-01-29 14:18:27,297 INFO L175 Difference]: Start difference. First operand has 116 places, 114 transitions, 676 flow. Second operand 8 states and 777 transitions. [2024-01-29 14:18:27,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 214 transitions, 1497 flow [2024-01-29 14:18:27,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 214 transitions, 1466 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:27,321 INFO L231 Difference]: Finished difference. Result has 127 places, 133 transitions, 1023 flow [2024-01-29 14:18:27,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=127, PETRI_TRANSITIONS=133} [2024-01-29 14:18:27,321 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-01-29 14:18:27,321 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 133 transitions, 1023 flow [2024-01-29 14:18:27,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:27,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:27,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:27,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:18:27,323 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 14:18:27,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -866015037, now seen corresponding path program 1 times [2024-01-29 14:18:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991103371] [2024-01-29 14:18:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:27,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:18:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:27,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:18:27,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:18:27,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-29 14:18:27,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-29 14:18:27,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-29 14:18:27,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-29 14:18:27,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-29 14:18:27,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-29 14:18:27,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-29 14:18:27,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-29 14:18:27,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-29 14:18:27,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-29 14:18:27,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-29 14:18:27,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-29 14:18:27,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-29 14:18:27,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-29 14:18:27,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-29 14:18:27,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (14 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-29 14:18:27,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-29 14:18:27,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-29 14:18:27,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-29 14:18:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:18:27,388 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:27,393 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:18:27,393 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:18:27,458 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-29 14:18:27,458 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-29 14:18:27,459 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:18:27 BasicIcfg [2024-01-29 14:18:27,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:18:27,459 INFO L158 Benchmark]: Toolchain (without parser) took 7295.90ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 92.6MB in the beginning and 309.3MB in the end (delta: -216.7MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,459 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:27,460 INFO L158 Benchmark]: Witness Parser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:27,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.96ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 128.2MB in the end (delta: -35.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.12ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 126.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,460 INFO L158 Benchmark]: Boogie Preprocessor took 57.81ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,461 INFO L158 Benchmark]: RCFGBuilder took 575.22ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 86.3MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,461 INFO L158 Benchmark]: TraceAbstraction took 6317.02ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 85.7MB in the beginning and 309.3MB in the end (delta: -223.6MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-01-29 14:18:27,462 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.96ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 128.2MB in the end (delta: -35.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.12ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 126.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.81ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.22ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 86.3MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6317.02ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 85.7MB in the beginning and 309.3MB in the end (delta: -223.6MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L36] 0 int n, m, i1, i2, j1; [L37] 0 unsigned int k1, k2; [L60] 0 pthread_t t1, t2; VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L63] 0 n = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L64] 0 m = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L65] 0 i1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L66] 0 i2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L67] 0 j1 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L68] 0 k1 = __VERIFIER_nondet_uint() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L69] 0 k2 = __VERIFIER_nondet_uint() [L72] CALL 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L33] COND FALSE 0 !(!cond) [L72] RET 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L73] CALL 0 assume_abort_if_not( m >= 0 ) [L33] COND FALSE 0 !(!cond) [L73] RET 0 assume_abort_if_not( m >= 0 ) [L75] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L76] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L40] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L40] COND TRUE 1 i1 < n [L41] 1 j1 = 0 VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L41] COND TRUE 1 j1 < m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L51] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L51] COND TRUE 2 i2 < n VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L52] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L52] 2 k2 = k2 + m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L42] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L42] 1 k1++ [L41] 1 j1++ VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] COND FALSE 1 !(j1 < m) VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: 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: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: 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: 40]: 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: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: 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: 63]: 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: 63]: 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: 63]: 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: 63]: 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: 63]: 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: 64]: 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: 64]: 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: 64]: 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: 64]: 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: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 66]: 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: 66]: 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: 66]: 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: 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: 67]: 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: 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: 81]: 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: 76]: 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: 75]: 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, 168 locations, 73 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: 6.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1985 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1387 mSDsluCounter, 1065 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 750 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2723 IncrementalHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 315 mSDtfsCounter, 2723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=14, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 1378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:18:27,511 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