/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b
[2022-12-06 01:03:36,809 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-12-06 01:03:36,810 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-12-06 01:03:36,851 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-12-06 01:03:36,851 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-12-06 01:03:36,852 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-12-06 01:03:36,853 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-12-06 01:03:36,854 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-12-06 01:03:36,855 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-12-06 01:03:36,856 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-12-06 01:03:36,857 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-12-06 01:03:36,858 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-12-06 01:03:36,858 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-12-06 01:03:36,858 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-12-06 01:03:36,859 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-12-06 01:03:36,860 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-12-06 01:03:36,861 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-12-06 01:03:36,861 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-12-06 01:03:36,862 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-12-06 01:03:36,864 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-12-06 01:03:36,865 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-12-06 01:03:36,866 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-12-06 01:03:36,867 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-12-06 01:03:36,868 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-12-06 01:03:36,871 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-12-06 01:03:36,871 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-12-06 01:03:36,871 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-12-06 01:03:36,872 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-12-06 01:03:36,872 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-12-06 01:03:36,873 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-12-06 01:03:36,873 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-12-06 01:03:36,874 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-12-06 01:03:36,874 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-12-06 01:03:36,875 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-12-06 01:03:36,875 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-12-06 01:03:36,876 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-12-06 01:03:36,876 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-12-06 01:03:36,876 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-12-06 01:03:36,877 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-12-06 01:03:36,877 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-12-06 01:03:36,878 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-12-06 01:03:36,884 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf
[2022-12-06 01:03:36,918 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-12-06 01:03:36,918 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-12-06 01:03:36,919 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-12-06 01:03:36,919 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-12-06 01:03:36,919 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-12-06 01:03:36,920 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-12-06 01:03:36,920 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-12-06 01:03:36,921 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-12-06 01:03:36,921 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-12-06 01:03:36,922 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-12-06 01:03:36,922 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-12-06 01:03:36,923 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-12-06 01:03:36,923 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN
[2022-12-06 01:03:36,923 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
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.traceabstraction: Use on-demand Petri net difference -> true
[2022-12-06 01:03:37,193 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-12-06 01:03:37,219 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-12-06 01:03:37,221 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-12-06 01:03:37,222 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-12-06 01:03:37,226 INFO  L275        PluginConnector]: CDTParser initialized
[2022-12-06 01:03:37,228 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2022-12-06 01:03:38,274 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2022-12-06 01:03:38,539 INFO  L351              CDTParser]: Found 1 translation units.
[2022-12-06 01:03:38,540 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2022-12-06 01:03:38,550 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d84933b/98bbc638b34d4d049454202c3dd8b532/FLAG2ae71e857
[2022-12-06 01:03:38,560 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d84933b/98bbc638b34d4d049454202c3dd8b532
[2022-12-06 01:03:38,562 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-12-06 01:03:38,562 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-12-06 01:03:38,563 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-12-06 01:03:38,563 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-12-06 01:03:38,565 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-12-06 01:03:38,566 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:38,566 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8fbdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38, skipping insertion in model container
[2022-12-06 01:03:38,566 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:38,571 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-12-06 01:03:38,602 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-12-06 01:03:38,730 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014]
[2022-12-06 01:03:38,853 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,854 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,854 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,860 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,860 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,860 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,860 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,861 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,861 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,862 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,863 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,863 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,863 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,865 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,865 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,865 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,866 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,866 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,866 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,866 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,866 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,868 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,868 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,868 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,869 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,869 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,869 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,869 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,869 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,870 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,870 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,872 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,872 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,872 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,879 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,879 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,879 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,881 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,881 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,881 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,882 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-12-06 01:03:38,894 INFO  L203         MainTranslator]: Completed pre-run
[2022-12-06 01:03:38,902 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014]
[2022-12-06 01:03:38,914 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,915 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,915 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,919 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,919 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,920 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,920 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,920 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,920 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,921 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,921 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,922 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,922 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,923 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,923 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,924 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,924 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,924 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,924 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,925 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,925 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,926 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,926 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,926 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,927 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,927 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,927 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,927 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,927 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,928 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,928 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,929 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,929 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,929 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,932 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,932 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,933 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,934 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,934 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin
[2022-12-06 01:03:38,935 WARN  L623        FunctionHandler]: Unknown extern function __VERIFIER_atomic_end
[2022-12-06 01:03:38,935 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-12-06 01:03:38,969 INFO  L208         MainTranslator]: Completed translation
[2022-12-06 01:03:38,969 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38 WrapperNode
[2022-12-06 01:03:38,969 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-12-06 01:03:38,970 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-12-06 01:03:38,970 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-12-06 01:03:38,970 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-12-06 01:03:38,975 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:38,985 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,000 INFO  L138                Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2022-12-06 01:03:39,001 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-12-06 01:03:39,001 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-12-06 01:03:39,001 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-12-06 01:03:39,001 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-12-06 01:03:39,009 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,009 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,012 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,012 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,017 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,018 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,031 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,032 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,034 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-12-06 01:03:39,035 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-12-06 01:03:39,035 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-12-06 01:03:39,035 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-12-06 01:03:39,035 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (1/1) ...
[2022-12-06 01:03:39,043 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-12-06 01:03:39,052 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:03:39,061 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-12-06 01:03:39,079 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-12-06 01:03:39,101 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2022-12-06 01:03:39,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2022-12-06 01:03:39,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2022-12-06 01:03:39,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2022-12-06 01:03:39,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-12-06 01:03:39,102 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-12-06 01:03:39,102 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-12-06 01:03:39,103 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2022-12-06 01:03:39,206 INFO  L236             CfgBuilder]: Building ICFG
[2022-12-06 01:03:39,208 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-12-06 01:03:39,547 INFO  L277             CfgBuilder]: Performing block encoding
[2022-12-06 01:03:39,733 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-12-06 01:03:39,734 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2022-12-06 01:03:39,735 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:03:39 BoogieIcfgContainer
[2022-12-06 01:03:39,735 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-12-06 01:03:39,737 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-12-06 01:03:39,737 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-12-06 01:03:39,742 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-12-06 01:03:39,743 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:03:38" (1/3) ...
[2022-12-06 01:03:39,743 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20610a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:03:39, skipping insertion in model container
[2022-12-06 01:03:39,743 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:03:38" (2/3) ...
[2022-12-06 01:03:39,743 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20610a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:03:39, skipping insertion in model container
[2022-12-06 01:03:39,743 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:03:39" (3/3) ...
[2022-12-06 01:03:39,746 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i
[2022-12-06 01:03:39,758 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-12-06 01:03:39,758 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-12-06 01:03:39,758 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-12-06 01:03:39,816 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-12-06 01:03:39,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow
[2022-12-06 01:03:39,920 INFO  L130       PetriNetUnfolder]: 2/126 cut-off events.
[2022-12-06 01:03:39,920 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-12-06 01:03:39,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. 
[2022-12-06 01:03:39,947 INFO  L82        GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow
[2022-12-06 01:03:39,951 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow
[2022-12-06 01:03:39,952 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:39,978 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow
[2022-12-06 01:03:39,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow
[2022-12-06 01:03:40,019 INFO  L130       PetriNetUnfolder]: 2/126 cut-off events.
[2022-12-06 01:03:40,019 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-12-06 01:03:40,020 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. 
[2022-12-06 01:03:40,023 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow
[2022-12-06 01:03:40,023 INFO  L188        LiptonReduction]: Number of co-enabled transitions 3000
[2022-12-06 01:03:44,389 INFO  L203        LiptonReduction]: Total number of compositions: 97
[2022-12-06 01:03:44,419 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-12-06 01:03:44,424 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@aea55ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-12-06 01:03:44,424 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2022-12-06 01:03:44,450 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2022-12-06 01:03:44,450 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-12-06 01:03:44,450 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:44,451 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2022-12-06 01:03:44,451 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:44,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:44,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 513024378, now seen corresponding path program 1 times
[2022-12-06 01:03:44,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:44,461 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802204075]
[2022-12-06 01:03:44,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:44,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:44,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:44,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:44,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:44,764 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802204075]
[2022-12-06 01:03:44,765 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802204075] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:44,765 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:44,765 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-12-06 01:03:44,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514330573]
[2022-12-06 01:03:44,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:44,772 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-12-06 01:03:44,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:44,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-12-06 01:03:44,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-12-06 01:03:44,793 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35
[2022-12-06 01:03:44,796 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2022-12-06 01:03:44,796 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:44,796 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35
[2022-12-06 01:03:44,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:45,621 INFO  L130       PetriNetUnfolder]: 5631/7904 cut-off events.
[2022-12-06 01:03:45,621 INFO  L131       PetriNetUnfolder]: For 76/76 co-relation queries the response was YES.
[2022-12-06 01:03:45,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15752 conditions, 7904 events. 5631/7904 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 40682 event pairs, 2088 based on Foata normal form. 0/7260 useless extension candidates. Maximal degree in co-relation 15740. Up to 6124 conditions per place. 
[2022-12-06 01:03:45,654 INFO  L137   encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 2 changer transitions 8/53 dead transitions.
[2022-12-06 01:03:45,655 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 222 flow
[2022-12-06 01:03:45,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-12-06 01:03:45,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-12-06 01:03:45,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions.
[2022-12-06 01:03:45,663 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.6285714285714286
[2022-12-06 01:03:45,666 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places.
[2022-12-06 01:03:45,667 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:45,667 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 53 transitions, 222 flow
[2022-12-06 01:03:45,696 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 53 transitions, 222 flow
[2022-12-06 01:03:45,696 INFO  L188        LiptonReduction]: Number of co-enabled transitions 226
[2022-12-06 01:03:45,924 INFO  L203        LiptonReduction]: Total number of compositions: 4
[2022-12-06 01:03:45,926 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 259
[2022-12-06 01:03:45,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 218 flow
[2022-12-06 01:03:45,927 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2022-12-06 01:03:45,927 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:45,927 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:45,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-12-06 01:03:45,931 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:45,931 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:45,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 235536648, now seen corresponding path program 1 times
[2022-12-06 01:03:45,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:45,931 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243462875]
[2022-12-06 01:03:45,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:45,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:45,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:46,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:46,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:46,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243462875]
[2022-12-06 01:03:46,079 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243462875] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:46,079 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:46,079 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-12-06 01:03:46,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197779929]
[2022-12-06 01:03:46,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:46,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-12-06 01:03:46,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:46,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-12-06 01:03:46,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-12-06 01:03:46,081 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32
[2022-12-06 01:03:46,081 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 51 transitions, 218 flow. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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)
[2022-12-06 01:03:46,081 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:46,081 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32
[2022-12-06 01:03:46,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:47,849 INFO  L130       PetriNetUnfolder]: 15331/20720 cut-off events.
[2022-12-06 01:03:47,850 INFO  L131       PetriNetUnfolder]: For 674/674 co-relation queries the response was YES.
[2022-12-06 01:03:47,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60737 conditions, 20720 events. 15331/20720 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 110036 event pairs, 1407 based on Foata normal form. 0/19352 useless extension candidates. Maximal degree in co-relation 60722. Up to 15394 conditions per place. 
[2022-12-06 01:03:47,928 INFO  L137   encePairwiseOnDemand]: 21/32 looper letters, 73 selfloop transitions, 9 changer transitions 68/150 dead transitions.
[2022-12-06 01:03:47,929 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 150 transitions, 917 flow
[2022-12-06 01:03:47,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-12-06 01:03:47,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:03:47,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions.
[2022-12-06 01:03:47,932 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.6125
[2022-12-06 01:03:47,933 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places.
[2022-12-06 01:03:47,933 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:47,933 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 150 transitions, 917 flow
[2022-12-06 01:03:48,001 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 150 transitions, 917 flow
[2022-12-06 01:03:48,002 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:48,009 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:48,010 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 77
[2022-12-06 01:03:48,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 150 transitions, 917 flow
[2022-12-06 01:03:48,011 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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)
[2022-12-06 01:03:48,011 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:48,011 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:48,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-12-06 01:03:48,011 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:48,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:48,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288322680, now seen corresponding path program 1 times
[2022-12-06 01:03:48,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:48,012 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465601353]
[2022-12-06 01:03:48,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:48,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:48,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:48,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:48,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:48,135 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465601353]
[2022-12-06 01:03:48,135 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465601353] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:48,135 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:48,135 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-12-06 01:03:48,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506738243]
[2022-12-06 01:03:48,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:48,136 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:03:48,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:48,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:03:48,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:03:48,136 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32
[2022-12-06 01:03:48,136 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 150 transitions, 917 flow. Second operand  has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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)
[2022-12-06 01:03:48,136 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:48,136 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32
[2022-12-06 01:03:48,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:49,964 INFO  L130       PetriNetUnfolder]: 15739/21288 cut-off events.
[2022-12-06 01:03:49,969 INFO  L131       PetriNetUnfolder]: For 882/882 co-relation queries the response was YES.
[2022-12-06 01:03:49,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83838 conditions, 21288 events. 15739/21288 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 111620 event pairs, 523 based on Foata normal form. 0/20144 useless extension candidates. Maximal degree in co-relation 83820. Up to 15904 conditions per place. 
[2022-12-06 01:03:50,028 INFO  L137   encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 10 changer transitions 189/308 dead transitions.
[2022-12-06 01:03:50,028 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 308 transitions, 2469 flow
[2022-12-06 01:03:50,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2022-12-06 01:03:50,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2022-12-06 01:03:50,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2022-12-06 01:03:50,032 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2022-12-06 01:03:50,033 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places.
[2022-12-06 01:03:50,034 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:50,034 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 308 transitions, 2469 flow
[2022-12-06 01:03:50,098 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 308 transitions, 2469 flow
[2022-12-06 01:03:50,098 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:50,104 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:50,106 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 73
[2022-12-06 01:03:50,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 308 transitions, 2469 flow
[2022-12-06 01:03:50,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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)
[2022-12-06 01:03:50,106 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:50,106 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:50,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-12-06 01:03:50,106 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:50,107 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:50,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -1284302773, now seen corresponding path program 1 times
[2022-12-06 01:03:50,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:50,107 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797693091]
[2022-12-06 01:03:50,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:50,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:50,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:50,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:50,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:50,252 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797693091]
[2022-12-06 01:03:50,252 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797693091] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:50,252 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:50,252 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-12-06 01:03:50,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318617899]
[2022-12-06 01:03:50,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:50,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-12-06 01:03:50,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:50,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-12-06 01:03:50,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-12-06 01:03:50,253 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32
[2022-12-06 01:03:50,253 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 308 transitions, 2469 flow. Second operand  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2022-12-06 01:03:50,253 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:50,253 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32
[2022-12-06 01:03:50,253 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:51,481 INFO  L130       PetriNetUnfolder]: 10095/14165 cut-off events.
[2022-12-06 01:03:51,482 INFO  L131       PetriNetUnfolder]: For 1038/1038 co-relation queries the response was YES.
[2022-12-06 01:03:51,496 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69639 conditions, 14165 events. 10095/14165 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 75351 event pairs, 296 based on Foata normal form. 0/13355 useless extension candidates. Maximal degree in co-relation 69618. Up to 12013 conditions per place. 
[2022-12-06 01:03:51,646 INFO  L137   encePairwiseOnDemand]: 26/32 looper letters, 175 selfloop transitions, 25 changer transitions 194/397 dead transitions.
[2022-12-06 01:03:51,647 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 397 transitions, 3980 flow
[2022-12-06 01:03:51,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-12-06 01:03:51,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-12-06 01:03:51,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions.
[2022-12-06 01:03:51,648 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.6145833333333334
[2022-12-06 01:03:51,648 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places.
[2022-12-06 01:03:51,649 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:51,649 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 397 transitions, 3980 flow
[2022-12-06 01:03:51,706 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 397 transitions, 3980 flow
[2022-12-06 01:03:51,707 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:51,710 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:51,711 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 63
[2022-12-06 01:03:51,711 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 397 transitions, 3980 flow
[2022-12-06 01:03:51,711 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2022-12-06 01:03:51,711 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:51,712 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:51,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-12-06 01:03:51,712 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:51,712 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:51,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 1156497261, now seen corresponding path program 1 times
[2022-12-06 01:03:51,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:51,712 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339634123]
[2022-12-06 01:03:51,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:51,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:51,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:51,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:51,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:51,928 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339634123]
[2022-12-06 01:03:51,928 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339634123] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:51,928 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:51,929 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-12-06 01:03:51,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866067661]
[2022-12-06 01:03:51,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:51,930 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-12-06 01:03:51,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:51,930 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-12-06 01:03:51,931 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-12-06 01:03:51,931 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32
[2022-12-06 01:03:51,931 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 397 transitions, 3980 flow. Second operand  has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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)
[2022-12-06 01:03:51,932 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:51,932 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32
[2022-12-06 01:03:51,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:52,949 INFO  L130       PetriNetUnfolder]: 5497/7986 cut-off events.
[2022-12-06 01:03:52,950 INFO  L131       PetriNetUnfolder]: For 1190/1190 co-relation queries the response was YES.
[2022-12-06 01:03:52,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47064 conditions, 7986 events. 5497/7986 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40980 event pairs, 124 based on Foata normal form. 0/7607 useless extension candidates. Maximal degree in co-relation 47040. Up to 6211 conditions per place. 
[2022-12-06 01:03:53,109 INFO  L137   encePairwiseOnDemand]: 26/32 looper letters, 220 selfloop transitions, 49 changer transitions 163/435 dead transitions.
[2022-12-06 01:03:53,109 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 435 transitions, 5227 flow
[2022-12-06 01:03:53,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2022-12-06 01:03:53,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2022-12-06 01:03:53,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions.
[2022-12-06 01:03:53,111 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.640625
[2022-12-06 01:03:53,113 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places.
[2022-12-06 01:03:53,113 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:53,113 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 435 transitions, 5227 flow
[2022-12-06 01:03:53,143 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 435 transitions, 5227 flow
[2022-12-06 01:03:53,144 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:53,146 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:53,148 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 35
[2022-12-06 01:03:53,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 435 transitions, 5227 flow
[2022-12-06 01:03:53,149 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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)
[2022-12-06 01:03:53,149 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:53,149 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:53,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-12-06 01:03:53,149 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:53,149 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:53,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 33427678, now seen corresponding path program 1 times
[2022-12-06 01:03:53,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:53,150 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818314869]
[2022-12-06 01:03:53,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:53,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:53,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:53,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:53,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:53,322 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818314869]
[2022-12-06 01:03:53,322 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818314869] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:53,322 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:53,322 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-12-06 01:03:53,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799744200]
[2022-12-06 01:03:53,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:53,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:03:53,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:53,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:03:53,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:03:53,324 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32
[2022-12-06 01:03:53,324 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 435 transitions, 5227 flow. Second operand  has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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)
[2022-12-06 01:03:53,324 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:53,324 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32
[2022-12-06 01:03:53,324 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:53,938 INFO  L130       PetriNetUnfolder]: 4161/5961 cut-off events.
[2022-12-06 01:03:53,938 INFO  L131       PetriNetUnfolder]: For 1624/1624 co-relation queries the response was YES.
[2022-12-06 01:03:53,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40896 conditions, 5961 events. 4161/5961 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 28719 event pairs, 72 based on Foata normal form. 0/5785 useless extension candidates. Maximal degree in co-relation 40869. Up to 4505 conditions per place. 
[2022-12-06 01:03:53,960 INFO  L137   encePairwiseOnDemand]: 26/32 looper letters, 220 selfloop transitions, 69 changer transitions 98/390 dead transitions.
[2022-12-06 01:03:53,960 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 390 transitions, 5481 flow
[2022-12-06 01:03:53,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-12-06 01:03:53,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:03:53,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2022-12-06 01:03:53,961 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.625
[2022-12-06 01:03:53,961 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places.
[2022-12-06 01:03:53,962 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:53,962 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 390 transitions, 5481 flow
[2022-12-06 01:03:53,986 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 390 transitions, 5481 flow
[2022-12-06 01:03:53,986 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:53,988 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:53,988 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 27
[2022-12-06 01:03:53,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 390 transitions, 5481 flow
[2022-12-06 01:03:53,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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)
[2022-12-06 01:03:53,989 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:53,989 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:53,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-12-06 01:03:53,989 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:53,989 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:53,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 590317281, now seen corresponding path program 1 times
[2022-12-06 01:03:53,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:53,989 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966048699]
[2022-12-06 01:03:53,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:53,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:54,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:54,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:54,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:54,133 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966048699]
[2022-12-06 01:03:54,133 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966048699] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:54,133 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:54,133 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-12-06 01:03:54,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688758193]
[2022-12-06 01:03:54,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:54,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:03:54,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:54,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:03:54,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:03:54,134 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32
[2022-12-06 01:03:54,135 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 390 transitions, 5481 flow. Second operand  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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)
[2022-12-06 01:03:54,135 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:54,135 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32
[2022-12-06 01:03:54,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:55,060 INFO  L130       PetriNetUnfolder]: 5067/7282 cut-off events.
[2022-12-06 01:03:55,060 INFO  L131       PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES.
[2022-12-06 01:03:55,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57122 conditions, 7282 events. 5067/7282 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 36534 event pairs, 20 based on Foata normal form. 0/7094 useless extension candidates. Maximal degree in co-relation 57092. Up to 5527 conditions per place. 
[2022-12-06 01:03:55,085 INFO  L137   encePairwiseOnDemand]: 20/32 looper letters, 375 selfloop transitions, 90 changer transitions 212/677 dead transitions.
[2022-12-06 01:03:55,085 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 677 transitions, 10832 flow
[2022-12-06 01:03:55,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-12-06 01:03:55,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-12-06 01:03:55,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2022-12-06 01:03:55,087 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.5
[2022-12-06 01:03:55,087 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places.
[2022-12-06 01:03:55,088 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:55,088 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 677 transitions, 10832 flow
[2022-12-06 01:03:55,124 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 677 transitions, 10832 flow
[2022-12-06 01:03:55,124 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:55,129 ERROR L112   fgCompositionFactory]: Composing non-subsequent actions: [512] L19-1-->ULTIMATE.startEXIT: Formula: (and (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_In_1| 0)) (= |v_ULTIMATE.start_main_#res#1_Out_8| |v_ULTIMATE.start_#t~ret13#1_Out_8|) (= |v_ULTIMATE.start_main_#res#1_Out_8| 0) (= (store (store (store (store |v_#valid_In_20| |v_ULTIMATE.start_main_~#t685~0#1.base_In_6| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_In_5| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_In_7| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_In_4| 0) |v_#valid_Out_32|))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_In_7|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_In_1|, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_In_5|, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_In_4|, #valid=|v_#valid_In_20|, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_In_6|}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_In_1|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_Out_12|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_Out_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_8|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_Out_12|, #valid=|v_#valid_Out_32|, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_Out_14|, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_Out_8|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t688~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t686~0#1.offset, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset, ULTIMATE.start_#t~ret13#1] and [455] $Ultimate##0-->L754: Formula: (and (= v_~a~0_13 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|))  InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|}  OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|}  AuxVars[]  AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset]
[2022-12-06 01:03:55,185 INFO  L203        LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:03:55,186 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 98
[2022-12-06 01:03:55,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 676 transitions, 10818 flow
[2022-12-06 01:03:55,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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)
[2022-12-06 01:03:55,186 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:55,186 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:55,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-12-06 01:03:55,186 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:55,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:55,187 INFO  L85        PathProgramCache]: Analyzing trace with hash -1751619219, now seen corresponding path program 2 times
[2022-12-06 01:03:55,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:55,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012504063]
[2022-12-06 01:03:55,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:55,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:55,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:55,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:55,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:55,343 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012504063]
[2022-12-06 01:03:55,343 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012504063] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:55,343 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:55,343 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-12-06 01:03:55,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504706931]
[2022-12-06 01:03:55,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:55,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-12-06 01:03:55,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:55,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-12-06 01:03:55,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-12-06 01:03:55,344 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33
[2022-12-06 01:03:55,345 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 676 transitions, 10818 flow. Second operand  has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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)
[2022-12-06 01:03:55,345 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:55,345 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33
[2022-12-06 01:03:55,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:03:56,921 INFO  L130       PetriNetUnfolder]: 6317/9141 cut-off events.
[2022-12-06 01:03:56,921 INFO  L131       PetriNetUnfolder]: For 2359/2359 co-relation queries the response was YES.
[2022-12-06 01:03:56,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80881 conditions, 9141 events. 6317/9141 cut-off events. For 2359/2359 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 48293 event pairs, 24 based on Foata normal form. 0/8932 useless extension candidates. Maximal degree in co-relation 80848. Up to 7043 conditions per place. 
[2022-12-06 01:03:56,960 INFO  L137   encePairwiseOnDemand]: 20/33 looper letters, 231 selfloop transitions, 51 changer transitions 574/856 dead transitions.
[2022-12-06 01:03:56,961 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 856 transitions, 15386 flow
[2022-12-06 01:03:56,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-12-06 01:03:56,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-12-06 01:03:56,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions.
[2022-12-06 01:03:56,966 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.5121212121212121
[2022-12-06 01:03:56,968 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places.
[2022-12-06 01:03:56,969 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:03:56,969 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 856 transitions, 15386 flow
[2022-12-06 01:03:57,057 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 856 transitions, 15386 flow
[2022-12-06 01:03:57,058 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:03:57,061 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:03:57,063 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 95
[2022-12-06 01:03:57,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 856 transitions, 15386 flow
[2022-12-06 01:03:57,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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)
[2022-12-06 01:03:57,063 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:03:57,063 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:03:57,064 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-12-06 01:03:57,064 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:03:57,064 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:03:57,064 INFO  L85        PathProgramCache]: Analyzing trace with hash 676055598, now seen corresponding path program 1 times
[2022-12-06 01:03:57,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:03:57,064 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347693192]
[2022-12-06 01:03:57,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:03:57,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:03:57,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:03:57,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:03:57,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:03:57,552 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347693192]
[2022-12-06 01:03:57,552 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347693192] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:03:57,552 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:03:57,552 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-12-06 01:03:57,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860229306]
[2022-12-06 01:03:57,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:03:57,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-12-06 01:03:57,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:03:57,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-12-06 01:03:57,553 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2022-12-06 01:03:57,553 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33
[2022-12-06 01:03:57,553 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 856 transitions, 15386 flow. Second operand  has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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)
[2022-12-06 01:03:57,554 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:03:57,554 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33
[2022-12-06 01:03:57,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:04:00,145 INFO  L130       PetriNetUnfolder]: 8654/12536 cut-off events.
[2022-12-06 01:04:00,146 INFO  L131       PetriNetUnfolder]: For 2947/2947 co-relation queries the response was YES.
[2022-12-06 01:04:00,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 123862 conditions, 12536 events. 8654/12536 cut-off events. For 2947/2947 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 69801 event pairs, 23 based on Foata normal form. 1/12243 useless extension candidates. Maximal degree in co-relation 123826. Up to 10288 conditions per place. 
[2022-12-06 01:04:00,187 INFO  L137   encePairwiseOnDemand]: 18/33 looper letters, 306 selfloop transitions, 122 changer transitions 1142/1570 dead transitions.
[2022-12-06 01:04:00,187 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1570 transitions, 31289 flow
[2022-12-06 01:04:00,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-12-06 01:04:00,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2022-12-06 01:04:00,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions.
[2022-12-06 01:04:00,189 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.47785547785547783
[2022-12-06 01:04:00,190 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places.
[2022-12-06 01:04:00,191 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:04:00,191 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 1570 transitions, 31289 flow
[2022-12-06 01:04:00,345 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 1570 transitions, 31289 flow
[2022-12-06 01:04:00,346 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:04:00,353 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:04:00,354 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 164
[2022-12-06 01:04:00,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 1570 transitions, 31289 flow
[2022-12-06 01:04:00,355 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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)
[2022-12-06 01:04:00,355 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:04:00,355 INFO  L213   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:04:00,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-12-06 01:04:00,355 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:04:00,355 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:04:00,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1166425962, now seen corresponding path program 2 times
[2022-12-06 01:04:00,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:04:00,356 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387581482]
[2022-12-06 01:04:00,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:04:00,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:04:00,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:04:00,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:04:00,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:04:00,530 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387581482]
[2022-12-06 01:04:00,530 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387581482] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:04:00,530 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:04:00,530 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-12-06 01:04:00,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307014702]
[2022-12-06 01:04:00,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:04:00,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-12-06 01:04:00,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:04:00,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-12-06 01:04:00,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-12-06 01:04:00,531 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33
[2022-12-06 01:04:00,532 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1570 transitions, 31289 flow. Second operand  has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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)
[2022-12-06 01:04:00,532 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:04:00,532 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33
[2022-12-06 01:04:00,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:04:03,303 INFO  L130       PetriNetUnfolder]: 8297/11813 cut-off events.
[2022-12-06 01:04:03,304 INFO  L131       PetriNetUnfolder]: For 4439/4439 co-relation queries the response was YES.
[2022-12-06 01:04:03,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128142 conditions, 11813 events. 8297/11813 cut-off events. For 4439/4439 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 64180 event pairs, 9 based on Foata normal form. 0/11614 useless extension candidates. Maximal degree in co-relation 128103. Up to 9611 conditions per place. 
[2022-12-06 01:04:03,339 INFO  L137   encePairwiseOnDemand]: 27/33 looper letters, 294 selfloop transitions, 105 changer transitions 973/1383 dead transitions.
[2022-12-06 01:04:03,340 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1383 transitions, 30317 flow
[2022-12-06 01:04:03,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-12-06 01:04:03,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-12-06 01:04:03,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2022-12-06 01:04:03,341 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.5151515151515151
[2022-12-06 01:04:03,341 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places.
[2022-12-06 01:04:03,341 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:04:03,342 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1383 transitions, 30317 flow
[2022-12-06 01:04:03,415 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1383 transitions, 30317 flow
[2022-12-06 01:04:03,415 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:04:03,423 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:04:03,425 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 84
[2022-12-06 01:04:03,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 1383 transitions, 30317 flow
[2022-12-06 01:04:03,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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)
[2022-12-06 01:04:03,425 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:04:03,425 INFO  L213   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]
[2022-12-06 01:04:03,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-12-06 01:04:03,425 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:04:03,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:04:03,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -1357085517, now seen corresponding path program 1 times
[2022-12-06 01:04:03,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:04:03,426 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314276162]
[2022-12-06 01:04:03,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:04:03,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:04:03,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:04:04,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:04:04,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:04:04,351 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314276162]
[2022-12-06 01:04:04,352 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314276162] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:04:04,352 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:04:04,352 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-12-06 01:04:04,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343844357]
[2022-12-06 01:04:04,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:04:04,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-12-06 01:04:04,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:04:04,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-12-06 01:04:04,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2022-12-06 01:04:04,355 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32
[2022-12-06 01:04:04,355 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1383 transitions, 30317 flow. Second operand  has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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)
[2022-12-06 01:04:04,355 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:04:04,355 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32
[2022-12-06 01:04:04,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:04:07,421 INFO  L130       PetriNetUnfolder]: 10297/14885 cut-off events.
[2022-12-06 01:04:07,422 INFO  L131       PetriNetUnfolder]: For 6311/6311 co-relation queries the response was YES.
[2022-12-06 01:04:07,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 175862 conditions, 14885 events. 10297/14885 cut-off events. For 6311/6311 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 86306 event pairs, 9 based on Foata normal form. 0/14630 useless extension candidates. Maximal degree in co-relation 175820. Up to 12495 conditions per place. 
[2022-12-06 01:04:07,492 INFO  L137   encePairwiseOnDemand]: 24/32 looper letters, 306 selfloop transitions, 42 changer transitions 1659/2017 dead transitions.
[2022-12-06 01:04:07,492 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 2017 transitions, 48266 flow
[2022-12-06 01:04:07,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-12-06 01:04:07,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-12-06 01:04:07,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions.
[2022-12-06 01:04:07,494 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.3229166666666667
[2022-12-06 01:04:07,494 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places.
[2022-12-06 01:04:07,495 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:04:07,495 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 2017 transitions, 48266 flow
[2022-12-06 01:04:07,638 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 2017 transitions, 48266 flow
[2022-12-06 01:04:07,638 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:04:07,647 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:04:07,650 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 156
[2022-12-06 01:04:07,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 2017 transitions, 48266 flow
[2022-12-06 01:04:07,650 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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)
[2022-12-06 01:04:07,650 INFO  L205   CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:04:07,650 INFO  L213   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]
[2022-12-06 01:04:07,651 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-12-06 01:04:07,651 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2022-12-06 01:04:07,651 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:04:07,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 1144578463, now seen corresponding path program 2 times
[2022-12-06 01:04:07,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:04:07,651 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866612303]
[2022-12-06 01:04:07,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:04:07,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:04:07,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:04:07,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:04:07,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:04:07,846 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866612303]
[2022-12-06 01:04:07,846 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866612303] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:04:07,846 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:04:07,846 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-12-06 01:04:07,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23334950]
[2022-12-06 01:04:07,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:04:07,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:04:07,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:04:07,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:04:07,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:04:07,849 INFO  L490   CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32
[2022-12-06 01:04:07,849 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 2017 transitions, 48266 flow. Second operand  has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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)
[2022-12-06 01:04:07,849 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:04:07,849 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32
[2022-12-06 01:04:07,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:04:12,145 INFO  L130       PetriNetUnfolder]: 10697/15452 cut-off events.
[2022-12-06 01:04:12,145 INFO  L131       PetriNetUnfolder]: For 6236/6236 co-relation queries the response was YES.
[2022-12-06 01:04:12,161 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 197975 conditions, 15452 events. 10697/15452 cut-off events. For 6236/6236 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 89861 event pairs, 0 based on Foata normal form. 0/15198 useless extension candidates. Maximal degree in co-relation 197930. Up to 13038 conditions per place. 
[2022-12-06 01:04:12,187 INFO  L137   encePairwiseOnDemand]: 20/32 looper letters, 0 selfloop transitions, 0 changer transitions 2515/2515 dead transitions.
[2022-12-06 01:04:12,188 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 2515 transitions, 65222 flow
[2022-12-06 01:04:12,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2022-12-06 01:04:12,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2022-12-06 01:04:12,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions.
[2022-12-06 01:04:12,189 INFO  L535   CegarLoopForPetriNet]: DFA transition density 0.38392857142857145
[2022-12-06 01:04:12,191 INFO  L294   CegarLoopForPetriNet]: 47 programPoint places, 60 predicate places.
[2022-12-06 01:04:12,191 INFO  L195   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:04:12,191 INFO  L167   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 2515 transitions, 65222 flow
[2022-12-06 01:04:12,318 INFO  L184        LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 2515 transitions, 65222 flow
[2022-12-06 01:04:12,319 INFO  L188        LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:04:12,326 INFO  L203        LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:04:12,327 INFO  L143   eatedLiptonReduction]: Time needed for LBE in milliseconds: 136
[2022-12-06 01:04:12,327 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 2515 transitions, 65222 flow
[2022-12-06 01:04:12,327 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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)
[2022-12-06 01:04:12,330 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2022-12-06 01:04:12,331 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2022-12-06 01:04:12,331 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2022-12-06 01:04:12,334 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2022-12-06 01:04:12,335 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2022-12-06 01:04:12,335 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2022-12-06 01:04:12,335 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2022-12-06 01:04:12,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-12-06 01:04:12,336 INFO  L458         BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:04:12,339 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-12-06 01:04:12,340 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2022-12-06 01:04:12,342 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:04:12 BasicIcfg
[2022-12-06 01:04:12,342 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-12-06 01:04:12,342 INFO  L158              Benchmark]: Toolchain (without parser) took 33779.57ms. Allocated memory was 190.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 148.5MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,342 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-12-06 01:04:12,342 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 406.07ms. Allocated memory is still 190.8MB. Free memory was 147.9MB in the beginning and 120.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,343 INFO  L158              Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 190.8MB. Free memory was 120.7MB in the beginning and 118.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,343 INFO  L158              Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 190.8MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,343 INFO  L158              Benchmark]: RCFGBuilder took 700.80ms. Allocated memory is still 190.8MB. Free memory was 116.0MB in the beginning and 81.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,343 INFO  L158              Benchmark]: TraceAbstraction took 32604.90ms. Allocated memory was 190.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 80.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB.
[2022-12-06 01:04:12,344 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 406.07ms. Allocated memory is still 190.8MB. Free memory was 147.9MB in the beginning and 120.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 190.8MB. Free memory was 120.7MB in the beginning and 118.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 33.15ms. Allocated memory is still 190.8MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 700.80ms. Allocated memory is still 190.8MB. Free memory was 116.0MB in the beginning and 81.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 32604.90ms. Allocated memory was 190.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 80.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.4s, 137 PlacesBefore, 47 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 2431, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2500, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1953, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1953, independent: 1876, independent conditional: 0, independent unconditional: 1876, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 2500, independent: 526, independent conditional: 0, independent unconditional: 526, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1953, unknown conditional: 0, unknown unconditional: 1953] , Statistics on independence cache: Total cache size (in pairs): 3192, Positive cache size: 3144, Positive conditional cache size: 0, Positive unconditional cache size: 3144, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 45 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 308 TransitionsBefore, 308 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 397 TransitionsBefore, 397 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 435 TransitionsBefore, 435 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 390 TransitionsBefore, 390 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 71 PlacesAfterwards, 677 TransitionsBefore, 676 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 856 TransitionsBefore, 856 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 1570 TransitionsBefore, 1570 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 1383 TransitionsBefore, 1383 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 2017 TransitionsBefore, 2017 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 2515 TransitionsBefore, 2515 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
  - PositiveResult [Line: 19]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - PositiveResult [Line: 19]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 166 locations, 7 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: 32.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 858 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2542 IncrementalHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 15 mSDtfsCounter, 2542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65222occurred in iteration=12, InterpolantAutomatonStates: 81, 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.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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
  - AllSpecificationsHoldResult: All specifications hold
    2 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2022-12-06 01:04:12,378 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...