./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.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/bench-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:05,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:05,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:05,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:05,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:05,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:05,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:05,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:05,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:05,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:05,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:05,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:05,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:05,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:05,417 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:05,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:05,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:05,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:05,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:05,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:05,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:05,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:05,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:05,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:05,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:05,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:05,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:05,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:05,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:05,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:05,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:05,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:05,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:05,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:05,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:05,423 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:05,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:05,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:05,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:05,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:05,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:05,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:05,631 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:05,631 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:05,632 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/bench-exp2x3.wvr.yml/witness.yml [2024-01-29 22:56:05,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:05,753 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:05,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-29 22:56:06,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:07,018 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:07,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-29 22:56:07,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cf5ddc6/3ce0c2a8401d4717b1bd752814b5ce2f/FLAG2e15e1a32 [2024-01-29 22:56:07,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cf5ddc6/3ce0c2a8401d4717b1bd752814b5ce2f [2024-01-29 22:56:07,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:07,039 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:07,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:07,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:07,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:07,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:05" (1/2) ... [2024-01-29 22:56:07,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1b4167 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:05" (1/2) ... [2024-01-29 22:56:07,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78cbb91d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:07" (2/2) ... [2024-01-29 22:56:07,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1b4167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07, skipping insertion in model container [2024-01-29 22:56:07,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:07" (2/2) ... [2024-01-29 22:56:07,048 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:07,062 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:07,063 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL) [2024-01-29 22:56:07,063 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL) [2024-01-29 22:56:07,064 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (x3 == 0U) [2024-01-29 22:56:07,064 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((0LL - (long long )n) - (long long )x1 >= 0LL) [2024-01-29 22:56:07,064 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )n) + (long long )x1 >= 0LL [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (x2 == 0U) [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (x4 == 0U) [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (x1 == 0U) [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (n == 0U) [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (x2 == 0U) && (x4 == 0U) [2024-01-29 22:56:07,065 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x2 == 0U [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (x2 == 0U) && (x3 == 0U) [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ((x2 == 0U) && (x4 == 0U)) && (n == 0U) [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] n == 0U [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Loop invariant at [L54-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,066 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant after [L37-L43] n == 0U [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] x3 == 0U [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (x3 == 0U) && (n == 0U) [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (x3 == 0U) && (x4 == 0U) [2024-01-29 22:56:07,067 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,068 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,068 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L40] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,068 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (x4 == 0U) && (n == 0U) [2024-01-29 22:56:07,068 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] x4 == 0U [2024-01-29 22:56:07,068 INFO L98 nessWitnessExtractor]: Loop invariant at [L62-L64] (unsigned long )_argptr == 0UL [2024-01-29 22:56:07,089 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:07,234 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/bench-exp2x3.wvr.c[2289,2302] [2024-01-29 22:56:07,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:07,248 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:07,282 WARN L424 MainDispatcher]: Unable to annotate void* thread1(void* _argptr) { while (x1 < n) { x1 = x1 + x1; } return 0; } 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 [2024-01-29 22:56:07,306 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-29 22:56:07,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:07,326 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:07,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07 WrapperNode [2024-01-29 22:56:07,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:07,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:07,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:07,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:07,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,389 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-01-29 22:56:07,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:07,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:07,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:07,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:07,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,440 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-29 22:56:07,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:07,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:07,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:07,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:07,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (1/1) ... [2024-01-29 22:56:07,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:07,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:56:07,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:56:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-29 22:56:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 22:56:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:07,549 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:07,662 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:07,664 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:08,070 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:08,070 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:08,269 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:08,269 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 22:56:08,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:08 BoogieIcfgContainer [2024-01-29 22:56:08,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:08,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:08,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:08,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:08,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:05" (1/4) ... [2024-01-29 22:56:08,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b23ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:07" (2/4) ... [2024-01-29 22:56:08,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b23ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:07" (3/4) ... [2024-01-29 22:56:08,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b23ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:08, skipping insertion in model container [2024-01-29 22:56:08,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:08" (4/4) ... [2024-01-29 22:56:08,297 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-29 22:56:08,325 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:08,325 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-01-29 22:56:08,326 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:08,424 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-29 22:56:08,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 105 transitions, 238 flow [2024-01-29 22:56:08,487 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2024-01-29 22:56:08,487 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-29 22:56:08,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 101 events. 4/101 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 191 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2024-01-29 22:56:08,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 105 transitions, 238 flow [2024-01-29 22:56:08,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 100 transitions, 224 flow [2024-01-29 22:56:08,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:08,511 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;@6de176a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:08,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-01-29 22:56:08,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:08,513 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:08,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:08,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:08,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:08,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:08,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 12373, now seen corresponding path program 1 times [2024-01-29 22:56:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635823002] [2024-01-29 22:56:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635823002] [2024-01-29 22:56:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635823002] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378922962] [2024-01-29 22:56:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:08,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:09,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2024-01-29 22:56:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:09,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:09,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2024-01-29 22:56:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:09,982 INFO L124 PetriNetUnfolderBase]: 7352/10624 cut-off events. [2024-01-29 22:56:09,982 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-01-29 22:56:10,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20241 conditions, 10624 events. 7352/10624 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64512 event pairs, 4752 based on Foata normal form. 5/7172 useless extension candidates. Maximal degree in co-relation 17346. Up to 9143 conditions per place. [2024-01-29 22:56:10,061 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 37 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 22:56:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 290 flow [2024-01-29 22:56:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-01-29 22:56:10,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-01-29 22:56:10,074 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 224 flow. Second operand 3 states and 222 transitions. [2024-01-29 22:56:10,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 290 flow [2024-01-29 22:56:10,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 274 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-29 22:56:10,099 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 200 flow [2024-01-29 22:56:10,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-01-29 22:56:10,104 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -12 predicate places. [2024-01-29 22:56:10,104 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 200 flow [2024-01-29 22:56:10,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:10,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:10,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:10,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:10,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 11904228, now seen corresponding path program 1 times [2024-01-29 22:56:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086025049] [2024-01-29 22:56:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:10,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:10,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086025049] [2024-01-29 22:56:10,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086025049] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577122580] [2024-01-29 22:56:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:10,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:10,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:10,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 22:56:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:10,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 22:56:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:10,758 INFO L124 PetriNetUnfolderBase]: 2824/4418 cut-off events. [2024-01-29 22:56:10,758 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8312 conditions, 4418 events. 2824/4418 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 28917 event pairs, 2413 based on Foata normal form. 1/3575 useless extension candidates. Maximal degree in co-relation 8287. Up to 3774 conditions per place. [2024-01-29 22:56:10,786 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2024-01-29 22:56:10,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 278 flow [2024-01-29 22:56:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-01-29 22:56:10,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-01-29 22:56:10,793 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 200 flow. Second operand 4 states and 275 transitions. [2024-01-29 22:56:10,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 278 flow [2024-01-29 22:56:10,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:10,795 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 198 flow [2024-01-29 22:56:10,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=192, 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=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2024-01-29 22:56:10,796 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -13 predicate places. [2024-01-29 22:56:10,796 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 198 flow [2024-01-29 22:56:10,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:10,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:56:10,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:10,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:10,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 369031457, now seen corresponding path program 1 times [2024-01-29 22:56:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075726099] [2024-01-29 22:56:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075726099] [2024-01-29 22:56:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075726099] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733327997] [2024-01-29 22:56:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:10,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:10,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 22:56:10,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:10,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:10,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 22:56:10,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:11,307 INFO L124 PetriNetUnfolderBase]: 2824/4416 cut-off events. [2024-01-29 22:56:11,308 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-29 22:56:11,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4416 events. 2824/4416 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 28908 event pairs, 2413 based on Foata normal form. 1/3574 useless extension candidates. Maximal degree in co-relation 8267. Up to 3776 conditions per place. [2024-01-29 22:56:11,330 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2024-01-29 22:56:11,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 276 flow [2024-01-29 22:56:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-01-29 22:56:11,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-01-29 22:56:11,332 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 198 flow. Second operand 4 states and 275 transitions. [2024-01-29 22:56:11,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 276 flow [2024-01-29 22:56:11,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:11,334 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 194 flow [2024-01-29 22:56:11,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-01-29 22:56:11,334 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2024-01-29 22:56:11,335 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 194 flow [2024-01-29 22:56:11,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:11,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:11,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:11,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:11,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1299683816, now seen corresponding path program 1 times [2024-01-29 22:56:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796888581] [2024-01-29 22:56:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796888581] [2024-01-29 22:56:11,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796888581] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:11,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535915423] [2024-01-29 22:56:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:11,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:11,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 22:56:11,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:11,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:11,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 22:56:11,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:11,718 INFO L124 PetriNetUnfolderBase]: 2824/4414 cut-off events. [2024-01-29 22:56:11,718 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-29 22:56:11,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8309 conditions, 4414 events. 2824/4414 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 29010 event pairs, 2413 based on Foata normal form. 0/3571 useless extension candidates. Maximal degree in co-relation 8277. Up to 3775 conditions per place. [2024-01-29 22:56:11,741 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-01-29 22:56:11,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 272 flow [2024-01-29 22:56:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-01-29 22:56:11,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-01-29 22:56:11,743 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 194 flow. Second operand 4 states and 275 transitions. [2024-01-29 22:56:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 272 flow [2024-01-29 22:56:11,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:11,744 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 190 flow [2024-01-29 22:56:11,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-01-29 22:56:11,745 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2024-01-29 22:56:11,745 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 190 flow [2024-01-29 22:56:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:11,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:11,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:11,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:11,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 249984823, now seen corresponding path program 1 times [2024-01-29 22:56:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325125520] [2024-01-29 22:56:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325125520] [2024-01-29 22:56:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325125520] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:11,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122123652] [2024-01-29 22:56:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:11,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:56:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:56:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:56:11,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2024-01-29 22:56:11,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:11,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:11,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2024-01-29 22:56:11,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:12,422 INFO L124 PetriNetUnfolderBase]: 7352/10614 cut-off events. [2024-01-29 22:56:12,423 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-01-29 22:56:12,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19929 conditions, 10614 events. 7352/10614 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64579 event pairs, 4752 based on Foata normal form. 0/7167 useless extension candidates. Maximal degree in co-relation 19889. Up to 9138 conditions per place. [2024-01-29 22:56:12,561 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 45 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2024-01-29 22:56:12,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 280 flow [2024-01-29 22:56:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2024-01-29 22:56:12,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2024-01-29 22:56:12,563 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 190 flow. Second operand 5 states and 288 transitions. [2024-01-29 22:56:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 280 flow [2024-01-29 22:56:12,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 84 transitions, 274 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:12,565 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 184 flow [2024-01-29 22:56:12,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2024-01-29 22:56:12,566 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -20 predicate places. [2024-01-29 22:56:12,566 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 184 flow [2024-01-29 22:56:12,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:12,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:12,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:12,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:12,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:12,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -840404651, now seen corresponding path program 1 times [2024-01-29 22:56:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657296727] [2024-01-29 22:56:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657296727] [2024-01-29 22:56:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657296727] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874031248] [2024-01-29 22:56:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:12,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:12,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 22:56:12,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:12,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:12,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 22:56:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:12,887 INFO L124 PetriNetUnfolderBase]: 2026/3326 cut-off events. [2024-01-29 22:56:12,887 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:12,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6246 conditions, 3326 events. 2026/3326 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22998 event pairs, 1965 based on Foata normal form. 0/2933 useless extension candidates. Maximal degree in co-relation 6204. Up to 2822 conditions per place. [2024-01-29 22:56:12,910 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 39 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-29 22:56:12,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 264 flow [2024-01-29 22:56:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-01-29 22:56:12,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-01-29 22:56:12,912 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 184 flow. Second operand 3 states and 222 transitions. [2024-01-29 22:56:12,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 264 flow [2024-01-29 22:56:12,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 256 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:56:12,914 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 178 flow [2024-01-29 22:56:12,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2024-01-29 22:56:12,917 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -23 predicate places. [2024-01-29 22:56:12,917 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 178 flow [2024-01-29 22:56:12,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:12,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:12,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:12,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:12,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:12,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1130153761, now seen corresponding path program 1 times [2024-01-29 22:56:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:12,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329967254] [2024-01-29 22:56:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329967254] [2024-01-29 22:56:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329967254] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:12,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:12,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305332706] [2024-01-29 22:56:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:12,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:13,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 22:56:13,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:13,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:13,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 22:56:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:13,257 INFO L124 PetriNetUnfolderBase]: 2026/3325 cut-off events. [2024-01-29 22:56:13,257 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6243 conditions, 3325 events. 2026/3325 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22965 event pairs, 1965 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6217. Up to 2818 conditions per place. [2024-01-29 22:56:13,279 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 38 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-01-29 22:56:13,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 258 flow [2024-01-29 22:56:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2024-01-29 22:56:13,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-01-29 22:56:13,282 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 178 flow. Second operand 4 states and 282 transitions. [2024-01-29 22:56:13,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 258 flow [2024-01-29 22:56:13,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:13,284 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 178 flow [2024-01-29 22:56:13,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2024-01-29 22:56:13,285 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -23 predicate places. [2024-01-29 22:56:13,285 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 178 flow [2024-01-29 22:56:13,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:13,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:13,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:13,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:13,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:13,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -675027837, now seen corresponding path program 1 times [2024-01-29 22:56:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100730278] [2024-01-29 22:56:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100730278] [2024-01-29 22:56:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100730278] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724766958] [2024-01-29 22:56:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:13,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2024-01-29 22:56:13,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:13,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:13,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2024-01-29 22:56:13,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:13,956 INFO L124 PetriNetUnfolderBase]: 7352/10611 cut-off events. [2024-01-29 22:56:13,957 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-01-29 22:56:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19923 conditions, 10611 events. 7352/10611 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64529 event pairs, 4752 based on Foata normal form. 0/7164 useless extension candidates. Maximal degree in co-relation 19885. Up to 9138 conditions per place. [2024-01-29 22:56:14,020 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 43 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-01-29 22:56:14,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 81 transitions, 268 flow [2024-01-29 22:56:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2024-01-29 22:56:14,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-01-29 22:56:14,022 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 178 flow. Second operand 4 states and 259 transitions. [2024-01-29 22:56:14,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 81 transitions, 268 flow [2024-01-29 22:56:14,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:14,023 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 176 flow [2024-01-29 22:56:14,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2024-01-29 22:56:14,025 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -24 predicate places. [2024-01-29 22:56:14,026 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 176 flow [2024-01-29 22:56:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:14,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:14,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:14,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:14,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -797271507, now seen corresponding path program 1 times [2024-01-29 22:56:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449467013] [2024-01-29 22:56:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449467013] [2024-01-29 22:56:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449467013] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117234251] [2024-01-29 22:56:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:14,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-29 22:56:14,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-29 22:56:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:14,490 INFO L124 PetriNetUnfolderBase]: 3577/5646 cut-off events. [2024-01-29 22:56:14,490 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-01-29 22:56:14,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10337 conditions, 5646 events. 3577/5646 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 35726 event pairs, 1827 based on Foata normal form. 340/5690 useless extension candidates. Maximal degree in co-relation 10305. Up to 4124 conditions per place. [2024-01-29 22:56:14,515 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 49 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 22:56:14,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 305 flow [2024-01-29 22:56:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2024-01-29 22:56:14,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:56:14,517 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 176 flow. Second operand 4 states and 315 transitions. [2024-01-29 22:56:14,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 305 flow [2024-01-29 22:56:14,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 93 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:56:14,519 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 166 flow [2024-01-29 22:56:14,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2024-01-29 22:56:14,519 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -28 predicate places. [2024-01-29 22:56:14,520 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 166 flow [2024-01-29 22:56:14,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:14,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:14,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:14,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:14,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1674928342, now seen corresponding path program 1 times [2024-01-29 22:56:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:14,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866827962] [2024-01-29 22:56:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866827962] [2024-01-29 22:56:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866827962] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53102373] [2024-01-29 22:56:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:14,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-29 22:56:14,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:14,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-29 22:56:14,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:14,855 INFO L124 PetriNetUnfolderBase]: 3128/4716 cut-off events. [2024-01-29 22:56:14,855 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-01-29 22:56:14,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 4716 events. 3128/4716 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 29844 event pairs, 248 based on Foata normal form. 400/4951 useless extension candidates. Maximal degree in co-relation 8758. Up to 3336 conditions per place. [2024-01-29 22:56:14,882 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 52 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-29 22:56:14,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 307 flow [2024-01-29 22:56:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2024-01-29 22:56:14,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7571428571428571 [2024-01-29 22:56:14,884 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 166 flow. Second operand 4 states and 318 transitions. [2024-01-29 22:56:14,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 307 flow [2024-01-29 22:56:14,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 92 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:14,885 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 159 flow [2024-01-29 22:56:14,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-01-29 22:56:14,886 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -31 predicate places. [2024-01-29 22:56:14,886 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 159 flow [2024-01-29 22:56:14,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:14,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:14,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:14,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:14,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1004530611, now seen corresponding path program 1 times [2024-01-29 22:56:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638432891] [2024-01-29 22:56:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638432891] [2024-01-29 22:56:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638432891] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:14,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:14,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:14,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155226377] [2024-01-29 22:56:14,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:14,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:14,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:14,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:14,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:14,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-29 22:56:14,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:14,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:14,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-29 22:56:14,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:15,262 INFO L124 PetriNetUnfolderBase]: 2925/4980 cut-off events. [2024-01-29 22:56:15,263 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-01-29 22:56:15,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8979 conditions, 4980 events. 2925/4980 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 34783 event pairs, 501 based on Foata normal form. 400/5085 useless extension candidates. Maximal degree in co-relation 8945. Up to 3260 conditions per place. [2024-01-29 22:56:15,289 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 55 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 22:56:15,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 312 flow [2024-01-29 22:56:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2024-01-29 22:56:15,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7642857142857142 [2024-01-29 22:56:15,291 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 159 flow. Second operand 4 states and 321 transitions. [2024-01-29 22:56:15,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 312 flow [2024-01-29 22:56:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:15,293 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 152 flow [2024-01-29 22:56:15,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-01-29 22:56:15,293 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -34 predicate places. [2024-01-29 22:56:15,293 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 152 flow [2024-01-29 22:56:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:15,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:15,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:15,294 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:15,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1016395351, now seen corresponding path program 1 times [2024-01-29 22:56:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435550133] [2024-01-29 22:56:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435550133] [2024-01-29 22:56:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435550133] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587437694] [2024-01-29 22:56:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:15,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:15,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-29 22:56:15,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:15,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-29 22:56:15,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:15,628 INFO L124 PetriNetUnfolderBase]: 3016/4482 cut-off events. [2024-01-29 22:56:15,628 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-01-29 22:56:15,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8458 conditions, 4482 events. 3016/4482 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27187 event pairs, 305 based on Foata normal form. 340/4738 useless extension candidates. Maximal degree in co-relation 8424. Up to 2810 conditions per place. [2024-01-29 22:56:15,648 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 58 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-29 22:56:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 317 flow [2024-01-29 22:56:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2024-01-29 22:56:15,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2024-01-29 22:56:15,651 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 152 flow. Second operand 4 states and 324 transitions. [2024-01-29 22:56:15,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 317 flow [2024-01-29 22:56:15,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:15,652 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 145 flow [2024-01-29 22:56:15,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-01-29 22:56:15,653 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -37 predicate places. [2024-01-29 22:56:15,653 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 145 flow [2024-01-29 22:56:15,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:15,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:15,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:15,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:15,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 973494770, now seen corresponding path program 1 times [2024-01-29 22:56:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741014465] [2024-01-29 22:56:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741014465] [2024-01-29 22:56:15,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741014465] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:15,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:15,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:15,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444960613] [2024-01-29 22:56:15,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:15,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:15,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:15,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:15,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 105 [2024-01-29 22:56:15,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:15,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:15,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 105 [2024-01-29 22:56:15,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:16,210 INFO L124 PetriNetUnfolderBase]: 4381/6698 cut-off events. [2024-01-29 22:56:16,210 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-01-29 22:56:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12485 conditions, 6698 events. 4381/6698 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 40129 event pairs, 656 based on Foata normal form. 1/6573 useless extension candidates. Maximal degree in co-relation 12451. Up to 4604 conditions per place. [2024-01-29 22:56:16,238 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 52 selfloop transitions, 7 changer transitions 1/91 dead transitions. [2024-01-29 22:56:16,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 326 flow [2024-01-29 22:56:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2024-01-29 22:56:16,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8603174603174604 [2024-01-29 22:56:16,240 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 145 flow. Second operand 3 states and 271 transitions. [2024-01-29 22:56:16,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 326 flow [2024-01-29 22:56:16,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:16,242 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 181 flow [2024-01-29 22:56:16,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-01-29 22:56:16,243 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -36 predicate places. [2024-01-29 22:56:16,243 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 181 flow [2024-01-29 22:56:16,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:16,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:16,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:16,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:16,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:16,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1382729269, now seen corresponding path program 1 times [2024-01-29 22:56:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369382964] [2024-01-29 22:56:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369382964] [2024-01-29 22:56:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369382964] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916990799] [2024-01-29 22:56:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:16,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:16,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2024-01-29 22:56:16,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:16,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:16,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2024-01-29 22:56:16,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:17,182 INFO L124 PetriNetUnfolderBase]: 8981/12505 cut-off events. [2024-01-29 22:56:17,182 INFO L125 PetriNetUnfolderBase]: For 2468/3064 co-relation queries the response was YES. [2024-01-29 22:56:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27753 conditions, 12505 events. 8981/12505 cut-off events. For 2468/3064 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 73929 event pairs, 1167 based on Foata normal form. 30/11008 useless extension candidates. Maximal degree in co-relation 27702. Up to 4271 conditions per place. [2024-01-29 22:56:17,247 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 103 selfloop transitions, 17 changer transitions 0/137 dead transitions. [2024-01-29 22:56:17,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 606 flow [2024-01-29 22:56:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2024-01-29 22:56:17,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7295238095238096 [2024-01-29 22:56:17,249 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 181 flow. Second operand 5 states and 383 transitions. [2024-01-29 22:56:17,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 606 flow [2024-01-29 22:56:17,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:17,251 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 278 flow [2024-01-29 22:56:17,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2024-01-29 22:56:17,252 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -30 predicate places. [2024-01-29 22:56:17,252 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 278 flow [2024-01-29 22:56:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:17,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:17,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:17,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:17,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:17,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1999587725, now seen corresponding path program 2 times [2024-01-29 22:56:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421979346] [2024-01-29 22:56:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421979346] [2024-01-29 22:56:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421979346] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880246672] [2024-01-29 22:56:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:17,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:17,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:17,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2024-01-29 22:56:17,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:17,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:17,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2024-01-29 22:56:17,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:18,184 INFO L124 PetriNetUnfolderBase]: 8577/12004 cut-off events. [2024-01-29 22:56:18,184 INFO L125 PetriNetUnfolderBase]: For 7679/7727 co-relation queries the response was YES. [2024-01-29 22:56:18,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30840 conditions, 12004 events. 8577/12004 cut-off events. For 7679/7727 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 71275 event pairs, 1701 based on Foata normal form. 262/11940 useless extension candidates. Maximal degree in co-relation 30779. Up to 4122 conditions per place. [2024-01-29 22:56:18,247 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 109 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-01-29 22:56:18,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 729 flow [2024-01-29 22:56:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2024-01-29 22:56:18,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7352380952380952 [2024-01-29 22:56:18,252 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 278 flow. Second operand 5 states and 386 transitions. [2024-01-29 22:56:18,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 145 transitions, 729 flow [2024-01-29 22:56:18,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:56:18,260 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 395 flow [2024-01-29 22:56:18,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-01-29 22:56:18,261 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2024-01-29 22:56:18,261 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 395 flow [2024-01-29 22:56:18,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:18,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:18,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:18,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:18,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:18,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash -317025146, now seen corresponding path program 1 times [2024-01-29 22:56:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726366105] [2024-01-29 22:56:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:18,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:18,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726366105] [2024-01-29 22:56:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726366105] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:18,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052631767] [2024-01-29 22:56:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:18,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:18,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2024-01-29 22:56:18,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:18,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:18,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2024-01-29 22:56:18,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:19,271 INFO L124 PetriNetUnfolderBase]: 8981/12459 cut-off events. [2024-01-29 22:56:19,271 INFO L125 PetriNetUnfolderBase]: For 22237/22800 co-relation queries the response was YES. [2024-01-29 22:56:19,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37129 conditions, 12459 events. 8981/12459 cut-off events. For 22237/22800 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 74067 event pairs, 967 based on Foata normal form. 201/12424 useless extension candidates. Maximal degree in co-relation 37056. Up to 4759 conditions per place. [2024-01-29 22:56:19,325 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 111 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2024-01-29 22:56:19,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 839 flow [2024-01-29 22:56:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2024-01-29 22:56:19,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2024-01-29 22:56:19,327 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 395 flow. Second operand 5 states and 390 transitions. [2024-01-29 22:56:19,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 839 flow [2024-01-29 22:56:19,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 835 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-29 22:56:19,366 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 482 flow [2024-01-29 22:56:19,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=482, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-01-29 22:56:19,367 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2024-01-29 22:56:19,367 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 482 flow [2024-01-29 22:56:19,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:19,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:19,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:19,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:19,368 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:19,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 831866104, now seen corresponding path program 2 times [2024-01-29 22:56:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847872085] [2024-01-29 22:56:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847872085] [2024-01-29 22:56:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847872085] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272902056] [2024-01-29 22:56:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:19,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:19,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:19,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2024-01-29 22:56:19,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 482 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:19,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:19,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2024-01-29 22:56:19,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:20,252 INFO L124 PetriNetUnfolderBase]: 8549/11886 cut-off events. [2024-01-29 22:56:20,252 INFO L125 PetriNetUnfolderBase]: For 26003/26098 co-relation queries the response was YES. [2024-01-29 22:56:20,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37005 conditions, 11886 events. 8549/11886 cut-off events. For 26003/26098 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 69399 event pairs, 2391 based on Foata normal form. 230/11762 useless extension candidates. Maximal degree in co-relation 36923. Up to 5169 conditions per place. [2024-01-29 22:56:20,318 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 114 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-01-29 22:56:20,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 149 transitions, 937 flow [2024-01-29 22:56:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2024-01-29 22:56:20,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7447619047619047 [2024-01-29 22:56:20,320 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 482 flow. Second operand 5 states and 391 transitions. [2024-01-29 22:56:20,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 149 transitions, 937 flow [2024-01-29 22:56:20,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 928 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:20,356 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 562 flow [2024-01-29 22:56:20,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-01-29 22:56:20,357 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -9 predicate places. [2024-01-29 22:56:20,357 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 562 flow [2024-01-29 22:56:20,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:20,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:20,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:20,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:20,358 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:20,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2138841899, now seen corresponding path program 1 times [2024-01-29 22:56:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449409605] [2024-01-29 22:56:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449409605] [2024-01-29 22:56:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449409605] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:56:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161274012] [2024-01-29 22:56:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:56:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:20,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:56:20,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-29 22:56:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:20,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-29 22:56:20,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:56:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:20,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:56:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161274012] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:56:20,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:56:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-01-29 22:56:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445390296] [2024-01-29 22:56:20,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:56:20,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:20,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 105 [2024-01-29 22:56:20,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:20,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:20,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 105 [2024-01-29 22:56:20,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:22,603 INFO L124 PetriNetUnfolderBase]: 15260/21257 cut-off events. [2024-01-29 22:56:22,603 INFO L125 PetriNetUnfolderBase]: For 91659/95966 co-relation queries the response was YES. [2024-01-29 22:56:22,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72604 conditions, 21257 events. 15260/21257 cut-off events. For 91659/95966 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 135060 event pairs, 1803 based on Foata normal form. 1148/19605 useless extension candidates. Maximal degree in co-relation 72515. Up to 6152 conditions per place. [2024-01-29 22:56:22,775 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 244 selfloop transitions, 16 changer transitions 0/287 dead transitions. [2024-01-29 22:56:22,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 287 transitions, 2576 flow [2024-01-29 22:56:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-29 22:56:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-29 22:56:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 677 transitions. [2024-01-29 22:56:22,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164021164021164 [2024-01-29 22:56:22,778 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 562 flow. Second operand 9 states and 677 transitions. [2024-01-29 22:56:22,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 287 transitions, 2576 flow [2024-01-29 22:56:22,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 287 transitions, 2513 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:22,848 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 657 flow [2024-01-29 22:56:22,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=657, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-01-29 22:56:22,849 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-01-29 22:56:22,849 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 657 flow [2024-01-29 22:56:22,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:22,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:22,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:22,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-29 22:56:23,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-01-29 22:56:23,062 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:23,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1634818151, now seen corresponding path program 2 times [2024-01-29 22:56:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500406121] [2024-01-29 22:56:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:23,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500406121] [2024-01-29 22:56:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500406121] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:23,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707624309] [2024-01-29 22:56:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:23,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:23,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:23,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 22:56:23,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:23,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:23,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 22:56:23,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:24,609 INFO L124 PetriNetUnfolderBase]: 13356/18603 cut-off events. [2024-01-29 22:56:24,609 INFO L125 PetriNetUnfolderBase]: For 90497/94499 co-relation queries the response was YES. [2024-01-29 22:56:24,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74361 conditions, 18603 events. 13356/18603 cut-off events. For 90497/94499 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 116298 event pairs, 1205 based on Foata normal form. 1205/18998 useless extension candidates. Maximal degree in co-relation 74266. Up to 6257 conditions per place. [2024-01-29 22:56:24,721 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 156 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-01-29 22:56:24,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1816 flow [2024-01-29 22:56:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2024-01-29 22:56:24,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7695238095238095 [2024-01-29 22:56:24,723 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 657 flow. Second operand 5 states and 404 transitions. [2024-01-29 22:56:24,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1816 flow [2024-01-29 22:56:24,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 203 transitions, 1814 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:24,810 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 801 flow [2024-01-29 22:56:24,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=801, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-01-29 22:56:24,810 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-01-29 22:56:24,810 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 801 flow [2024-01-29 22:56:24,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:24,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:24,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:56:24,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:24,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash -844281660, now seen corresponding path program 1 times [2024-01-29 22:56:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880384708] [2024-01-29 22:56:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880384708] [2024-01-29 22:56:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880384708] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:24,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096058828] [2024-01-29 22:56:24,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:24,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:24,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:24,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 22:56:24,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 801 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:24,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:24,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 22:56:24,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,567 INFO L124 PetriNetUnfolderBase]: 13188/18133 cut-off events. [2024-01-29 22:56:26,568 INFO L125 PetriNetUnfolderBase]: For 104278/108477 co-relation queries the response was YES. [2024-01-29 22:56:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78351 conditions, 18133 events. 13188/18133 cut-off events. For 104278/108477 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 108695 event pairs, 1177 based on Foata normal form. 1261/18588 useless extension candidates. Maximal degree in co-relation 78248. Up to 8801 conditions per place. [2024-01-29 22:56:26,718 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 162 selfloop transitions, 12 changer transitions 0/203 dead transitions. [2024-01-29 22:56:26,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 1885 flow [2024-01-29 22:56:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2024-01-29 22:56:26,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7676190476190476 [2024-01-29 22:56:26,720 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 801 flow. Second operand 5 states and 403 transitions. [2024-01-29 22:56:26,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 1885 flow [2024-01-29 22:56:26,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 203 transitions, 1875 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-01-29 22:56:26,909 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 836 flow [2024-01-29 22:56:26,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=836, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-01-29 22:56:26,910 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2024-01-29 22:56:26,910 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 836 flow [2024-01-29 22:56:26,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:26,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:26,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:56:26,911 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:26,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1235709808, now seen corresponding path program 2 times [2024-01-29 22:56:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862191826] [2024-01-29 22:56:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862191826] [2024-01-29 22:56:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862191826] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157637864] [2024-01-29 22:56:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:27,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 22:56:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:27,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 22:56:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,953 INFO L124 PetriNetUnfolderBase]: 13304/18697 cut-off events. [2024-01-29 22:56:28,953 INFO L125 PetriNetUnfolderBase]: For 118136/122011 co-relation queries the response was YES. [2024-01-29 22:56:29,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82772 conditions, 18697 events. 13304/18697 cut-off events. For 118136/122011 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 117068 event pairs, 2143 based on Foata normal form. 1348/19190 useless extension candidates. Maximal degree in co-relation 82660. Up to 8589 conditions per place. [2024-01-29 22:56:29,147 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 166 selfloop transitions, 16 changer transitions 0/211 dead transitions. [2024-01-29 22:56:29,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 211 transitions, 2007 flow [2024-01-29 22:56:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 405 transitions. [2024-01-29 22:56:29,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2024-01-29 22:56:29,149 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 836 flow. Second operand 5 states and 405 transitions. [2024-01-29 22:56:29,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 211 transitions, 2007 flow [2024-01-29 22:56:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 1990 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:29,493 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 936 flow [2024-01-29 22:56:29,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=936, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-01-29 22:56:29,493 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2024-01-29 22:56:29,493 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 936 flow [2024-01-29 22:56:29,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:29,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:56:29,503 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 22:56:29,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash -617095613, now seen corresponding path program 1 times [2024-01-29 22:56:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729391284] [2024-01-29 22:56:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729391284] [2024-01-29 22:56:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729391284] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:56:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715851801] [2024-01-29 22:56:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:56:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:30,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:56:30,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-29 22:56:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 22:56:30,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:59:00,942 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 23:00:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:00:20,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 23:00:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:00:58,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715851801] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 23:00:58,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 23:00:58,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2024-01-29 23:00:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399215016] [2024-01-29 23:00:58,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 23:00:58,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-29 23:00:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-29 23:00:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=268, Unknown=25, NotChecked=0, Total=380 [2024-01-29 23:01:02,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:06,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:10,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:14,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:19,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:22,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:24,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:28,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:32,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:40,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:41,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:45,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:49,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:52,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:54,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:01:57,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:01,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:05,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:07,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:09,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:13,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:17,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:19,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:23,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:23,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2024-01-29 23:02:23,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 936 flow. Second operand has 20 states, 20 states have (on average 37.85) internal successors, (757), 20 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:02:23,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:02:23,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2024-01-29 23:02:23,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:02:27,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:30,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:34,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:46,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:50,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:52,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:55,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:02:59,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:04,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:09,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:13,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:15,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:19,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:28,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:32,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:49,725 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 74 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 23:03:52,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:03:58,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:02,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:07,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:14,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:17,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:29,678 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 23:04:33,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:38,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:41,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:48,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:53,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:04:55,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:00,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:04,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:10,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:15,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:35,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:39,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:44,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:05:52,751 INFO L124 PetriNetUnfolderBase]: 41647/57523 cut-off events. [2024-01-29 23:05:52,751 INFO L125 PetriNetUnfolderBase]: For 401063/401297 co-relation queries the response was YES. [2024-01-29 23:05:53,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278988 conditions, 57523 events. 41647/57523 cut-off events. For 401063/401297 co-relation queries the response was YES. Maximal size of possible extension queue 2803. Compared 387369 event pairs, 3701 based on Foata normal form. 148/57544 useless extension candidates. Maximal degree in co-relation 278863. Up to 26980 conditions per place. [2024-01-29 23:05:53,322 INFO L140 encePairwiseOnDemand]: 86/105 looper letters, 517 selfloop transitions, 194 changer transitions 21/745 dead transitions. [2024-01-29 23:05:53,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 745 transitions, 7446 flow [2024-01-29 23:05:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-29 23:05:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-29 23:05:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1231 transitions. [2024-01-29 23:05:53,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097308488612836 [2024-01-29 23:05:53,331 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 936 flow. Second operand 23 states and 1231 transitions. [2024-01-29 23:05:53,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 745 transitions, 7446 flow [2024-01-29 23:05:54,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 745 transitions, 7343 flow, removed 31 selfloop flow, removed 1 redundant places. [2024-01-29 23:05:54,233 INFO L231 Difference]: Finished difference. Result has 164 places, 305 transitions, 3998 flow [2024-01-29 23:05:54,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3998, PETRI_PLACES=164, PETRI_TRANSITIONS=305} [2024-01-29 23:05:54,234 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 55 predicate places. [2024-01-29 23:05:54,234 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 305 transitions, 3998 flow [2024-01-29 23:05:54,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 37.85) internal successors, (757), 20 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:05:54,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:05:54,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:05:54,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-29 23:05:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-01-29 23:05:54,449 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 23:05:54,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:05:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2017197983, now seen corresponding path program 2 times [2024-01-29 23:05:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:05:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489616513] [2024-01-29 23:05:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:05:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:05:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:05:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:05:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:05:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489616513] [2024-01-29 23:05:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489616513] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 23:05:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53221572] [2024-01-29 23:05:54,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-29 23:05:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 23:05:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:05:54,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 23:05:54,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-29 23:05:55,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-29 23:05:55,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 23:05:55,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 23:05:55,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 23:06:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:06:15,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 23:06:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:06:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53221572] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 23:06:16,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 23:06:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-29 23:06:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234321612] [2024-01-29 23:06:16,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 23:06:16,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-29 23:06:16,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:06:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-29 23:06:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=246, Unknown=1, NotChecked=0, Total=342 [2024-01-29 23:06:21,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:22,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:24,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:28,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:33,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:36,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:40,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:45,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:46,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:51,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:52,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:54,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:06:58,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:07:02,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:07:06,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:07:06,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2024-01-29 23:07:06,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 305 transitions, 3998 flow. Second operand has 19 states, 19 states have (on average 38.10526315789474) internal successors, (724), 19 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:07:06,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:07:06,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2024-01-29 23:07:06,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:07:14,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:07:29,122 INFO L124 PetriNetUnfolderBase]: 62621/86591 cut-off events. [2024-01-29 23:07:29,122 INFO L125 PetriNetUnfolderBase]: For 877078/877411 co-relation queries the response was YES. [2024-01-29 23:07:29,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489054 conditions, 86591 events. 62621/86591 cut-off events. For 877078/877411 co-relation queries the response was YES. Maximal size of possible extension queue 4531. Compared 616061 event pairs, 5587 based on Foata normal form. 125/86589 useless extension candidates. Maximal degree in co-relation 488912. Up to 42846 conditions per place. [2024-01-29 23:07:30,242 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 658 selfloop transitions, 424 changer transitions 19/1114 dead transitions. [2024-01-29 23:07:30,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1114 transitions, 14694 flow [2024-01-29 23:07:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-29 23:07:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-29 23:07:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1307 transitions. [2024-01-29 23:07:30,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186507936507937 [2024-01-29 23:07:30,271 INFO L175 Difference]: Start difference. First operand has 164 places, 305 transitions, 3998 flow. Second operand 24 states and 1307 transitions. [2024-01-29 23:07:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1114 transitions, 14694 flow [2024-01-29 23:07:36,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1114 transitions, 13921 flow, removed 381 selfloop flow, removed 2 redundant places. [2024-01-29 23:07:36,401 INFO L231 Difference]: Finished difference. Result has 196 places, 616 transitions, 9971 flow [2024-01-29 23:07:36,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3637, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9971, PETRI_PLACES=196, PETRI_TRANSITIONS=616} [2024-01-29 23:07:36,402 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 87 predicate places. [2024-01-29 23:07:36,402 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 616 transitions, 9971 flow [2024-01-29 23:07:36,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 38.10526315789474) internal successors, (724), 19 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:07:36,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:07:36,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:07:36,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-29 23:07:36,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 23:07:36,615 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 23:07:36,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:07:36,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2143659333, now seen corresponding path program 1 times [2024-01-29 23:07:36,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:07:36,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367954343] [2024-01-29 23:07:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:07:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:07:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:07:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:07:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:07:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367954343] [2024-01-29 23:07:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367954343] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 23:07:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509687854] [2024-01-29 23:07:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:07:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 23:07:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:07:37,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 23:07:37,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-29 23:07:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:07:37,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 23:07:37,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 23:08:57,736 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 23:10:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:10:04,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 23:10:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:10:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509687854] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 23:10:16,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 23:10:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2024-01-29 23:10:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055787625] [2024-01-29 23:10:16,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 23:10:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-29 23:10:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:10:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-29 23:10:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=268, Unknown=10, NotChecked=0, Total=380 [2024-01-29 23:10:20,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:10:25,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:10:29,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 23:10:33,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15