./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.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/chl-simpl-str-trans.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/chl-simpl-str-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:57:00,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:57:00,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:57:00,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:57:00,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:57:00,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:57:00,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:57:00,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:57:00,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:57:00,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:57:00,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:57:00,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:57:00,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:57:00,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:57:00,689 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:57:00,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:57:00,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:57:00,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:57:00,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:57:00,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:57:00,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:57:00,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:57:00,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:57:00,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:57:00,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:57:00,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:57:00,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:57:00,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:57:00,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:57:00,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:57:00,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:57:00,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:57:00,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:00,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:57:00,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:57:00,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:57:00,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:57:00,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:57:00,701 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:57:00,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:57:00,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:57:00,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:57:00,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:57:00,906 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:57:00,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-29 22:57:01,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:57:02,068 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:57:02,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-29 22:57:02,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2ade30/f93891e536e34634b94a11a1f9da89f4/FLAG153bd6777 [2024-01-29 22:57:02,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2ade30/f93891e536e34634b94a11a1f9da89f4 [2024-01-29 22:57:02,096 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:57:02,096 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:57:02,098 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/chl-simpl-str-trans.wvr.yml/witness.yml [2024-01-29 22:57:02,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:57:02,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:57:02,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:02,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:57:02,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:57:02,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:02" (1/2) ... [2024-01-29 22:57:02,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4846a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:02" (1/2) ... [2024-01-29 22:57:02,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50ecd19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:02" (2/2) ... [2024-01-29 22:57:02,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4846a5df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:02" (2/2) ... [2024-01-29 22:57:02,210 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:57:02,228 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:57:02,228 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-29 22:57:02,229 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((to_int_1 == 0) && (length_2 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,229 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((to_int_1 == 0) && (length_2 == 0)) && (to_int_5 == 0)) && (result_6 == 0) [2024-01-29 22:57:02,230 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (length_2 == 0)) && (to_int_5 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (to_int_1 == 0) && (length_2 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((((to_int_1 == 0) && (length_2 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_1 == 0 [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (length_2 == 0)) && (length_4 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (length_2 == 0)) && (to_int_3 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (to_int_3 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((length_0 == 0) && (to_int_3 == 0)) && (result_6 == 0) [2024-01-29 22:57:02,231 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((length_0 == 0) && (to_int_3 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((length_0 == 0) && (to_int_3 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_0 == 0 [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (to_int_1 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (length_2 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((length_0 == 0) && (to_int_3 == 0)) && (to_int_5 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((length_0 == 0) && (to_int_3 == 0)) && (length_4 == 0) [2024-01-29 22:57:02,232 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 22:57:02,233 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((length_4 == 0) && (to_int_5 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,233 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (length_4 == 0) && (to_int_5 == 0) [2024-01-29 22:57:02,233 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((length_4 == 0) && (to_int_5 == 0)) && (result_6 == 0) [2024-01-29 22:57:02,233 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((length_4 == 0) && (to_int_5 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,233 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] length_4 == 0 [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((to_int_3 == 0) && (length_4 == 0)) && (result_6 == 0) [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (to_int_3 == 0) && (length_4 == 0) [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (((to_int_3 == 0) && (length_4 == 0)) && (result_6 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (((to_int_3 == 0) && (length_4 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((to_int_3 == 0) && (length_4 == 0)) && (to_int_5 == 0) [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_3 == 0 [2024-01-29 22:57:02,234 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_2 == 0 [2024-01-29 22:57:02,235 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (to_int_3 == 0) [2024-01-29 22:57:02,235 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (to_int_5 == 0) [2024-01-29 22:57:02,235 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (length_4 == 0) [2024-01-29 22:57:02,235 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (result_7 == 0) [2024-01-29 22:57:02,236 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (result_6 == 0) [2024-01-29 22:57:02,236 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (result_8 == 0) [2024-01-29 22:57:02,237 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,237 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (to_int_5 == 0) && (result_6 == 0) [2024-01-29 22:57:02,237 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] to_int_5 == 0 [2024-01-29 22:57:02,237 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,237 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_5 == 0) && (result_6 == 0) [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_5 == 0 [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((to_int_5 == 0) && (result_6 == 0)) && (result_8 == 0) [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (1 <= b) && (b != 0) [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] 1 <= b [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:57:02,238 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_8 == 0) [2024-01-29 22:57:02,239 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b <= -1 [2024-01-29 22:57:02,239 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (b <= -1) && (b != 0) [2024-01-29 22:57:02,265 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:02,379 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/chl-simpl-str-trans.wvr.c[2553,2566] [2024-01-29 22:57:02,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:02,390 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:02,399 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:02,449 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/chl-simpl-str-trans.wvr.c[2553,2566] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:02,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:02,463 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:02,464 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02 WrapperNode [2024-01-29 22:57:02,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:02,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:02,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:02,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:02,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,537 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 228 [2024-01-29 22:57:02,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:02,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:02,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:02,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:02,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,579 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 22:57:02,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:02,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:02,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:02,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:02,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (1/1) ... [2024-01-29 22:57:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:02,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:02,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:57:02,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:02,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:02,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:02,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:57:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:57:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:02,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:57:02,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:02,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:57:02,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:02,679 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:57:02,791 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:02,794 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:03,177 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:03,178 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:03,337 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:03,337 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:57:03,337 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:03 BoogieIcfgContainer [2024-01-29 22:57:03,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:03,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:03,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:03,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:03,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:57:02" (1/4) ... [2024-01-29 22:57:03,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18216685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:03, skipping insertion in model container [2024-01-29 22:57:03,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:02" (2/4) ... [2024-01-29 22:57:03,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18216685 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:03, skipping insertion in model container [2024-01-29 22:57:03,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:02" (3/4) ... [2024-01-29 22:57:03,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18216685 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:03, skipping insertion in model container [2024-01-29 22:57:03,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:03" (4/4) ... [2024-01-29 22:57:03,353 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2024-01-29 22:57:03,365 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:03,366 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 22:57:03,366 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:03,448 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:57:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 22:57:03,539 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2024-01-29 22:57:03,540 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:03,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 6/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2024-01-29 22:57:03,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 22:57:03,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 316 flow [2024-01-29 22:57:03,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:03,574 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;@1b94597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:03,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-01-29 22:57:03,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:03,576 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:03,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:03,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:03,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:03,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 20124, now seen corresponding path program 1 times [2024-01-29 22:57:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465312227] [2024-01-29 22:57:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:03,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465312227] [2024-01-29 22:57:03,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465312227] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577358761] [2024-01-29 22:57:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2024-01-29 22:57:03,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2024-01-29 22:57:03,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,467 INFO L124 PetriNetUnfolderBase]: 2848/5053 cut-off events. [2024-01-29 22:57:04,468 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-01-29 22:57:04,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9140 conditions, 5053 events. 2848/5053 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36626 event pairs, 2305 based on Foata normal form. 1/4048 useless extension candidates. Maximal degree in co-relation 8231. Up to 3886 conditions per place. [2024-01-29 22:57:04,503 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 45 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-01-29 22:57:04,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 404 flow [2024-01-29 22:57:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:04,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:04,524 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 316 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:04,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 404 flow [2024-01-29 22:57:04,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 392 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 22:57:04,534 INFO L231 Difference]: Finished difference. Result has 146 places, 146 transitions, 302 flow [2024-01-29 22:57:04,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=146, PETRI_TRANSITIONS=146} [2024-01-29 22:57:04,538 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -7 predicate places. [2024-01-29 22:57:04,538 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 146 transitions, 302 flow [2024-01-29 22:57:04,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:04,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:57:04,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:04,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:04,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 624463, now seen corresponding path program 1 times [2024-01-29 22:57:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514687426] [2024-01-29 22:57:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514687426] [2024-01-29 22:57:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514687426] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180499726] [2024-01-29 22:57:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:04,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:04,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:05,122 INFO L124 PetriNetUnfolderBase]: 2848/5052 cut-off events. [2024-01-29 22:57:05,122 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 22:57:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9008 conditions, 5052 events. 2848/5052 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36565 event pairs, 2305 based on Foata normal form. 0/4046 useless extension candidates. Maximal degree in co-relation 8985. Up to 3885 conditions per place. [2024-01-29 22:57:05,146 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 22:57:05,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 392 flow [2024-01-29 22:57:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:05,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:05,148 INFO L175 Difference]: Start difference. First operand has 146 places, 146 transitions, 302 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:05,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 392 flow [2024-01-29 22:57:05,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:05,151 INFO L231 Difference]: Finished difference. Result has 145 places, 145 transitions, 300 flow [2024-01-29 22:57:05,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=145, PETRI_TRANSITIONS=145} [2024-01-29 22:57:05,152 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -8 predicate places. [2024-01-29 22:57:05,152 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 145 transitions, 300 flow [2024-01-29 22:57:05,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:05,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:05,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:57:05,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:05,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:05,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash 19359081, now seen corresponding path program 1 times [2024-01-29 22:57:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834176924] [2024-01-29 22:57:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834176924] [2024-01-29 22:57:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834176924] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643565310] [2024-01-29 22:57:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:05,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:05,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:05,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:05,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:05,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:05,703 INFO L124 PetriNetUnfolderBase]: 3281/5933 cut-off events. [2024-01-29 22:57:05,703 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-01-29 22:57:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10440 conditions, 5933 events. 3281/5933 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 43903 event pairs, 2653 based on Foata normal form. 0/4528 useless extension candidates. Maximal degree in co-relation 10418. Up to 4428 conditions per place. [2024-01-29 22:57:05,730 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-29 22:57:05,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 390 flow [2024-01-29 22:57:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-01-29 22:57:05,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7821350762527233 [2024-01-29 22:57:05,731 INFO L175 Difference]: Start difference. First operand has 145 places, 145 transitions, 300 flow. Second operand 3 states and 359 transitions. [2024-01-29 22:57:05,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 390 flow [2024-01-29 22:57:05,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 144 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:05,734 INFO L231 Difference]: Finished difference. Result has 144 places, 144 transitions, 298 flow [2024-01-29 22:57:05,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=144} [2024-01-29 22:57:05,734 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -9 predicate places. [2024-01-29 22:57:05,735 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 144 transitions, 298 flow [2024-01-29 22:57:05,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:05,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:05,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:05,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:05,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:05,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 600132250, now seen corresponding path program 1 times [2024-01-29 22:57:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830818019] [2024-01-29 22:57:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830818019] [2024-01-29 22:57:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830818019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723706353] [2024-01-29 22:57:05,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:05,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:05,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:05,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:05,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:05,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:05,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:05,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,279 INFO L124 PetriNetUnfolderBase]: 2848/5050 cut-off events. [2024-01-29 22:57:06,280 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 22:57:06,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9005 conditions, 5050 events. 2848/5050 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36592 event pairs, 2305 based on Foata normal form. 0/4045 useless extension candidates. Maximal degree in co-relation 8984. Up to 3884 conditions per place. [2024-01-29 22:57:06,295 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-01-29 22:57:06,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 143 transitions, 386 flow [2024-01-29 22:57:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:06,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:06,297 INFO L175 Difference]: Start difference. First operand has 144 places, 144 transitions, 298 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:06,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 143 transitions, 386 flow [2024-01-29 22:57:06,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:06,299 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 296 flow [2024-01-29 22:57:06,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2024-01-29 22:57:06,300 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -10 predicate places. [2024-01-29 22:57:06,300 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 296 flow [2024-01-29 22:57:06,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:06,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:06,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:06,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1201494048, now seen corresponding path program 1 times [2024-01-29 22:57:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471828417] [2024-01-29 22:57:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471828417] [2024-01-29 22:57:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471828417] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433441231] [2024-01-29 22:57:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:06,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,736 INFO L124 PetriNetUnfolderBase]: 2848/5049 cut-off events. [2024-01-29 22:57:06,737 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 22:57:06,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9004 conditions, 5049 events. 2848/5049 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36595 event pairs, 2305 based on Foata normal form. 0/4045 useless extension candidates. Maximal degree in co-relation 8984. Up to 3884 conditions per place. [2024-01-29 22:57:06,752 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2024-01-29 22:57:06,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 384 flow [2024-01-29 22:57:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:06,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:06,754 INFO L175 Difference]: Start difference. First operand has 143 places, 143 transitions, 296 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 384 flow [2024-01-29 22:57:06,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:06,756 INFO L231 Difference]: Finished difference. Result has 142 places, 142 transitions, 294 flow [2024-01-29 22:57:06,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2024-01-29 22:57:06,758 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2024-01-29 22:57:06,758 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 294 flow [2024-01-29 22:57:06,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:06,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:06,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1408389541, now seen corresponding path program 1 times [2024-01-29 22:57:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107808567] [2024-01-29 22:57:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107808567] [2024-01-29 22:57:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107808567] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133465541] [2024-01-29 22:57:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:06,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:06,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,165 INFO L124 PetriNetUnfolderBase]: 2848/5048 cut-off events. [2024-01-29 22:57:07,165 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 22:57:07,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9003 conditions, 5048 events. 2848/5048 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36627 event pairs, 2305 based on Foata normal form. 0/4045 useless extension candidates. Maximal degree in co-relation 8984. Up to 3884 conditions per place. [2024-01-29 22:57:07,181 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2024-01-29 22:57:07,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 141 transitions, 382 flow [2024-01-29 22:57:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:07,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:07,183 INFO L175 Difference]: Start difference. First operand has 142 places, 142 transitions, 294 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:07,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 141 transitions, 382 flow [2024-01-29 22:57:07,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 141 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,185 INFO L231 Difference]: Finished difference. Result has 141 places, 141 transitions, 292 flow [2024-01-29 22:57:07,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=141, PETRI_TRANSITIONS=141} [2024-01-29 22:57:07,186 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -12 predicate places. [2024-01-29 22:57:07,186 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 141 transitions, 292 flow [2024-01-29 22:57:07,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:07,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:07,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash -710402159, now seen corresponding path program 1 times [2024-01-29 22:57:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094195262] [2024-01-29 22:57:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094195262] [2024-01-29 22:57:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094195262] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823244348] [2024-01-29 22:57:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:07,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:07,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,529 INFO L124 PetriNetUnfolderBase]: 2848/5047 cut-off events. [2024-01-29 22:57:07,529 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-29 22:57:07,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9003 conditions, 5047 events. 2848/5047 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36630 event pairs, 2305 based on Foata normal form. 0/4044 useless extension candidates. Maximal degree in co-relation 8985. Up to 3885 conditions per place. [2024-01-29 22:57:07,552 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-01-29 22:57:07,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 382 flow [2024-01-29 22:57:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:07,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:07,554 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 292 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:07,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 382 flow [2024-01-29 22:57:07,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,556 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 290 flow [2024-01-29 22:57:07,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2024-01-29 22:57:07,557 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -13 predicate places. [2024-01-29 22:57:07,557 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 290 flow [2024-01-29 22:57:07,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:07,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:07,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 203348636, now seen corresponding path program 1 times [2024-01-29 22:57:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83990204] [2024-01-29 22:57:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83990204] [2024-01-29 22:57:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83990204] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958069936] [2024-01-29 22:57:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:07,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:07,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,942 INFO L124 PetriNetUnfolderBase]: 2505/4237 cut-off events. [2024-01-29 22:57:07,942 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:07,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 4237 events. 2505/4237 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29152 event pairs, 2051 based on Foata normal form. 2/3318 useless extension candidates. Maximal degree in co-relation 7776. Up to 3485 conditions per place. [2024-01-29 22:57:07,964 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2024-01-29 22:57:07,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 376 flow [2024-01-29 22:57:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:07,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:07,966 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 290 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:07,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 376 flow [2024-01-29 22:57:07,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,968 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 284 flow [2024-01-29 22:57:07,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-01-29 22:57:07,969 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -16 predicate places. [2024-01-29 22:57:07,969 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 284 flow [2024-01-29 22:57:07,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:07,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:07,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2008841074, now seen corresponding path program 1 times [2024-01-29 22:57:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516272419] [2024-01-29 22:57:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516272419] [2024-01-29 22:57:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516272419] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738451438] [2024-01-29 22:57:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:08,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:08,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:08,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:08,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:08,340 INFO L124 PetriNetUnfolderBase]: 2505/4236 cut-off events. [2024-01-29 22:57:08,340 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:08,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 4236 events. 2505/4236 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29188 event pairs, 2051 based on Foata normal form. 0/3316 useless extension candidates. Maximal degree in co-relation 7761. Up to 3485 conditions per place. [2024-01-29 22:57:08,361 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-29 22:57:08,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 374 flow [2024-01-29 22:57:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:08,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:08,363 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 284 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:08,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 136 transitions, 374 flow [2024-01-29 22:57:08,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:08,365 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 282 flow [2024-01-29 22:57:08,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=136, PETRI_TRANSITIONS=136} [2024-01-29 22:57:08,366 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -17 predicate places. [2024-01-29 22:57:08,366 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 282 flow [2024-01-29 22:57:08,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:08,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:08,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:08,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:57:08,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:08,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2055976629, now seen corresponding path program 1 times [2024-01-29 22:57:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451249523] [2024-01-29 22:57:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:08,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451249523] [2024-01-29 22:57:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451249523] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:08,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:08,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488331998] [2024-01-29 22:57:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:08,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:08,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2024-01-29 22:57:08,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:08,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:08,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2024-01-29 22:57:08,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:08,778 INFO L124 PetriNetUnfolderBase]: 2505/4232 cut-off events. [2024-01-29 22:57:08,778 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:08,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7797 conditions, 4232 events. 2505/4232 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29206 event pairs, 2051 based on Foata normal form. 3/3323 useless extension candidates. Maximal degree in co-relation 7770. Up to 3494 conditions per place. [2024-01-29 22:57:08,798 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 53 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-01-29 22:57:08,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 384 flow [2024-01-29 22:57:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-01-29 22:57:08,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7233115468409586 [2024-01-29 22:57:08,800 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 282 flow. Second operand 3 states and 332 transitions. [2024-01-29 22:57:08,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 384 flow [2024-01-29 22:57:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:08,802 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 274 flow [2024-01-29 22:57:08,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2024-01-29 22:57:08,802 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -21 predicate places. [2024-01-29 22:57:08,803 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 274 flow [2024-01-29 22:57:08,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:08,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:08,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:08,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:57:08,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:08,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1381239294, now seen corresponding path program 1 times [2024-01-29 22:57:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037155954] [2024-01-29 22:57:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037155954] [2024-01-29 22:57:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037155954] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443134170] [2024-01-29 22:57:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:08,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:08,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:08,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:08,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:08,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:08,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:08,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,145 INFO L124 PetriNetUnfolderBase]: 2505/4230 cut-off events. [2024-01-29 22:57:09,145 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:09,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7784 conditions, 4230 events. 2505/4230 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29072 event pairs, 2051 based on Foata normal form. 0/3313 useless extension candidates. Maximal degree in co-relation 7757. Up to 3481 conditions per place. [2024-01-29 22:57:09,165 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-29 22:57:09,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 358 flow [2024-01-29 22:57:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-01-29 22:57:09,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7930283224400871 [2024-01-29 22:57:09,167 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 274 flow. Second operand 3 states and 364 transitions. [2024-01-29 22:57:09,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 358 flow [2024-01-29 22:57:09,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:09,169 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 270 flow [2024-01-29 22:57:09,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2024-01-29 22:57:09,170 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2024-01-29 22:57:09,170 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 270 flow [2024-01-29 22:57:09,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,171 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] [2024-01-29 22:57:09,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:57:09,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -131254184, now seen corresponding path program 1 times [2024-01-29 22:57:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752108612] [2024-01-29 22:57:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752108612] [2024-01-29 22:57:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752108612] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871226809] [2024-01-29 22:57:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:09,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:09,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,520 INFO L124 PetriNetUnfolderBase]: 2505/4229 cut-off events. [2024-01-29 22:57:09,520 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:09,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7785 conditions, 4229 events. 2505/4229 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29086 event pairs, 2051 based on Foata normal form. 0/3312 useless extension candidates. Maximal degree in co-relation 7744. Up to 3482 conditions per place. [2024-01-29 22:57:09,536 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2024-01-29 22:57:09,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 360 flow [2024-01-29 22:57:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-01-29 22:57:09,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7821350762527233 [2024-01-29 22:57:09,538 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 270 flow. Second operand 3 states and 359 transitions. [2024-01-29 22:57:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 360 flow [2024-01-29 22:57:09,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:09,539 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 268 flow [2024-01-29 22:57:09,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2024-01-29 22:57:09,540 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -24 predicate places. [2024-01-29 22:57:09,540 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 268 flow [2024-01-29 22:57:09,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,541 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] [2024-01-29 22:57:09,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:57:09,541 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 226088233, now seen corresponding path program 1 times [2024-01-29 22:57:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520074884] [2024-01-29 22:57:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520074884] [2024-01-29 22:57:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520074884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989810191] [2024-01-29 22:57:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:09,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:09,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,845 INFO L124 PetriNetUnfolderBase]: 2505/4228 cut-off events. [2024-01-29 22:57:09,846 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:09,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 4228 events. 2505/4228 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29049 event pairs, 2051 based on Foata normal form. 0/3313 useless extension candidates. Maximal degree in co-relation 7743. Up to 3481 conditions per place. [2024-01-29 22:57:09,862 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-01-29 22:57:09,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 128 transitions, 354 flow [2024-01-29 22:57:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:09,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:09,864 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 268 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:09,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 128 transitions, 354 flow [2024-01-29 22:57:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:09,866 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 266 flow [2024-01-29 22:57:09,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=128, PETRI_TRANSITIONS=128} [2024-01-29 22:57:09,866 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -25 predicate places. [2024-01-29 22:57:09,866 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 266 flow [2024-01-29 22:57:09,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,867 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] [2024-01-29 22:57:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:57:09,867 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1581198660, now seen corresponding path program 1 times [2024-01-29 22:57:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289254863] [2024-01-29 22:57:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289254863] [2024-01-29 22:57:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289254863] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928504023] [2024-01-29 22:57:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:09,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:09,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:09,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,145 INFO L124 PetriNetUnfolderBase]: 2505/4227 cut-off events. [2024-01-29 22:57:10,146 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 4227 events. 2505/4227 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29099 event pairs, 2051 based on Foata normal form. 0/3314 useless extension candidates. Maximal degree in co-relation 7744. Up to 3482 conditions per place. [2024-01-29 22:57:10,163 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-01-29 22:57:10,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 354 flow [2024-01-29 22:57:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:10,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:10,164 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 266 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 354 flow [2024-01-29 22:57:10,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,166 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 264 flow [2024-01-29 22:57:10,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2024-01-29 22:57:10,167 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -26 predicate places. [2024-01-29 22:57:10,167 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 264 flow [2024-01-29 22:57:10,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,168 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:57:10,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:57:10,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1772517489, now seen corresponding path program 1 times [2024-01-29 22:57:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455768137] [2024-01-29 22:57:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455768137] [2024-01-29 22:57:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455768137] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368963620] [2024-01-29 22:57:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:10,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:10,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,465 INFO L124 PetriNetUnfolderBase]: 2505/4226 cut-off events. [2024-01-29 22:57:10,465 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:10,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7783 conditions, 4226 events. 2505/4226 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29109 event pairs, 2051 based on Foata normal form. 0/3314 useless extension candidates. Maximal degree in co-relation 7744. Up to 3482 conditions per place. [2024-01-29 22:57:10,484 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 45 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-01-29 22:57:10,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 356 flow [2024-01-29 22:57:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2024-01-29 22:57:10,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-01-29 22:57:10,486 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 264 flow. Second operand 3 states and 357 transitions. [2024-01-29 22:57:10,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 356 flow [2024-01-29 22:57:10,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,488 INFO L231 Difference]: Finished difference. Result has 126 places, 126 transitions, 262 flow [2024-01-29 22:57:10,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=126, PETRI_TRANSITIONS=126} [2024-01-29 22:57:10,490 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -27 predicate places. [2024-01-29 22:57:10,490 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 126 transitions, 262 flow [2024-01-29 22:57:10,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,491 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] [2024-01-29 22:57:10,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:57:10,491 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 886533339, now seen corresponding path program 1 times [2024-01-29 22:57:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475755655] [2024-01-29 22:57:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475755655] [2024-01-29 22:57:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475755655] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060621899] [2024-01-29 22:57:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:10,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:10,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,774 INFO L124 PetriNetUnfolderBase]: 2505/4225 cut-off events. [2024-01-29 22:57:10,775 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-29 22:57:10,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 4225 events. 2505/4225 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29059 event pairs, 2051 based on Foata normal form. 0/3314 useless extension candidates. Maximal degree in co-relation 7744. Up to 3482 conditions per place. [2024-01-29 22:57:10,823 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-01-29 22:57:10,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 350 flow [2024-01-29 22:57:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:10,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:10,824 INFO L175 Difference]: Start difference. First operand has 126 places, 126 transitions, 262 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:10,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 350 flow [2024-01-29 22:57:10,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,825 INFO L231 Difference]: Finished difference. Result has 125 places, 125 transitions, 260 flow [2024-01-29 22:57:10,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=125, PETRI_TRANSITIONS=125} [2024-01-29 22:57:10,826 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -28 predicate places. [2024-01-29 22:57:10,826 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 125 transitions, 260 flow [2024-01-29 22:57:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,826 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] [2024-01-29 22:57:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:57:10,826 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1555034700, now seen corresponding path program 1 times [2024-01-29 22:57:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247216490] [2024-01-29 22:57:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247216490] [2024-01-29 22:57:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247216490] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611323656] [2024-01-29 22:57:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2024-01-29 22:57:10,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 125 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:10,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2024-01-29 22:57:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,094 INFO L124 PetriNetUnfolderBase]: 2172/3592 cut-off events. [2024-01-29 22:57:11,094 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-29 22:57:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 3592 events. 2172/3592 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23954 event pairs, 1782 based on Foata normal form. 0/2982 useless extension candidates. Maximal degree in co-relation 6681. Up to 3053 conditions per place. [2024-01-29 22:57:11,107 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 51 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-01-29 22:57:11,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 364 flow [2024-01-29 22:57:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2024-01-29 22:57:11,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7581699346405228 [2024-01-29 22:57:11,110 INFO L175 Difference]: Start difference. First operand has 125 places, 125 transitions, 260 flow. Second operand 3 states and 348 transitions. [2024-01-29 22:57:11,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 364 flow [2024-01-29 22:57:11,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,112 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 258 flow [2024-01-29 22:57:11,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2024-01-29 22:57:11,112 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -29 predicate places. [2024-01-29 22:57:11,113 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 258 flow [2024-01-29 22:57:11,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,113 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:57:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:57:11,113 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 961436146, now seen corresponding path program 1 times [2024-01-29 22:57:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315207133] [2024-01-29 22:57:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315207133] [2024-01-29 22:57:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315207133] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669197196] [2024-01-29 22:57:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:11,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:11,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,396 INFO L124 PetriNetUnfolderBase]: 2172/3590 cut-off events. [2024-01-29 22:57:11,396 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:11,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6712 conditions, 3590 events. 2172/3590 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23991 event pairs, 1782 based on Foata normal form. 1/2982 useless extension candidates. Maximal degree in co-relation 6667. Up to 3056 conditions per place. [2024-01-29 22:57:11,410 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2024-01-29 22:57:11,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 344 flow [2024-01-29 22:57:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-01-29 22:57:11,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7821350762527233 [2024-01-29 22:57:11,412 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 258 flow. Second operand 3 states and 359 transitions. [2024-01-29 22:57:11,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 344 flow [2024-01-29 22:57:11,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,414 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 254 flow [2024-01-29 22:57:11,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2024-01-29 22:57:11,414 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -31 predicate places. [2024-01-29 22:57:11,415 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 254 flow [2024-01-29 22:57:11,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,415 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] [2024-01-29 22:57:11,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:57:11,415 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -260249939, now seen corresponding path program 1 times [2024-01-29 22:57:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478997597] [2024-01-29 22:57:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478997597] [2024-01-29 22:57:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478997597] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022299870] [2024-01-29 22:57:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:11,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:11,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,689 INFO L124 PetriNetUnfolderBase]: 2172/3588 cut-off events. [2024-01-29 22:57:11,689 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:11,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6710 conditions, 3588 events. 2172/3588 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23973 event pairs, 1782 based on Foata normal form. 1/2979 useless extension candidates. Maximal degree in co-relation 6667. Up to 3056 conditions per place. [2024-01-29 22:57:11,703 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-01-29 22:57:11,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 340 flow [2024-01-29 22:57:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:11,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:11,704 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 254 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:11,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 340 flow [2024-01-29 22:57:11,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,706 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 250 flow [2024-01-29 22:57:11,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2024-01-29 22:57:11,706 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -33 predicate places. [2024-01-29 22:57:11,706 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 250 flow [2024-01-29 22:57:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:57:11,707 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 522187169, now seen corresponding path program 1 times [2024-01-29 22:57:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256821298] [2024-01-29 22:57:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256821298] [2024-01-29 22:57:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256821298] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688226927] [2024-01-29 22:57:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:11,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:11,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:11,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,998 INFO L124 PetriNetUnfolderBase]: 2172/3587 cut-off events. [2024-01-29 22:57:11,998 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:12,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 3587 events. 2172/3587 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23932 event pairs, 1782 based on Foata normal form. 0/2978 useless extension candidates. Maximal degree in co-relation 6667. Up to 3056 conditions per place. [2024-01-29 22:57:12,011 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-01-29 22:57:12,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 338 flow [2024-01-29 22:57:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2024-01-29 22:57:12,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7734204793028322 [2024-01-29 22:57:12,012 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 250 flow. Second operand 3 states and 355 transitions. [2024-01-29 22:57:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 338 flow [2024-01-29 22:57:12,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,014 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 248 flow [2024-01-29 22:57:12,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2024-01-29 22:57:12,015 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -34 predicate places. [2024-01-29 22:57:12,015 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 248 flow [2024-01-29 22:57:12,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,015 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] [2024-01-29 22:57:12,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:57:12,015 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 107049915, now seen corresponding path program 1 times [2024-01-29 22:57:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129990016] [2024-01-29 22:57:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129990016] [2024-01-29 22:57:12,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129990016] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535602267] [2024-01-29 22:57:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 153 [2024-01-29 22:57:12,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 153 [2024-01-29 22:57:12,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,368 INFO L124 PetriNetUnfolderBase]: 3353/5638 cut-off events. [2024-01-29 22:57:12,368 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-29 22:57:12,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10457 conditions, 5638 events. 3353/5638 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 40545 event pairs, 1782 based on Foata normal form. 0/4964 useless extension candidates. Maximal degree in co-relation 10409. Up to 2812 conditions per place. [2024-01-29 22:57:12,387 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 76 selfloop transitions, 4 changer transitions 0/146 dead transitions. [2024-01-29 22:57:12,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 146 transitions, 466 flow [2024-01-29 22:57:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-01-29 22:57:12,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8278867102396514 [2024-01-29 22:57:12,388 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 248 flow. Second operand 3 states and 380 transitions. [2024-01-29 22:57:12,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 146 transitions, 466 flow [2024-01-29 22:57:12,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 146 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,390 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 270 flow [2024-01-29 22:57:12,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2024-01-29 22:57:12,391 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -33 predicate places. [2024-01-29 22:57:12,391 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 270 flow [2024-01-29 22:57:12,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:12,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:57:12,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash -976419231, now seen corresponding path program 1 times [2024-01-29 22:57:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897097248] [2024-01-29 22:57:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897097248] [2024-01-29 22:57:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897097248] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968142516] [2024-01-29 22:57:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:12,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:12,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,767 INFO L124 PetriNetUnfolderBase]: 3405/5566 cut-off events. [2024-01-29 22:57:12,767 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2024-01-29 22:57:12,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11341 conditions, 5566 events. 3405/5566 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 39492 event pairs, 2883 based on Foata normal form. 2/4986 useless extension candidates. Maximal degree in co-relation 6414. Up to 4866 conditions per place. [2024-01-29 22:57:12,790 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-01-29 22:57:12,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 354 flow [2024-01-29 22:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:12,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:12,791 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 270 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:12,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 354 flow [2024-01-29 22:57:12,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,797 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 260 flow [2024-01-29 22:57:12,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-01-29 22:57:12,798 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -36 predicate places. [2024-01-29 22:57:12,798 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 260 flow [2024-01-29 22:57:12,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:12,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:57:12,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -204224412, now seen corresponding path program 1 times [2024-01-29 22:57:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806613944] [2024-01-29 22:57:12,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:12,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806613944] [2024-01-29 22:57:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806613944] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63283353] [2024-01-29 22:57:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:12,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:12,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:12,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:13,154 INFO L124 PetriNetUnfolderBase]: 3405/5565 cut-off events. [2024-01-29 22:57:13,155 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-01-29 22:57:13,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 5565 events. 3405/5565 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 39514 event pairs, 2883 based on Foata normal form. 0/4809 useless extension candidates. Maximal degree in co-relation 11051. Up to 4868 conditions per place. [2024-01-29 22:57:13,177 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 45 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-01-29 22:57:13,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 352 flow [2024-01-29 22:57:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:13,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:13,178 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 260 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:13,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 352 flow [2024-01-29 22:57:13,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:13,179 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 258 flow [2024-01-29 22:57:13,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2024-01-29 22:57:13,180 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -37 predicate places. [2024-01-29 22:57:13,180 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 258 flow [2024-01-29 22:57:13,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:13,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:13,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:57:13,180 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1919809462, now seen corresponding path program 1 times [2024-01-29 22:57:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597680873] [2024-01-29 22:57:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597680873] [2024-01-29 22:57:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597680873] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:13,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960396776] [2024-01-29 22:57:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:13,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:13,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2024-01-29 22:57:13,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:13,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:13,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2024-01-29 22:57:13,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:13,599 INFO L124 PetriNetUnfolderBase]: 3405/5561 cut-off events. [2024-01-29 22:57:13,599 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-01-29 22:57:13,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11099 conditions, 5561 events. 3405/5561 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 39416 event pairs, 2883 based on Foata normal form. 2/4810 useless extension candidates. Maximal degree in co-relation 11048. Up to 4867 conditions per place. [2024-01-29 22:57:13,617 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 46 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-01-29 22:57:13,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 346 flow [2024-01-29 22:57:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:13,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:13,619 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 258 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:13,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 346 flow [2024-01-29 22:57:13,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:13,620 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 250 flow [2024-01-29 22:57:13,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2024-01-29 22:57:13,621 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -41 predicate places. [2024-01-29 22:57:13,621 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 250 flow [2024-01-29 22:57:13,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:13,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:13,621 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] [2024-01-29 22:57:13,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:57:13,622 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:13,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash 402035166, now seen corresponding path program 1 times [2024-01-29 22:57:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466209880] [2024-01-29 22:57:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466209880] [2024-01-29 22:57:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466209880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:13,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244771622] [2024-01-29 22:57:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:13,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:13,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:13,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:13,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:13,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:13,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:14,057 INFO L124 PetriNetUnfolderBase]: 3399/5641 cut-off events. [2024-01-29 22:57:14,057 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2024-01-29 22:57:14,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11178 conditions, 5641 events. 3399/5641 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 41088 event pairs, 1331 based on Foata normal form. 0/4956 useless extension candidates. Maximal degree in co-relation 11120. Up to 2771 conditions per place. [2024-01-29 22:57:14,081 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 70 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2024-01-29 22:57:14,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 458 flow [2024-01-29 22:57:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2024-01-29 22:57:14,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.840958605664488 [2024-01-29 22:57:14,082 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 250 flow. Second operand 3 states and 386 transitions. [2024-01-29 22:57:14,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 458 flow [2024-01-29 22:57:14,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 136 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:14,084 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 259 flow [2024-01-29 22:57:14,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2024-01-29 22:57:14,084 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -42 predicate places. [2024-01-29 22:57:14,084 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 259 flow [2024-01-29 22:57:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:14,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:14,085 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] [2024-01-29 22:57:14,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:57:14,085 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:14,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -421811074, now seen corresponding path program 1 times [2024-01-29 22:57:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812266500] [2024-01-29 22:57:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812266500] [2024-01-29 22:57:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812266500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479733457] [2024-01-29 22:57:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:14,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:14,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:14,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:14,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:14,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:14,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:14,531 INFO L124 PetriNetUnfolderBase]: 3399/5675 cut-off events. [2024-01-29 22:57:14,531 INFO L125 PetriNetUnfolderBase]: For 764/777 co-relation queries the response was YES. [2024-01-29 22:57:14,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11950 conditions, 5675 events. 3399/5675 cut-off events. For 764/777 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 41388 event pairs, 1395 based on Foata normal form. 7/5031 useless extension candidates. Maximal degree in co-relation 5041. Up to 2901 conditions per place. [2024-01-29 22:57:14,557 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 72 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2024-01-29 22:57:14,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 138 transitions, 485 flow [2024-01-29 22:57:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-01-29 22:57:14,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8387799564270153 [2024-01-29 22:57:14,559 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 259 flow. Second operand 3 states and 385 transitions. [2024-01-29 22:57:14,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 138 transitions, 485 flow [2024-01-29 22:57:14,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 138 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:14,561 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 282 flow [2024-01-29 22:57:14,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2024-01-29 22:57:14,561 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -41 predicate places. [2024-01-29 22:57:14,561 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 282 flow [2024-01-29 22:57:14,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:14,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:14,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:14,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:57:14,567 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:14,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -169595958, now seen corresponding path program 1 times [2024-01-29 22:57:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378601479] [2024-01-29 22:57:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:14,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:14,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:14,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:14,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-01-29 22:57:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-01-29 22:57:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-01-29 22:57:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-01-29 22:57:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-01-29 22:57:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-01-29 22:57:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-01-29 22:57:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-01-29 22:57:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-01-29 22:57:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-01-29 22:57:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-01-29 22:57:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 76 remaining) [2024-01-29 22:57:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-01-29 22:57:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-01-29 22:57:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-01-29 22:57:14,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-01-29 22:57:14,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-01-29 22:57:14,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-01-29 22:57:14,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-01-29 22:57:14,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-01-29 22:57:14,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-01-29 22:57:14,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:57:14,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:14,619 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:14,619 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:14,664 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-29 22:57:14,664 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-29 22:57:14,665 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:14 BasicIcfg [2024-01-29 22:57:14,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:14,665 INFO L158 Benchmark]: Toolchain (without parser) took 12465.59ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 119.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 836.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,666 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:14,666 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:14,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.59ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 100.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.47ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,666 INFO L158 Benchmark]: Boogie Preprocessor took 73.13ms. Allocated memory is still 155.2MB. Free memory was 98.2MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,667 INFO L158 Benchmark]: RCFGBuilder took 725.73ms. Allocated memory is still 155.2MB. Free memory was 95.5MB in the beginning and 86.9MB in the end (delta: 8.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,667 INFO L158 Benchmark]: TraceAbstraction took 11326.17ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 86.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 804.8MB. Max. memory is 16.1GB. [2024-01-29 22:57:14,668 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.59ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 100.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.47ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.13ms. Allocated memory is still 155.2MB. Free memory was 98.2MB in the beginning and 95.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 725.73ms. Allocated memory is still 155.2MB. Free memory was 95.5MB in the beginning and 86.9MB in the end (delta: 8.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11326.17ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 86.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 804.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L86] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 199 locations, 76 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3209 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4260 IncrementalHoareTripleChecker+Invalid, 4445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 223 mSDtfsCounter, 4260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=0, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 4531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:57:14,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE