./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.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-subst.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-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:58,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:58,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:58,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:58,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:58,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:58,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:58,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:58,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:58,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:58,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:58,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:58,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:58,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:58,311 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:58,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:58,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:58,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:58,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:58,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:58,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:58,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:58,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:58,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:58,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:58,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:58,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:58,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:58,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:58,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:58,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:58,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:58,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:58,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:58,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:58,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:58,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:58,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:58,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:58,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:58,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:58,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:58,549 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:58,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-29 22:56:59,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:59,769 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:59,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-29 22:56:59,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ea85be6/603376ce840a431f9a93582736cb18ae/FLAG06d2c6c7c [2024-01-29 22:56:59,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ea85be6/603376ce840a431f9a93582736cb18ae [2024-01-29 22:56:59,787 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:59,788 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:59,788 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-subst.wvr.yml/witness.yml [2024-01-29 22:56:59,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:59,872 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:59,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:59,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:59,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:59,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:59" (1/2) ... [2024-01-29 22:56:59,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b8752a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:59, skipping insertion in model container [2024-01-29 22:56:59,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:59" (1/2) ... [2024-01-29 22:56:59,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b361c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:59, skipping insertion in model container [2024-01-29 22:56:59,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:59" (2/2) ... [2024-01-29 22:56:59,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b8752a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:59, skipping insertion in model container [2024-01-29 22:56:59,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:59" (2/2) ... [2024-01-29 22:56:59,880 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:59,893 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:59,895 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-29 22:56:59,898 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_8 == 0) [2024-01-29 22:56:59,898 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:59,899 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (to_int_3 == 0) && (result_7 == 0) [2024-01-29 22:56:59,899 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_3 == 0 [2024-01-29 22:56:59,899 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (to_int_3 == 0) && (result_6 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((to_int_3 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (to_int_3 == 0) && (to_int_5 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (to_int_3 == 0) && (length_4 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (to_int_5 == 0) && (result_6 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((to_int_5 == 0) && (result_6 == 0)) && (result_8 == 0) [2024-01-29 22:56:59,900 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] to_int_5 == 0 [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_5 == 0 [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_5 == 0) && (result_6 == 0) [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_5 == 0) && (result_8 == 0) [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_5 == 0) && (result_7 == 0) [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] 1 <= b [2024-01-29 22:56:59,901 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (1 <= b) && (b != 0) [2024-01-29 22:56:59,902 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] length_4 == 0 [2024-01-29 22:56:59,902 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (length_4 == 0) && (result_7 == 0) [2024-01-29 22:56:59,902 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (length_4 == 0) && (result_6 == 0) [2024-01-29 22:56:59,902 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (length_4 == 0) && (result_8 == 0) [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (length_4 == 0) && (to_int_5 == 0) [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (length_2 == 0) && (to_int_3 == 0) [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_2 == 0 [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((length_2 == 0) && (to_int_3 == 0)) && (result_6 == 0) [2024-01-29 22:56:59,903 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((length_2 == 0) && (to_int_3 == 0)) && (result_8 == 0) [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((length_2 == 0) && (to_int_3 == 0)) && (result_7 == 0) [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((length_2 == 0) && (to_int_3 == 0)) && (to_int_5 == 0) [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((length_2 == 0) && (to_int_3 == 0)) && (length_4 == 0) [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_0 == 0 [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (to_int_5 == 0) [2024-01-29 22:56:59,904 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (length_4 == 0) [2024-01-29 22:56:59,905 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (result_6 == 0) [2024-01-29 22:56:59,905 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (result_7 == 0) [2024-01-29 22:56:59,905 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (result_8 == 0) [2024-01-29 22:56:59,906 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (length_2 == 0) [2024-01-29 22:56:59,906 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (to_int_1 == 0) [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (length_0 == 0) && (to_int_3 == 0) [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (b <= -1) && (b != 0) [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b <= -1 [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (to_int_1 == 0) && (to_int_5 == 0) [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_1 == 0 [2024-01-29 22:56:59,907 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (to_int_5 == 0)) && (result_7 == 0) [2024-01-29 22:56:59,908 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (to_int_5 == 0)) && (result_6 == 0) [2024-01-29 22:56:59,908 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((to_int_1 == 0) && (to_int_5 == 0)) && (result_8 == 0) [2024-01-29 22:56:59,908 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (to_int_1 == 0) && (to_int_3 == 0) [2024-01-29 22:56:59,908 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (to_int_1 == 0) && (length_2 == 0) [2024-01-29 22:56:59,908 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (to_int_1 == 0) && (length_4 == 0) [2024-01-29 22:56:59,909 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-29 22:56:59,909 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 22:56:59,926 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:00,044 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-subst.wvr.c[2614,2627] [2024-01-29 22:57:00,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:00,062 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:00,071 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:00,113 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-subst.wvr.c[2614,2627] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:00,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:00,128 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:00,129 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:00 WrapperNode [2024-01-29 22:57:00,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:00,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:00,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:00,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:00,136 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:00" (1/1) ... [2024-01-29 22:57:00,142 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:00" (1/1) ... [2024-01-29 22:57:00,179 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 232 [2024-01-29 22:57:00,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:00,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:00,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:00,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:00,189 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:00" (1/1) ... [2024-01-29 22:57:00,189 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:00" (1/1) ... [2024-01-29 22:57:00,192 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:00" (1/1) ... [2024-01-29 22:57:00,203 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:00,204 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:00" (1/1) ... [2024-01-29 22:57:00,204 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:00" (1/1) ... [2024-01-29 22:57:00,210 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:00" (1/1) ... [2024-01-29 22:57:00,212 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:00" (1/1) ... [2024-01-29 22:57:00,213 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:00" (1/1) ... [2024-01-29 22:57:00,214 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:00" (1/1) ... [2024-01-29 22:57:00,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:00,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:00,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:00,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:00,218 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:00" (1/1) ... [2024-01-29 22:57:00,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:00,392 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:00,410 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:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:57:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:57:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:00,425 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:00,547 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:00,550 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:01,013 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:01,014 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:01,217 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:01,217 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:57:01,219 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:01 BoogieIcfgContainer [2024-01-29 22:57:01,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:01,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:01,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:01,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:01,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:59" (1/4) ... [2024-01-29 22:57:01,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ba308c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:59" (2/4) ... [2024-01-29 22:57:01,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ba308c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,226 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:00" (3/4) ... [2024-01-29 22:57:01,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ba308c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,227 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:01" (4/4) ... [2024-01-29 22:57:01,228 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-01-29 22:57:01,243 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:01,243 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 22:57:01,243 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:01,312 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:57:01,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 22:57:01,403 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2024-01-29 22:57:01,403 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:01,408 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 254 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:01,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 22:57:01,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 316 flow [2024-01-29 22:57:01,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:01,436 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;@62d2c9a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:01,437 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-01-29 22:57:01,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:01,440 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:01,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:01,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:01,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:01,442 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:01,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash 20640, now seen corresponding path program 1 times [2024-01-29 22:57:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:01,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372376512] [2024-01-29 22:57:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:01,604 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:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372376512] [2024-01-29 22:57:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372376512] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009370085] [2024-01-29 22:57:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:01,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:01,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:01,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 316 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:01,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:01,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:01,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:02,304 INFO L124 PetriNetUnfolderBase]: 2836/4839 cut-off events. [2024-01-29 22:57:02,304 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-01-29 22:57:02,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8983 conditions, 4839 events. 2836/4839 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 33290 event pairs, 2333 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 8084. Up to 3928 conditions per place. [2024-01-29 22:57:02,335 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-29 22:57:02,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 147 transitions, 402 flow [2024-01-29 22:57:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2024-01-29 22:57:02,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7886710239651417 [2024-01-29 22:57:02,347 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 316 flow. Second operand 3 states and 362 transitions. [2024-01-29 22:57:02,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 147 transitions, 402 flow [2024-01-29 22:57:02,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 390 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 22:57:02,359 INFO L231 Difference]: Finished difference. Result has 147 places, 147 transitions, 304 flow [2024-01-29 22:57:02,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=147, PETRI_TRANSITIONS=147} [2024-01-29 22:57:02,363 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2024-01-29 22:57:02,363 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 147 transitions, 304 flow [2024-01-29 22:57:02,364 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:02,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:02,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:57:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:02,364 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:02,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 640477, now seen corresponding path program 1 times [2024-01-29 22:57:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759220607] [2024-01-29 22:57:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:02,425 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:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759220607] [2024-01-29 22:57:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759220607] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:02,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:02,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442409833] [2024-01-29 22:57:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:02,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:02,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:02,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 147 transitions, 304 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:02,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:02,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:02,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:02,943 INFO L124 PetriNetUnfolderBase]: 2836/4838 cut-off events. [2024-01-29 22:57:02,943 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:02,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8845 conditions, 4838 events. 2836/4838 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 33333 event pairs, 2333 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 8821. Up to 3928 conditions per place. [2024-01-29 22:57:02,972 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2024-01-29 22:57:02,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 146 transitions, 392 flow [2024-01-29 22:57:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:02,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:02,978 INFO L175 Difference]: Start difference. First operand has 147 places, 147 transitions, 304 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:02,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 146 transitions, 392 flow [2024-01-29 22:57:02,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:02,982 INFO L231 Difference]: Finished difference. Result has 146 places, 146 transitions, 302 flow [2024-01-29 22:57:02,982 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:02,986 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -7 predicate places. [2024-01-29 22:57:02,986 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 146 transitions, 302 flow [2024-01-29 22:57:02,986 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:02,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:02,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:57:02,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:02,987 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:02,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash 19855533, now seen corresponding path program 1 times [2024-01-29 22:57:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506135092] [2024-01-29 22:57:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,017 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,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506135092] [2024-01-29 22:57:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506135092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405561447] [2024-01-29 22:57:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:03,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 146 transitions, 302 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:03,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:03,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,560 INFO L124 PetriNetUnfolderBase]: 3278/5913 cut-off events. [2024-01-29 22:57:03,560 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-01-29 22:57:03,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10420 conditions, 5913 events. 3278/5913 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43729 event pairs, 2653 based on Foata normal form. 0/4516 useless extension candidates. Maximal degree in co-relation 10397. Up to 4428 conditions per place. [2024-01-29 22:57:03,735 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 22:57:03,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 392 flow [2024-01-29 22:57:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2024-01-29 22:57:03,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7821350762527233 [2024-01-29 22:57:03,737 INFO L175 Difference]: Start difference. First operand has 146 places, 146 transitions, 302 flow. Second operand 3 states and 359 transitions. [2024-01-29 22:57:03,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 392 flow [2024-01-29 22:57:03,738 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:03,741 INFO L231 Difference]: Finished difference. Result has 145 places, 145 transitions, 300 flow [2024-01-29 22:57:03,742 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:03,742 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -8 predicate places. [2024-01-29 22:57:03,743 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 145 transitions, 300 flow [2024-01-29 22:57:03,743 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:03,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:03,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:03,743 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:03,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 615522282, now seen corresponding path program 1 times [2024-01-29 22:57:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569737294] [2024-01-29 22:57:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,768 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,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569737294] [2024-01-29 22:57:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569737294] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135105530] [2024-01-29 22:57:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:03,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 145 transitions, 300 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:03,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:03,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,129 INFO L124 PetriNetUnfolderBase]: 2836/4836 cut-off events. [2024-01-29 22:57:04,129 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:04,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4836 events. 2836/4836 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33318 event pairs, 2333 based on Foata normal form. 0/3645 useless extension candidates. Maximal degree in co-relation 8820. Up to 3927 conditions per place. [2024-01-29 22:57:04,150 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-29 22:57:04,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 386 flow [2024-01-29 22:57:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:04,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:04,152 INFO L175 Difference]: Start difference. First operand has 145 places, 145 transitions, 300 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:04,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 386 flow [2024-01-29 22:57:04,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 144 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,154 INFO L231 Difference]: Finished difference. Result has 144 places, 144 transitions, 298 flow [2024-01-29 22:57:04,154 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:04,155 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -9 predicate places. [2024-01-29 22:57:04,155 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 144 transitions, 298 flow [2024-01-29 22:57:04,155 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:04,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:04,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:04,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1901322181, now seen corresponding path program 1 times [2024-01-29 22:57:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457091373] [2024-01-29 22:57:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,179 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,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457091373] [2024-01-29 22:57:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457091373] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914752127] [2024-01-29 22:57:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:04,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 144 transitions, 298 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:04,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,682 INFO L124 PetriNetUnfolderBase]: 2836/4835 cut-off events. [2024-01-29 22:57:04,682 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 4835 events. 2836/4835 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33343 event pairs, 2333 based on Foata normal form. 0/3645 useless extension candidates. Maximal degree in co-relation 8820. Up to 3927 conditions per place. [2024-01-29 22:57:04,696 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-01-29 22:57:04,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 143 transitions, 384 flow [2024-01-29 22:57:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:04,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:04,698 INFO L175 Difference]: Start difference. First operand has 144 places, 144 transitions, 298 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:04,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 143 transitions, 384 flow [2024-01-29 22:57:04,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,700 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 296 flow [2024-01-29 22:57:04,700 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:04,701 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -10 predicate places. [2024-01-29 22:57:04,701 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 296 flow [2024-01-29 22:57:04,701 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:04,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:04,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:04,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553810, now seen corresponding path program 1 times [2024-01-29 22:57:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120420624] [2024-01-29 22:57:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,723 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,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120420624] [2024-01-29 22:57:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120420624] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391671730] [2024-01-29 22:57:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:04,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 296 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:04,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:04,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:05,103 INFO L124 PetriNetUnfolderBase]: 2836/4834 cut-off events. [2024-01-29 22:57:05,103 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:05,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 4834 events. 2836/4834 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33253 event pairs, 2333 based on Foata normal form. 0/3644 useless extension candidates. Maximal degree in co-relation 8821. Up to 3928 conditions per place. [2024-01-29 22:57:05,120 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2024-01-29 22:57:05,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 384 flow [2024-01-29 22:57:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:05,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:05,122 INFO L175 Difference]: Start difference. First operand has 143 places, 143 transitions, 296 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 384 flow [2024-01-29 22:57:05,123 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:05,124 INFO L231 Difference]: Finished difference. Result has 142 places, 142 transitions, 294 flow [2024-01-29 22:57:05,124 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:05,125 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2024-01-29 22:57:05,125 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 294 flow [2024-01-29 22:57:05,125 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:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:05,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:05,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:05,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1809538207, now seen corresponding path program 1 times [2024-01-29 22:57:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710947181] [2024-01-29 22:57:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:05,146 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,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710947181] [2024-01-29 22:57:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710947181] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750476234] [2024-01-29 22:57:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:05,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:05,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 294 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,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:05,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:05,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:05,457 INFO L124 PetriNetUnfolderBase]: 2836/4833 cut-off events. [2024-01-29 22:57:05,457 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 22:57:05,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8840 conditions, 4833 events. 2836/4833 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33318 event pairs, 2333 based on Foata normal form. 0/3644 useless extension candidates. Maximal degree in co-relation 8821. Up to 3928 conditions per place. [2024-01-29 22:57:05,543 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2024-01-29 22:57:05,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 141 transitions, 382 flow [2024-01-29 22:57:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:05,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:05,545 INFO L175 Difference]: Start difference. First operand has 142 places, 142 transitions, 294 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:05,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 141 transitions, 382 flow [2024-01-29 22:57:05,545 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:05,546 INFO L231 Difference]: Finished difference. Result has 141 places, 141 transitions, 292 flow [2024-01-29 22:57:05,547 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:05,547 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -12 predicate places. [2024-01-29 22:57:05,547 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 141 transitions, 292 flow [2024-01-29 22:57:05,548 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:05,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:05,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:05,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:05,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:05,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 261110241, now seen corresponding path program 1 times [2024-01-29 22:57:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914595570] [2024-01-29 22:57:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:05,569 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,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:05,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914595570] [2024-01-29 22:57:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914595570] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200356090] [2024-01-29 22:57:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:05,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:05,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 292 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,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:05,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:05,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:05,864 INFO L124 PetriNetUnfolderBase]: 2836/4832 cut-off events. [2024-01-29 22:57:05,864 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-29 22:57:05,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8839 conditions, 4832 events. 2836/4832 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33288 event pairs, 2333 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 8821. Up to 3928 conditions per place. [2024-01-29 22:57:05,888 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-01-29 22:57:05,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 380 flow [2024-01-29 22:57:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:05,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:05,890 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 292 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 380 flow [2024-01-29 22:57:05,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:05,892 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 290 flow [2024-01-29 22:57:05,892 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:05,893 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -13 predicate places. [2024-01-29 22:57:05,893 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 290 flow [2024-01-29 22:57:05,893 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:05,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:05,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:05,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:05,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:05,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1818862382, now seen corresponding path program 1 times [2024-01-29 22:57:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:05,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23642508] [2024-01-29 22:57:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:05,915 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,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23642508] [2024-01-29 22:57:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23642508] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:05,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645734001] [2024-01-29 22:57:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:05,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:05,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:05,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:05,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,216 INFO L124 PetriNetUnfolderBase]: 2177/3646 cut-off events. [2024-01-29 22:57:06,216 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:06,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 3646 events. 2177/3646 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 24463 event pairs, 1782 based on Foata normal form. 1/3014 useless extension candidates. Maximal degree in co-relation 6749. Up to 3056 conditions per place. [2024-01-29 22:57:06,233 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-01-29 22:57:06,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 372 flow [2024-01-29 22:57:06,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2024-01-29 22:57:06,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2024-01-29 22:57:06,235 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 290 flow. Second operand 3 states and 366 transitions. [2024-01-29 22:57:06,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 372 flow [2024-01-29 22:57:06,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:06,237 INFO L231 Difference]: Finished difference. Result has 138 places, 138 transitions, 286 flow [2024-01-29 22:57:06,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=138, PETRI_TRANSITIONS=138} [2024-01-29 22:57:06,238 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -15 predicate places. [2024-01-29 22:57:06,238 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 138 transitions, 286 flow [2024-01-29 22:57:06,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:06,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:57:06,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:06,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash 550159668, now seen corresponding path program 1 times [2024-01-29 22:57:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693277941] [2024-01-29 22:57:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,261 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,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693277941] [2024-01-29 22:57:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693277941] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335089559] [2024-01-29 22:57:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:06,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 138 transitions, 286 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:06,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:06,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,603 INFO L124 PetriNetUnfolderBase]: 2515/4426 cut-off events. [2024-01-29 22:57:06,603 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 22:57:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7935 conditions, 4426 events. 2515/4426 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 31777 event pairs, 2027 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 7903. Up to 3445 conditions per place. [2024-01-29 22:57:06,628 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2024-01-29 22:57:06,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 372 flow [2024-01-29 22:57:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:06,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:06,630 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 286 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:06,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 372 flow [2024-01-29 22:57:06,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:06,632 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 284 flow [2024-01-29 22:57:06,632 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:06,633 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -16 predicate places. [2024-01-29 22:57:06,633 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 284 flow [2024-01-29 22:57:06,633 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:06,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:06,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:57:06,634 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:06,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -124918821, now seen corresponding path program 1 times [2024-01-29 22:57:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266052133] [2024-01-29 22:57:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,656 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,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266052133] [2024-01-29 22:57:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266052133] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027232109] [2024-01-29 22:57:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:06,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:06,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,969 INFO L124 PetriNetUnfolderBase]: 2177/3644 cut-off events. [2024-01-29 22:57:06,969 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:06,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6764 conditions, 3644 events. 2177/3644 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 24502 event pairs, 1782 based on Foata normal form. 0/3015 useless extension candidates. Maximal degree in co-relation 6733. Up to 3056 conditions per place. [2024-01-29 22:57:06,987 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-29 22:57:06,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 368 flow [2024-01-29 22:57:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2024-01-29 22:57:06,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7952069716775599 [2024-01-29 22:57:06,988 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 284 flow. Second operand 3 states and 365 transitions. [2024-01-29 22:57:06,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 136 transitions, 368 flow [2024-01-29 22:57:06,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:06,991 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 282 flow [2024-01-29 22:57:06,991 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:06,991 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -17 predicate places. [2024-01-29 22:57:06,991 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 282 flow [2024-01-29 22:57:06,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:06,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:57:06,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:06,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 422484537, now seen corresponding path program 1 times [2024-01-29 22:57:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191540918] [2024-01-29 22:57:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,019 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,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191540918] [2024-01-29 22:57:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191540918] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802991896] [2024-01-29 22:57:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:07,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 282 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:07,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:07,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,322 INFO L124 PetriNetUnfolderBase]: 2177/3642 cut-off events. [2024-01-29 22:57:07,322 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 22:57:07,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6762 conditions, 3642 events. 2177/3642 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 24527 event pairs, 1782 based on Foata normal form. 1/3015 useless extension candidates. Maximal degree in co-relation 6733. Up to 3056 conditions per place. [2024-01-29 22:57:07,339 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-01-29 22:57:07,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 364 flow [2024-01-29 22:57:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:07,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:07,341 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 282 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:07,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 364 flow [2024-01-29 22:57:07,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 134 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,343 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 278 flow [2024-01-29 22:57:07,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-01-29 22:57:07,344 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -19 predicate places. [2024-01-29 22:57:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 278 flow [2024-01-29 22:57:07,344 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:07,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:57:07,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:07,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash 212119467, now seen corresponding path program 1 times [2024-01-29 22:57:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183898632] [2024-01-29 22:57:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,371 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,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183898632] [2024-01-29 22:57:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183898632] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151569229] [2024-01-29 22:57:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:07,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:07,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,690 INFO L124 PetriNetUnfolderBase]: 2177/3676 cut-off events. [2024-01-29 22:57:07,690 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:07,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 3676 events. 2177/3676 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25105 event pairs, 1782 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 6770. Up to 3058 conditions per place. [2024-01-29 22:57:07,707 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-01-29 22:57:07,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 366 flow [2024-01-29 22:57:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:07,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:07,709 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 278 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:07,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 366 flow [2024-01-29 22:57:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,711 INFO L231 Difference]: Finished difference. Result has 133 places, 133 transitions, 276 flow [2024-01-29 22:57:07,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=133, PETRI_TRANSITIONS=133} [2024-01-29 22:57:07,713 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -20 predicate places. [2024-01-29 22:57:07,713 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 133 transitions, 276 flow [2024-01-29 22:57:07,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:57:07,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:07,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2014230474, now seen corresponding path program 1 times [2024-01-29 22:57:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230228547] [2024-01-29 22:57:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,759 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,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230228547] [2024-01-29 22:57:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230228547] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485631496] [2024-01-29 22:57:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:07,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 133 transitions, 276 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:07,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:07,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:08,071 INFO L124 PetriNetUnfolderBase]: 2177/3675 cut-off events. [2024-01-29 22:57:08,071 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:08,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6795 conditions, 3675 events. 2177/3675 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25134 event pairs, 1782 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 6768. Up to 3056 conditions per place. [2024-01-29 22:57:08,090 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-01-29 22:57:08,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 360 flow [2024-01-29 22:57:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2024-01-29 22:57:08,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7886710239651417 [2024-01-29 22:57:08,092 INFO L175 Difference]: Start difference. First operand has 133 places, 133 transitions, 276 flow. Second operand 3 states and 362 transitions. [2024-01-29 22:57:08,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 360 flow [2024-01-29 22:57:08,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:08,094 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 274 flow [2024-01-29 22:57:08,094 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,095 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -21 predicate places. [2024-01-29 22:57:08,095 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 274 flow [2024-01-29 22:57:08,095 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:08,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:08,096 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,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:57:08,096 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:08,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -951325746, now seen corresponding path program 1 times [2024-01-29 22:57:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271393994] [2024-01-29 22:57:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:08,149 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,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271393994] [2024-01-29 22:57:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271393994] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404182487] [2024-01-29 22:57:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:08,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:08,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:08,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:08,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:08,694 INFO L124 PetriNetUnfolderBase]: 2515/4439 cut-off events. [2024-01-29 22:57:08,694 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-29 22:57:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7950 conditions, 4439 events. 2515/4439 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 32237 event pairs, 2027 based on Foata normal form. 1/3676 useless extension candidates. Maximal degree in co-relation 7924. Up to 3446 conditions per place. [2024-01-29 22:57:08,779 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2024-01-29 22:57:08,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 360 flow [2024-01-29 22:57:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:08,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:08,781 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 274 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:08,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 360 flow [2024-01-29 22:57:08,781 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:08,782 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 268 flow [2024-01-29 22:57:08,783 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:08,783 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -24 predicate places. [2024-01-29 22:57:08,783 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 268 flow [2024-01-29 22:57:08,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:08,783 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:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:57:08,783 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:08,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 573673630, now seen corresponding path program 1 times [2024-01-29 22:57:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:08,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449289369] [2024-01-29 22:57:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:08,820 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,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:08,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449289369] [2024-01-29 22:57:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449289369] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:08,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:08,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237679767] [2024-01-29 22:57:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:08,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:08,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:08,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:08,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:08,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,105 INFO L124 PetriNetUnfolderBase]: 2515/4438 cut-off events. [2024-01-29 22:57:09,105 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-29 22:57:09,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 4438 events. 2515/4438 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 32290 event pairs, 2027 based on Foata normal form. 0/3677 useless extension candidates. Maximal degree in co-relation 7911. Up to 3446 conditions per place. [2024-01-29 22:57:09,122 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-01-29 22:57:09,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 128 transitions, 358 flow [2024-01-29 22:57:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:09,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:09,124 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 268 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:09,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 128 transitions, 358 flow [2024-01-29 22:57:09,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:09,126 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 266 flow [2024-01-29 22:57:09,126 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,126 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -25 predicate places. [2024-01-29 22:57:09,126 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 266 flow [2024-01-29 22:57:09,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,127 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,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:57:09,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 604014007, now seen corresponding path program 1 times [2024-01-29 22:57:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992471729] [2024-01-29 22:57:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,152 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,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992471729] [2024-01-29 22:57:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992471729] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282047009] [2024-01-29 22:57:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-29 22:57:09,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 266 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:09,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-29 22:57:09,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,434 INFO L124 PetriNetUnfolderBase]: 2515/4437 cut-off events. [2024-01-29 22:57:09,434 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-29 22:57:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 4437 events. 2515/4437 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 32314 event pairs, 2027 based on Foata normal form. 0/3674 useless extension candidates. Maximal degree in co-relation 7910. Up to 3445 conditions per place. [2024-01-29 22:57:09,453 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-01-29 22:57:09,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 354 flow [2024-01-29 22:57:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 22:57:09,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 22:57:09,455 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 266 flow. Second operand 3 states and 358 transitions. [2024-01-29 22:57:09,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 354 flow [2024-01-29 22:57:09,456 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:09,457 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 264 flow [2024-01-29 22:57:09,457 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:09,458 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -26 predicate places. [2024-01-29 22:57:09,458 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 264 flow [2024-01-29 22:57:09,458 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:09,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,458 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,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:57:09,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1544565758, now seen corresponding path program 1 times [2024-01-29 22:57:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304667891] [2024-01-29 22:57:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,482 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,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304667891] [2024-01-29 22:57:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304667891] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994546962] [2024-01-29 22:57:09,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:09,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:09,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:09,761 INFO L124 PetriNetUnfolderBase]: 2515/4436 cut-off events. [2024-01-29 22:57:09,761 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-29 22:57:09,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7945 conditions, 4436 events. 2515/4436 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 32288 event pairs, 2027 based on Foata normal form. 0/3675 useless extension candidates. Maximal degree in co-relation 7909. Up to 3444 conditions per place. [2024-01-29 22:57:09,780 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-01-29 22:57:09,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 350 flow [2024-01-29 22:57:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-01-29 22:57:09,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2024-01-29 22:57:09,783 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 264 flow. Second operand 3 states and 360 transitions. [2024-01-29 22:57:09,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 350 flow [2024-01-29 22:57:09,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:09,785 INFO L231 Difference]: Finished difference. Result has 126 places, 126 transitions, 262 flow [2024-01-29 22:57:09,785 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:09,785 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -27 predicate places. [2024-01-29 22:57:09,785 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 126 transitions, 262 flow [2024-01-29 22:57:09,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:09,786 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:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:57:09,786 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:09,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 636898973, now seen corresponding path program 1 times [2024-01-29 22:57:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45962668] [2024-01-29 22:57:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45962668] [2024-01-29 22:57:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45962668] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085218782] [2024-01-29 22:57:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:09,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:09,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 22:57:09,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:09,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 22:57:09,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,098 INFO L124 PetriNetUnfolderBase]: 2515/4435 cut-off events. [2024-01-29 22:57:10,098 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-29 22:57:10,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7946 conditions, 4435 events. 2515/4435 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 32249 event pairs, 2027 based on Foata normal form. 0/3675 useless extension candidates. Maximal degree in co-relation 7911. Up to 3446 conditions per place. [2024-01-29 22:57:10,116 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-01-29 22:57:10,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 352 flow [2024-01-29 22:57:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-01-29 22:57:10,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775599128540305 [2024-01-29 22:57:10,118 INFO L175 Difference]: Start difference. First operand has 126 places, 126 transitions, 262 flow. Second operand 3 states and 356 transitions. [2024-01-29 22:57:10,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 352 flow [2024-01-29 22:57:10,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,120 INFO L231 Difference]: Finished difference. Result has 125 places, 125 transitions, 260 flow [2024-01-29 22:57:10,120 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,120 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -28 predicate places. [2024-01-29 22:57:10,120 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 125 transitions, 260 flow [2024-01-29 22:57:10,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,121 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,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:57:10,121 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1307544050, now seen corresponding path program 1 times [2024-01-29 22:57:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709337977] [2024-01-29 22:57:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,141 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,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709337977] [2024-01-29 22:57:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709337977] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357947979] [2024-01-29 22:57:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:10,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 125 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:10,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,378 INFO L124 PetriNetUnfolderBase]: 2177/3666 cut-off events. [2024-01-29 22:57:10,379 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:10,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6787 conditions, 3666 events. 2177/3666 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25144 event pairs, 1782 based on Foata normal form. 1/3058 useless extension candidates. Maximal degree in co-relation 6752. Up to 3054 conditions per place. [2024-01-29 22:57:10,393 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-01-29 22:57:10,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 123 transitions, 344 flow [2024-01-29 22:57:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-01-29 22:57:10,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7930283224400871 [2024-01-29 22:57:10,395 INFO L175 Difference]: Start difference. First operand has 125 places, 125 transitions, 260 flow. Second operand 3 states and 364 transitions. [2024-01-29 22:57:10,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 123 transitions, 344 flow [2024-01-29 22:57:10,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,397 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 256 flow [2024-01-29 22:57:10,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=123, PETRI_TRANSITIONS=123} [2024-01-29 22:57:10,397 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -30 predicate places. [2024-01-29 22:57:10,397 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 256 flow [2024-01-29 22:57:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,398 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:10,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:57:10,398 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1879159168, now seen corresponding path program 1 times [2024-01-29 22:57:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004573296] [2024-01-29 22:57:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,418 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,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004573296] [2024-01-29 22:57:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004573296] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240468846] [2024-01-29 22:57:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:10,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:10,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,694 INFO L124 PetriNetUnfolderBase]: 2177/3665 cut-off events. [2024-01-29 22:57:10,694 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:10,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 3665 events. 2177/3665 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25120 event pairs, 1782 based on Foata normal form. 0/3059 useless extension candidates. Maximal degree in co-relation 6740. Up to 3054 conditions per place. [2024-01-29 22:57:10,705 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2024-01-29 22:57:10,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 342 flow [2024-01-29 22:57:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:10,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:10,707 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 256 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:10,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 342 flow [2024-01-29 22:57:10,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:10,708 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 254 flow [2024-01-29 22:57:10,709 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:10,709 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -31 predicate places. [2024-01-29 22:57:10,709 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 254 flow [2024-01-29 22:57:10,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:10,709 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:10,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:57:10,710 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:10,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1875608561, now seen corresponding path program 1 times [2024-01-29 22:57:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231942791] [2024-01-29 22:57:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:10,735 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,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231942791] [2024-01-29 22:57:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231942791] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950400436] [2024-01-29 22:57:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:10,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:10,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 254 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:10,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:10,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:10,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:10,985 INFO L124 PetriNetUnfolderBase]: 2177/3663 cut-off events. [2024-01-29 22:57:10,985 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:10,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 3663 events. 2177/3663 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25125 event pairs, 1782 based on Foata normal form. 1/3058 useless extension candidates. Maximal degree in co-relation 6739. Up to 3053 conditions per place. [2024-01-29 22:57:11,001 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 40 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-01-29 22:57:11,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 334 flow [2024-01-29 22:57:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2024-01-29 22:57:11,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7952069716775599 [2024-01-29 22:57:11,003 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 254 flow. Second operand 3 states and 365 transitions. [2024-01-29 22:57:11,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 334 flow [2024-01-29 22:57:11,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,005 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 250 flow [2024-01-29 22:57:11,005 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,006 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -33 predicate places. [2024-01-29 22:57:11,006 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 250 flow [2024-01-29 22:57:11,006 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:11,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,006 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,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:57:11,006 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1985676049, now seen corresponding path program 1 times [2024-01-29 22:57:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481130717] [2024-01-29 22:57:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,035 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,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481130717] [2024-01-29 22:57:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481130717] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026167275] [2024-01-29 22:57:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2024-01-29 22:57:11,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2024-01-29 22:57:11,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,289 INFO L124 PetriNetUnfolderBase]: 2177/3662 cut-off events. [2024-01-29 22:57:11,290 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:11,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6783 conditions, 3662 events. 2177/3662 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25067 event pairs, 1782 based on Foata normal form. 0/3056 useless extension candidates. Maximal degree in co-relation 6740. Up to 3054 conditions per place. [2024-01-29 22:57:11,306 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-01-29 22:57:11,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 336 flow [2024-01-29 22:57:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2024-01-29 22:57:11,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-01-29 22:57:11,308 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 250 flow. Second operand 3 states and 363 transitions. [2024-01-29 22:57:11,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 336 flow [2024-01-29 22:57:11,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,309 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 248 flow [2024-01-29 22:57:11,310 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:11,310 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -34 predicate places. [2024-01-29 22:57:11,310 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 248 flow [2024-01-29 22:57:11,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,311 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:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:57:11,311 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -689943745, now seen corresponding path program 1 times [2024-01-29 22:57:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806072613] [2024-01-29 22:57:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,333 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,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806072613] [2024-01-29 22:57:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806072613] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859535814] [2024-01-29 22:57:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:11,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,573 INFO L124 PetriNetUnfolderBase]: 2177/3660 cut-off events. [2024-01-29 22:57:11,573 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:11,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6780 conditions, 3660 events. 2177/3660 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25061 event pairs, 1782 based on Foata normal form. 0/3057 useless extension candidates. Maximal degree in co-relation 6739. Up to 3053 conditions per place. [2024-01-29 22:57:11,587 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-01-29 22:57:11,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 330 flow [2024-01-29 22:57:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2024-01-29 22:57:11,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2024-01-29 22:57:11,589 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 248 flow. Second operand 3 states and 366 transitions. [2024-01-29 22:57:11,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 330 flow [2024-01-29 22:57:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,591 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 244 flow [2024-01-29 22:57:11,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=240, 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=244, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-01-29 22:57:11,591 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -36 predicate places. [2024-01-29 22:57:11,591 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 244 flow [2024-01-29 22:57:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,592 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:11,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:57:11,592 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 86581101, now seen corresponding path program 1 times [2024-01-29 22:57:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601627057] [2024-01-29 22:57:11,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,614 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,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601627057] [2024-01-29 22:57:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601627057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379445583] [2024-01-29 22:57:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2024-01-29 22:57:11,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2024-01-29 22:57:11,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:11,832 INFO L124 PetriNetUnfolderBase]: 2177/3659 cut-off events. [2024-01-29 22:57:11,832 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:11,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 3659 events. 2177/3659 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25104 event pairs, 1782 based on Foata normal form. 0/3056 useless extension candidates. Maximal degree in co-relation 6728. Up to 3052 conditions per place. [2024-01-29 22:57:11,844 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 40 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-01-29 22:57:11,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 326 flow [2024-01-29 22:57:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2024-01-29 22:57:11,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2024-01-29 22:57:11,846 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 244 flow. Second operand 3 states and 367 transitions. [2024-01-29 22:57:11,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 326 flow [2024-01-29 22:57:11,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:11,848 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 242 flow [2024-01-29 22:57:11,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=238, 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=242, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2024-01-29 22:57:11,848 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -37 predicate places. [2024-01-29 22:57:11,848 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 242 flow [2024-01-29 22:57:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:11,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:11,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:57:11,849 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:11,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1610952468, now seen corresponding path program 1 times [2024-01-29 22:57:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91127051] [2024-01-29 22:57:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91127051] [2024-01-29 22:57:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91127051] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316438330] [2024-01-29 22:57:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:11,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:11,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:11,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:11,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:11,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,100 INFO L124 PetriNetUnfolderBase]: 2177/3658 cut-off events. [2024-01-29 22:57:12,101 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:12,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 3658 events. 2177/3658 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25099 event pairs, 1782 based on Foata normal form. 0/3055 useless extension candidates. Maximal degree in co-relation 6729. Up to 3053 conditions per place. [2024-01-29 22:57:12,113 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-29 22:57:12,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 326 flow [2024-01-29 22:57:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2024-01-29 22:57:12,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7952069716775599 [2024-01-29 22:57:12,115 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 242 flow. Second operand 3 states and 365 transitions. [2024-01-29 22:57:12,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 326 flow [2024-01-29 22:57:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,116 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 240 flow [2024-01-29 22:57:12,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-01-29 22:57:12,117 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -38 predicate places. [2024-01-29 22:57:12,117 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 240 flow [2024-01-29 22:57:12,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,117 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] [2024-01-29 22:57:12,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:57:12,118 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1600081673, now seen corresponding path program 1 times [2024-01-29 22:57:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363377142] [2024-01-29 22:57:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,138 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363377142] [2024-01-29 22:57:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363377142] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055574300] [2024-01-29 22:57:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2024-01-29 22:57:12,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2024-01-29 22:57:12,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,353 INFO L124 PetriNetUnfolderBase]: 2177/3657 cut-off events. [2024-01-29 22:57:12,353 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-29 22:57:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 3657 events. 2177/3657 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25043 event pairs, 1782 based on Foata normal form. 0/3056 useless extension candidates. Maximal degree in co-relation 6728. Up to 3052 conditions per place. [2024-01-29 22:57:12,366 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 40 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-01-29 22:57:12,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 322 flow [2024-01-29 22:57:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2024-01-29 22:57:12,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2024-01-29 22:57:12,368 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 240 flow. Second operand 3 states and 367 transitions. [2024-01-29 22:57:12,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 322 flow [2024-01-29 22:57:12,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,370 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 238 flow [2024-01-29 22:57:12,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2024-01-29 22:57:12,370 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -39 predicate places. [2024-01-29 22:57:12,370 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 238 flow [2024-01-29 22:57:12,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,371 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:12,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:57:12,371 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 80218174, now seen corresponding path program 1 times [2024-01-29 22:57:12,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445245298] [2024-01-29 22:57:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445245298] [2024-01-29 22:57:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445245298] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355422691] [2024-01-29 22:57:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2024-01-29 22:57:12,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 238 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:12,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2024-01-29 22:57:12,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,602 INFO L124 PetriNetUnfolderBase]: 2177/3656 cut-off events. [2024-01-29 22:57:12,602 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:12,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6784 conditions, 3656 events. 2177/3656 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25073 event pairs, 1782 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 6730. Up to 3051 conditions per place. [2024-01-29 22:57:12,612 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 49 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-01-29 22:57:12,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 338 flow [2024-01-29 22:57:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2024-01-29 22:57:12,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7668845315904139 [2024-01-29 22:57:12,614 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 238 flow. Second operand 3 states and 352 transitions. [2024-01-29 22:57:12,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 338 flow [2024-01-29 22:57:12,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,615 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 236 flow [2024-01-29 22:57:12,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-01-29 22:57:12,616 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -40 predicate places. [2024-01-29 22:57:12,616 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 236 flow [2024-01-29 22:57:12,616 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,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,616 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] [2024-01-29 22:57:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:57:12,617 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1808203152, now seen corresponding path program 1 times [2024-01-29 22:57:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603699033] [2024-01-29 22:57:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,643 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,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603699033] [2024-01-29 22:57:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603699033] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048143447] [2024-01-29 22:57:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:12,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:12,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:12,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:12,876 INFO L124 PetriNetUnfolderBase]: 2177/3654 cut-off events. [2024-01-29 22:57:12,876 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-29 22:57:12,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 3654 events. 2177/3654 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25043 event pairs, 1782 based on Foata normal form. 1/3056 useless extension candidates. Maximal degree in co-relation 6721. Up to 3053 conditions per place. [2024-01-29 22:57:12,890 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-29 22:57:12,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 320 flow [2024-01-29 22:57:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-01-29 22:57:12,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7864923747276689 [2024-01-29 22:57:12,891 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 236 flow. Second operand 3 states and 361 transitions. [2024-01-29 22:57:12,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 320 flow [2024-01-29 22:57:12,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:12,893 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 232 flow [2024-01-29 22:57:12,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2024-01-29 22:57:12,894 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -42 predicate places. [2024-01-29 22:57:12,894 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 232 flow [2024-01-29 22:57:12,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:12,894 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] [2024-01-29 22:57:12,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:57:12,895 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:12,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -219722143, now seen corresponding path program 1 times [2024-01-29 22:57:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545627761] [2024-01-29 22:57:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:12,940 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,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545627761] [2024-01-29 22:57:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545627761] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770465693] [2024-01-29 22:57:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:12,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:13,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 22:57:13,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:13,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 22:57:13,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:13,195 INFO L124 PetriNetUnfolderBase]: 2177/3653 cut-off events. [2024-01-29 22:57:13,195 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-29 22:57:13,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 3653 events. 2177/3653 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 25053 event pairs, 1782 based on Foata normal form. 0/3055 useless extension candidates. Maximal degree in co-relation 6721. Up to 3053 conditions per place. [2024-01-29 22:57:13,210 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-01-29 22:57:13,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 110 transitions, 318 flow [2024-01-29 22:57:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-01-29 22:57:13,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2024-01-29 22:57:13,212 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 232 flow. Second operand 3 states and 360 transitions. [2024-01-29 22:57:13,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 110 transitions, 318 flow [2024-01-29 22:57:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:13,213 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 230 flow [2024-01-29 22:57:13,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-01-29 22:57:13,214 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -43 predicate places. [2024-01-29 22:57:13,214 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 230 flow [2024-01-29 22:57:13,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:13,215 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,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:57:13,215 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:13,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -699561174, now seen corresponding path program 1 times [2024-01-29 22:57:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088316714] [2024-01-29 22:57:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:13,239 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,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:13,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088316714] [2024-01-29 22:57:13,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088316714] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:13,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:13,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519764087] [2024-01-29 22:57:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:13,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:13,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:13,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:13,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:13,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:13,471 INFO L124 PetriNetUnfolderBase]: 2167/3616 cut-off events. [2024-01-29 22:57:13,472 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-29 22:57:13,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6736 conditions, 3616 events. 2167/3616 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 25049 event pairs, 834 based on Foata normal form. 0/3080 useless extension candidates. Maximal degree in co-relation 6683. Up to 1653 conditions per place. [2024-01-29 22:57:13,487 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 64 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2024-01-29 22:57:13,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 410 flow [2024-01-29 22:57:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-01-29 22:57:13,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2024-01-29 22:57:13,489 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 230 flow. Second operand 3 states and 390 transitions. [2024-01-29 22:57:13,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 410 flow [2024-01-29 22:57:13,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:13,491 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 239 flow [2024-01-29 22:57:13,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-01-29 22:57:13,492 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -44 predicate places. [2024-01-29 22:57:13,492 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 239 flow [2024-01-29 22:57:13,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:13,492 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:13,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:57:13,492 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:13,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash -211559224, now seen corresponding path program 1 times [2024-01-29 22:57:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190321613] [2024-01-29 22:57:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:13,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:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190321613] [2024-01-29 22:57:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190321613] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110629543] [2024-01-29 22:57:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:13,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:13,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 22:57:13,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:13,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 22:57:13,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:13,758 INFO L124 PetriNetUnfolderBase]: 2167/3622 cut-off events. [2024-01-29 22:57:13,759 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-01-29 22:57:13,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7144 conditions, 3622 events. 2167/3622 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 24871 event pairs, 938 based on Foata normal form. 0/3075 useless extension candidates. Maximal degree in co-relation 3203. Up to 1593 conditions per place. [2024-01-29 22:57:13,773 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 66 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-01-29 22:57:13,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 134 transitions, 437 flow [2024-01-29 22:57:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2024-01-29 22:57:13,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8474945533769063 [2024-01-29 22:57:13,775 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 239 flow. Second operand 3 states and 389 transitions. [2024-01-29 22:57:13,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 134 transitions, 437 flow [2024-01-29 22:57:13,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:13,777 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 262 flow [2024-01-29 22:57:13,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2024-01-29 22:57:13,778 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -43 predicate places. [2024-01-29 22:57:13,778 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 262 flow [2024-01-29 22:57:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:13,778 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:13,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-01-29 22:57:13,779 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 22:57:13,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash 358196244, now seen corresponding path program 1 times [2024-01-29 22:57:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106452282] [2024-01-29 22:57:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:13,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:13,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:13,811 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:13,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-01-29 22:57:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-01-29 22:57:13,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-01-29 22:57:13,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-01-29 22:57:13,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-01-29 22:57:13,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-01-29 22:57:13,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-01-29 22:57:13,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 76 remaining) [2024-01-29 22:57:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-01-29 22:57:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-01-29 22:57:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-01-29 22:57:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-01-29 22:57:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-01-29 22:57:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-01-29 22:57:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-01-29 22:57:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-01-29 22:57:13,823 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, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:13,828 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:13,828 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:13,889 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-29 22:57:13,890 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-29 22:57:13,890 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:13 BasicIcfg [2024-01-29 22:57:13,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:13,891 INFO L158 Benchmark]: Toolchain (without parser) took 14018.75ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 99.1MB in the beginning and 1.0GB in the end (delta: -948.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-29 22:57:13,891 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:13,891 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 172.0MB. Free memory was 103.3MB in the beginning and 103.2MB in the end (delta: 156.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:13,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 172.0MB. Free memory was 99.0MB in the beginning and 80.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-29 22:57:13,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.47ms. Allocated memory is still 172.0MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:13,892 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 172.0MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:57:13,892 INFO L158 Benchmark]: RCFGBuilder took 1001.38ms. Allocated memory is still 172.0MB. Free memory was 75.4MB in the beginning and 96.3MB in the end (delta: -20.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-01-29 22:57:13,892 INFO L158 Benchmark]: TraceAbstraction took 12668.78ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 95.7MB in the beginning and 1.0GB in the end (delta: -951.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-29 22:57:13,893 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 172.0MB. Free memory was 103.3MB in the beginning and 103.2MB in the end (delta: 156.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 172.0MB. Free memory was 99.0MB in the beginning and 80.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.47ms. Allocated memory is still 172.0MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 172.0MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.38ms. Allocated memory is still 172.0MB. Free memory was 75.4MB in the beginning and 96.3MB in the end (delta: -20.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12668.78ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 95.7MB in the beginning and 1.0GB in the end (delta: -951.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: 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[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[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[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[COMPEQ,IdentifierExpression[length_0],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[COMPEQ,IdentifierExpression[length_0],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[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[COMPEQ,IdentifierExpression[length_0],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[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],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[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[COMPEQ,IdentifierExpression[to_int_1],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[to_int_5],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],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[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],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] [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[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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[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] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [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[COMPEQ,IdentifierExpression[to_int_3],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[COMPEQ,IdentifierExpression[to_int_3],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] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],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] [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[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [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[COMPEQ,IdentifierExpression[length_4],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[COMPEQ,IdentifierExpression[length_4],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[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] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],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] [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]]]]] 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]]]]] [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_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[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[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) [L87] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] 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: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: 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: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: 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: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: 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: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 12.5s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3248 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 418 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4756 IncrementalHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 418 mSDtfsCounter, 4756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=0, InterpolantAutomatonStates: 96, 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, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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:13,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE