/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/weaver/chl-nzb-file-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:57:36,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:57:36,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:57:36,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:57:36,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:57:36,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:57:36,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:57:36,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:57:36,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:57:36,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:57:36,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:57:36,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:57:36,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:57:36,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:57:36,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:57:36,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:57:36,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:57:36,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:57:36,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:57:36,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:57:36,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:57:36,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:57:36,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:57:36,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:57:36,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:57:36,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:57:36,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:57:36,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:57:36,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:57:36,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:57:36,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:57:36,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:57:36,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:57:36,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:57:36,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:57:36,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:57:36,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:57:36,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:57:36,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:57:36,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:57:36,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:57:36,974 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:57:36,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:57:36,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:57:36,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:57:36,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:57:36,997 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:57:36,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:57:36,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:57:36,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:57:36,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:57:36,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:57:36,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:57:37,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:57:37,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:57:37,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:57:37,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:57:37,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:57:37,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:57:37,001 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:57:37,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:57:37,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:57:37,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:57:37,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:57:37,326 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:57:37,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-06 01:57:38,326 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:57:38,517 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:57:38,517 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-06 01:57:38,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5c8acf2/cd31eeb7ee964c009fd4e133c0da2b7a/FLAG5058ea86f [2022-12-06 01:57:38,533 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5c8acf2/cd31eeb7ee964c009fd4e133c0da2b7a [2022-12-06 01:57:38,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:57:38,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:57:38,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:57:38,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:57:38,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:57:38,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3720a3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38, skipping insertion in model container [2022-12-06 01:57:38,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:57:38,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:57:38,750 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-12-06 01:57:38,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:57:38,768 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:57:38,820 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-12-06 01:57:38,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:57:38,842 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:57:38,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38 WrapperNode [2022-12-06 01:57:38,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:57:38,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:57:38,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:57:38,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:57:38,848 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:57:38" (1/1) ... [2022-12-06 01:57:38,868 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:57:38" (1/1) ... [2022-12-06 01:57:38,909 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 574 [2022-12-06 01:57:38,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:57:38,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:57:38,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:57:38,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:57:38,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,942 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:57:38,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:57:38,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:57:38,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:57:38,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (1/1) ... [2022-12-06 01:57:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:57:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:57:38,976 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:57:39,007 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:57:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:57:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:57:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:57:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:57:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 01:57:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 01:57:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 01:57:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:57:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:57:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:57:39,022 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:57:39,196 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:57:39,198 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:57:39,823 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:57:39,833 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:57:39,834 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 01:57:39,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:57:39 BoogieIcfgContainer [2022-12-06 01:57:39,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:57:39,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:57:39,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:57:39,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:57:39,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:57:38" (1/3) ... [2022-12-06 01:57:39,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755f4862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:57:39, skipping insertion in model container [2022-12-06 01:57:39,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:57:38" (2/3) ... [2022-12-06 01:57:39,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755f4862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:57:39, skipping insertion in model container [2022-12-06 01:57:39,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:57:39" (3/3) ... [2022-12-06 01:57:39,843 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2022-12-06 01:57:39,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:57:39,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:57:39,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:57:40,004 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 01:57:40,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 01:57:40,300 INFO L130 PetriNetUnfolder]: 73/687 cut-off events. [2022-12-06 01:57:40,301 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:57:40,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 687 events. 73/687 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2360 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 01:57:40,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 01:57:40,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 614 places, 677 transitions, 1372 flow [2022-12-06 01:57:40,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:57:40,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 01:57:40,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 677 transitions, 1372 flow [2022-12-06 01:57:40,492 INFO L130 PetriNetUnfolder]: 73/677 cut-off events. [2022-12-06 01:57:40,493 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:57:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 677 events. 73/677 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2359 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 01:57:40,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 01:57:40,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 153384 [2022-12-06 01:58:06,108 INFO L203 LiptonReduction]: Total number of compositions: 632 [2022-12-06 01:58:06,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:58:06,132 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;@5829e316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:58:06,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:58:06,140 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-06 01:58:06,140 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:58:06,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:06,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:06,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash -759560692, now seen corresponding path program 1 times [2022-12-06 01:58:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312570836] [2022-12-06 01:58:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:06,520 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:58:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312570836] [2022-12-06 01:58:06,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312570836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:06,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:06,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:58:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725263060] [2022-12-06 01:58:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:58:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:58:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:58:06,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:06,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:58:06,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:06,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:06,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:07,173 INFO L130 PetriNetUnfolder]: 2776/3671 cut-off events. [2022-12-06 01:58:07,173 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-06 01:58:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 3671 events. 2776/3671 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12995 event pairs, 1657 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 7072. Up to 3669 conditions per place. [2022-12-06 01:58:07,187 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-06 01:58:07,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 226 flow [2022-12-06 01:58:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:58:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:58:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 01:58:07,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 01:58:07,199 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-06 01:58:07,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:07,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 52 transitions, 226 flow [2022-12-06 01:58:07,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 52 transitions, 226 flow [2022-12-06 01:58:07,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:07,585 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:58:07,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-06 01:58:07,586 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 226 flow [2022-12-06 01:58:07,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:58:07,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:07,587 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] [2022-12-06 01:58:07,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:58:07,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1800656135, now seen corresponding path program 1 times [2022-12-06 01:58:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866711285] [2022-12-06 01:58:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 01:58:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866711285] [2022-12-06 01:58:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866711285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704204609] [2022-12-06 01:58:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:07,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:07,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 01:58:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:07,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 01:58:07,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 01:58:07,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:58:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 01:58:07,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704204609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:58:07,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:58:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 01:58:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283528737] [2022-12-06 01:58:07,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:58:07,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:58:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:07,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:58:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:58:07,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:07,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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:58:07,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:07,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:07,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:08,554 INFO L130 PetriNetUnfolder]: 2776/3680 cut-off events. [2022-12-06 01:58:08,554 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-06 01:58:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11302 conditions, 3680 events. 2776/3680 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13071 event pairs, 1657 based on Foata normal form. 0/2561 useless extension candidates. Maximal degree in co-relation 10498. Up to 3678 conditions per place. [2022-12-06 01:58:08,572 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2022-12-06 01:58:08,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 384 flow [2022-12-06 01:58:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:58:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:58:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 01:58:08,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 01:58:08,576 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-06 01:58:08,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:08,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 61 transitions, 384 flow [2022-12-06 01:58:08,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 61 transitions, 384 flow [2022-12-06 01:58:08,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:09,118 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:58:09,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-06 01:58:09,119 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 384 flow [2022-12-06 01:58:09,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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:58:09,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:09,119 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:09,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:09,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:09,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -572286552, now seen corresponding path program 2 times [2022-12-06 01:58:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:09,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28027630] [2022-12-06 01:58:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:58:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:09,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28027630] [2022-12-06 01:58:09,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28027630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477483025] [2022-12-06 01:58:09,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:58:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:09,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:09,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 01:58:09,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 01:58:09,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:58:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 01:58:09,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:58:10,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:58:10,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477483025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:10,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:58:10,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2022-12-06 01:58:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92581061] [2022-12-06 01:58:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:10,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:10,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:10,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 01:58:10,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:10,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 384 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:10,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:10,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:10,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:11,496 INFO L130 PetriNetUnfolder]: 3116/4199 cut-off events. [2022-12-06 01:58:11,496 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-12-06 01:58:11,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17127 conditions, 4199 events. 3116/4199 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16554 event pairs, 1657 based on Foata normal form. 1/2929 useless extension candidates. Maximal degree in co-relation 14948. Up to 4197 conditions per place. [2022-12-06 01:58:11,518 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 99 selfloop transitions, 2 changer transitions 7/108 dead transitions. [2022-12-06 01:58:11,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 918 flow [2022-12-06 01:58:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:58:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:58:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 01:58:11,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-06 01:58:11,520 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-06 01:58:11,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:11,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 108 transitions, 918 flow [2022-12-06 01:58:11,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 108 transitions, 918 flow [2022-12-06 01:58:11,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:11,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:58:11,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 01:58:11,764 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 108 transitions, 918 flow [2022-12-06 01:58:11,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:11,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:11,764 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:11,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:11,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 01:58:11,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1438852220, now seen corresponding path program 3 times [2022-12-06 01:58:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689419085] [2022-12-06 01:58:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:58:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:12,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689419085] [2022-12-06 01:58:12,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689419085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:12,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93491058] [2022-12-06 01:58:12,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 01:58:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:12,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:12,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 01:58:12,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 01:58:12,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:58:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 01:58:12,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 01:58:12,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:58:12,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93491058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:12,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:58:12,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-06 01:58:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207101418] [2022-12-06 01:58:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:12,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 01:58:12,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:13,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 108 transitions, 918 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:13,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:13,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:14,171 INFO L130 PetriNetUnfolder]: 3321/4561 cut-off events. [2022-12-06 01:58:14,171 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 01:58:14,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23182 conditions, 4561 events. 3321/4561 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19443 event pairs, 1657 based on Foata normal form. 1/3191 useless extension candidates. Maximal degree in co-relation 20071. Up to 4559 conditions per place. [2022-12-06 01:58:14,197 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 162 selfloop transitions, 4 changer transitions 14/180 dead transitions. [2022-12-06 01:58:14,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 180 transitions, 1905 flow [2022-12-06 01:58:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:58:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:58:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 01:58:14,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4163265306122449 [2022-12-06 01:58:14,201 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-06 01:58:14,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:14,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 180 transitions, 1905 flow [2022-12-06 01:58:14,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 180 transitions, 1905 flow [2022-12-06 01:58:14,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:14,220 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:14,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 01:58:14,221 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 180 transitions, 1905 flow [2022-12-06 01:58:14,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:14,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:14,222 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:14,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:14,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:14,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash 237219498, now seen corresponding path program 4 times [2022-12-06 01:58:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:14,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765448322] [2022-12-06 01:58:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:58:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765448322] [2022-12-06 01:58:14,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765448322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:58:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064023188] [2022-12-06 01:58:14,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 01:58:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:58:14,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:58:14,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 01:58:14,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 01:58:14,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:58:14,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 01:58:14,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:58:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:58:14,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:58:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 01:58:14,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064023188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:58:14,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:58:14,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 01:58:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980771958] [2022-12-06 01:58:14,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:58:14,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 01:58:14,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 01:58:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 01:58:14,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:14,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 180 transitions, 1905 flow. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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:58:14,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:14,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:14,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:15,690 INFO L130 PetriNetUnfolder]: 3321/4564 cut-off events. [2022-12-06 01:58:15,691 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 01:58:15,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27762 conditions, 4564 events. 3321/4564 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19427 event pairs, 1657 based on Foata normal form. 0/3193 useless extension candidates. Maximal degree in co-relation 24032. Up to 4562 conditions per place. [2022-12-06 01:58:15,712 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 151 selfloop transitions, 18 changer transitions 14/183 dead transitions. [2022-12-06 01:58:15,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 183 transitions, 2301 flow [2022-12-06 01:58:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:58:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:58:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 01:58:15,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19533527696793002 [2022-12-06 01:58:15,716 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2022-12-06 01:58:15,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:15,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 183 transitions, 2301 flow [2022-12-06 01:58:15,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 183 transitions, 2301 flow [2022-12-06 01:58:15,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:15,733 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:15,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:58:15,734 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 183 transitions, 2301 flow [2022-12-06 01:58:15,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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:58:15,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:15,734 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:15,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 01:58:15,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:58:15,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash -251341777, now seen corresponding path program 5 times [2022-12-06 01:58:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:15,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865529356] [2022-12-06 01:58:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:15,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:17,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865529356] [2022-12-06 01:58:17,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865529356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:17,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:17,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:58:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144244813] [2022-12-06 01:58:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:58:17,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:17,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 183 transitions, 2301 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:17,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:17,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:17,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:18,662 INFO L130 PetriNetUnfolder]: 5208/7206 cut-off events. [2022-12-06 01:58:18,663 INFO L131 PetriNetUnfolder]: For 503/503 co-relation queries the response was YES. [2022-12-06 01:58:18,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50922 conditions, 7206 events. 5208/7206 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 35564 event pairs, 987 based on Foata normal form. 1/5022 useless extension candidates. Maximal degree in co-relation 49158. Up to 7204 conditions per place. [2022-12-06 01:58:18,696 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 288 selfloop transitions, 37 changer transitions 15/340 dead transitions. [2022-12-06 01:58:18,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 340 transitions, 4946 flow [2022-12-06 01:58:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:58:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:58:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 01:58:18,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-06 01:58:18,700 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2022-12-06 01:58:18,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:18,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 340 transitions, 4946 flow [2022-12-06 01:58:18,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 340 transitions, 4946 flow [2022-12-06 01:58:18,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:18,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:18,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 01:58:18,735 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 340 transitions, 4946 flow [2022-12-06 01:58:18,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:18,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:18,736 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:18,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:58:18,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1911207887, now seen corresponding path program 6 times [2022-12-06 01:58:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161606267] [2022-12-06 01:58:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:19,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161606267] [2022-12-06 01:58:19,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161606267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:19,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:19,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:58:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345953946] [2022-12-06 01:58:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:19,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:58:19,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:19,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 340 transitions, 4946 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:19,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:19,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:19,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:21,382 INFO L130 PetriNetUnfolder]: 5948/8285 cut-off events. [2022-12-06 01:58:21,383 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-12-06 01:58:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66871 conditions, 8285 events. 5948/8285 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 42287 event pairs, 987 based on Foata normal form. 1/5777 useless extension candidates. Maximal degree in co-relation 64610. Up to 8283 conditions per place. [2022-12-06 01:58:21,426 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 361 selfloop transitions, 42 changer transitions 17/420 dead transitions. [2022-12-06 01:58:21,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 420 transitions, 6939 flow [2022-12-06 01:58:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:58:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:58:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 01:58:21,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-06 01:58:21,428 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2022-12-06 01:58:21,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:21,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 420 transitions, 6939 flow [2022-12-06 01:58:21,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 420 transitions, 6939 flow [2022-12-06 01:58:21,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:21,464 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:21,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 01:58:21,465 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 420 transitions, 6939 flow [2022-12-06 01:58:21,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:21,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:21,465 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:21,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:58:21,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1405598905, now seen corresponding path program 7 times [2022-12-06 01:58:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:21,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172129848] [2022-12-06 01:58:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172129848] [2022-12-06 01:58:22,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172129848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:22,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:22,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:58:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647823540] [2022-12-06 01:58:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:22,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:22,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:58:22,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:22,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 420 transitions, 6939 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:22,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:22,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:22,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:25,132 INFO L130 PetriNetUnfolder]: 9898/13580 cut-off events. [2022-12-06 01:58:25,133 INFO L131 PetriNetUnfolder]: For 1098/1098 co-relation queries the response was YES. [2022-12-06 01:58:25,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123096 conditions, 13580 events. 9898/13580 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 70254 event pairs, 979 based on Foata normal form. 1/9476 useless extension candidates. Maximal degree in co-relation 120331. Up to 13578 conditions per place. [2022-12-06 01:58:25,209 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 487 selfloop transitions, 66 changer transitions 24/577 dead transitions. [2022-12-06 01:58:25,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 577 transitions, 10650 flow [2022-12-06 01:58:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:58:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:58:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2022-12-06 01:58:25,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2022-12-06 01:58:25,211 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2022-12-06 01:58:25,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:25,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 577 transitions, 10650 flow [2022-12-06 01:58:25,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 577 transitions, 10650 flow [2022-12-06 01:58:25,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:25,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:25,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 01:58:25,273 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 577 transitions, 10650 flow [2022-12-06 01:58:25,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:25,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:25,273 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:25,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:58:25,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -743982027, now seen corresponding path program 8 times [2022-12-06 01:58:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751822239] [2022-12-06 01:58:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:26,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751822239] [2022-12-06 01:58:26,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751822239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:26,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:26,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:58:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643927842] [2022-12-06 01:58:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:26,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:58:26,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:58:26,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:58:26,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:26,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 577 transitions, 10650 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:26,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:26,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:26,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:29,643 INFO L130 PetriNetUnfolder]: 12109/16566 cut-off events. [2022-12-06 01:58:29,644 INFO L131 PetriNetUnfolder]: For 1255/1255 co-relation queries the response was YES. [2022-12-06 01:58:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166602 conditions, 16566 events. 12109/16566 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 88024 event pairs, 789 based on Foata normal form. 1/11522 useless extension candidates. Maximal degree in co-relation 163344. Up to 16564 conditions per place. [2022-12-06 01:58:29,760 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 594 selfloop transitions, 132 changer transitions 26/752 dead transitions. [2022-12-06 01:58:29,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 752 transitions, 15349 flow [2022-12-06 01:58:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:58:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:58:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-12-06 01:58:29,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2022-12-06 01:58:29,761 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2022-12-06 01:58:29,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:29,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 752 transitions, 15349 flow [2022-12-06 01:58:29,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 752 transitions, 15349 flow [2022-12-06 01:58:29,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:29,865 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:29,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 01:58:29,866 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 752 transitions, 15349 flow [2022-12-06 01:58:29,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:58:29,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:29,866 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:29,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:58:29,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1914430794, now seen corresponding path program 1 times [2022-12-06 01:58:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:29,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589421624] [2022-12-06 01:58:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:29,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:29,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589421624] [2022-12-06 01:58:29,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589421624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:29,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:29,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:58:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191800127] [2022-12-06 01:58:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:29,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:58:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:58:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:58:29,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:29,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 752 transitions, 15349 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:29,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:29,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:29,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:34,549 INFO L130 PetriNetUnfolder]: 16902/22879 cut-off events. [2022-12-06 01:58:34,549 INFO L131 PetriNetUnfolder]: For 1314/1314 co-relation queries the response was YES. [2022-12-06 01:58:34,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252822 conditions, 22879 events. 16902/22879 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 119600 event pairs, 495 based on Foata normal form. 0/15936 useless extension candidates. Maximal degree in co-relation 248974. Up to 22877 conditions per place. [2022-12-06 01:58:34,700 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 892 selfloop transitions, 32 changer transitions 26/950 dead transitions. [2022-12-06 01:58:34,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 950 transitions, 21221 flow [2022-12-06 01:58:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:58:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:58:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-06 01:58:34,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2022-12-06 01:58:34,707 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2022-12-06 01:58:34,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:34,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 950 transitions, 21221 flow [2022-12-06 01:58:34,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 950 transitions, 21221 flow [2022-12-06 01:58:34,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:34,818 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:34,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 01:58:34,819 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 950 transitions, 21221 flow [2022-12-06 01:58:34,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:34,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:34,819 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:58:34,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1081186558, now seen corresponding path program 1 times [2022-12-06 01:58:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958909433] [2022-12-06 01:58:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:34,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958909433] [2022-12-06 01:58:34,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958909433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:34,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:34,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:58:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665644527] [2022-12-06 01:58:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:34,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:58:34,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:58:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:58:34,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:34,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 950 transitions, 21221 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:34,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:34,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:34,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:42,472 INFO L130 PetriNetUnfolder]: 25260/34103 cut-off events. [2022-12-06 01:58:42,473 INFO L131 PetriNetUnfolder]: For 1875/1875 co-relation queries the response was YES. [2022-12-06 01:58:42,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410898 conditions, 34103 events. 25260/34103 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 184558 event pairs, 361 based on Foata normal form. 0/24264 useless extension candidates. Maximal degree in co-relation 406710. Up to 34101 conditions per place. [2022-12-06 01:58:42,729 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 1197 selfloop transitions, 66 changer transitions 26/1289 dead transitions. [2022-12-06 01:58:42,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 1289 transitions, 31317 flow [2022-12-06 01:58:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:58:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:58:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-06 01:58:42,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2022-12-06 01:58:42,730 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places. [2022-12-06 01:58:42,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:42,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 1289 transitions, 31317 flow [2022-12-06 01:58:42,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 1289 transitions, 31317 flow [2022-12-06 01:58:42,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:42,916 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:42,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 01:58:42,916 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 1289 transitions, 31317 flow [2022-12-06 01:58:42,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:42,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:42,917 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:42,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:58:42,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1775316422, now seen corresponding path program 1 times [2022-12-06 01:58:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:42,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499756977] [2022-12-06 01:58:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:58:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499756977] [2022-12-06 01:58:43,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499756977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:43,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:43,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:58:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442803153] [2022-12-06 01:58:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:58:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:58:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:58:43,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:43,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1289 transitions, 31317 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:43,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:43,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:43,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:58:52,717 INFO L130 PetriNetUnfolder]: 27206/37015 cut-off events. [2022-12-06 01:58:52,717 INFO L131 PetriNetUnfolder]: For 1984/1984 co-relation queries the response was YES. [2022-12-06 01:58:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482893 conditions, 37015 events. 27206/37015 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 206172 event pairs, 273 based on Foata normal form. 0/27450 useless extension candidates. Maximal degree in co-relation 478466. Up to 37013 conditions per place. [2022-12-06 01:58:53,008 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 1493 selfloop transitions, 54 changer transitions 42/1589 dead transitions. [2022-12-06 01:58:53,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 1589 transitions, 41770 flow [2022-12-06 01:58:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:58:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:58:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-06 01:58:53,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2022-12-06 01:58:53,009 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places. [2022-12-06 01:58:53,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:58:53,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 1589 transitions, 41770 flow [2022-12-06 01:58:53,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 1589 transitions, 41770 flow [2022-12-06 01:58:53,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:58:53,313 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:58:53,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 01:58:53,314 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 1589 transitions, 41770 flow [2022-12-06 01:58:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:58:53,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:58:53,314 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:58:53,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:58:53,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:58:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:58:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1730692770, now seen corresponding path program 1 times [2022-12-06 01:58:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:58:53,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460913945] [2022-12-06 01:58:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:58:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:58:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:58:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 01:58:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:58:53,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460913945] [2022-12-06 01:58:53,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460913945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:58:53,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:58:53,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:58:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352742409] [2022-12-06 01:58:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:58:53,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:58:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:58:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:58:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:58:53,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:58:53,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 1589 transitions, 41770 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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:58:53,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:58:53,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:58:53,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:04,633 INFO L130 PetriNetUnfolder]: 27954/38151 cut-off events. [2022-12-06 01:59:04,633 INFO L131 PetriNetUnfolder]: For 2278/2278 co-relation queries the response was YES. [2022-12-06 01:59:04,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535917 conditions, 38151 events. 27954/38151 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 214487 event pairs, 63 based on Foata normal form. 4/28278 useless extension candidates. Maximal degree in co-relation 530642. Up to 38149 conditions per place. [2022-12-06 01:59:05,046 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 1542 selfloop transitions, 22 changer transitions 296/1860 dead transitions. [2022-12-06 01:59:05,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1860 transitions, 52623 flow [2022-12-06 01:59:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:59:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:59:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-06 01:59:05,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2022-12-06 01:59:05,047 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-12-06 01:59:05,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:05,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1860 transitions, 52623 flow [2022-12-06 01:59:05,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1860 transitions, 52623 flow [2022-12-06 01:59:05,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:05,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:05,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 01:59:05,272 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1860 transitions, 52623 flow [2022-12-06 01:59:05,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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:59:05,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:05,272 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:59:05,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:59:05,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1519137846, now seen corresponding path program 2 times [2022-12-06 01:59:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115697376] [2022-12-06 01:59:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 01:59:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115697376] [2022-12-06 01:59:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115697376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:05,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:59:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706357437] [2022-12-06 01:59:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:59:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:59:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:59:05,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:59:05,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1860 transitions, 52623 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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:59:05,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:05,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:59:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:18,001 INFO L130 PetriNetUnfolder]: 27954/38147 cut-off events. [2022-12-06 01:59:18,001 INFO L131 PetriNetUnfolder]: For 2286/2286 co-relation queries the response was YES. [2022-12-06 01:59:18,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574009 conditions, 38147 events. 27954/38147 cut-off events. For 2286/2286 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 214542 event pairs, 63 based on Foata normal form. 4/28274 useless extension candidates. Maximal degree in co-relation 568426. Up to 38145 conditions per place. [2022-12-06 01:59:18,292 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 1325 selfloop transitions, 7 changer transitions 524/1856 dead transitions. [2022-12-06 01:59:18,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 1856 transitions, 56223 flow [2022-12-06 01:59:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:59:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:59:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-06 01:59:18,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2022-12-06 01:59:18,293 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 51 predicate places. [2022-12-06 01:59:18,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:18,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 1856 transitions, 56223 flow [2022-12-06 01:59:18,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 1856 transitions, 56223 flow [2022-12-06 01:59:18,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:18,527 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:18,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 01:59:18,528 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 1856 transitions, 56223 flow [2022-12-06 01:59:18,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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:59:18,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:18,528 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 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:59:18,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:59:18,529 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash -761456723, now seen corresponding path program 1 times [2022-12-06 01:59:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:18,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459394539] [2022-12-06 01:59:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:59:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459394539] [2022-12-06 01:59:18,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459394539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:59:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180806986] [2022-12-06 01:59:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:18,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:59:18,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:59:18,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:59:18,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 01:59:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:19,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 01:59:19,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:59:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:59:19,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:59:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 01:59:19,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180806986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:59:19,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:59:19,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 01:59:19,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169437273] [2022-12-06 01:59:19,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:59:19,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:59:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:59:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:59:19,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:59:19,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 1856 transitions, 56223 flow. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 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:59:19,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:19,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:59:19,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:59:38,469 INFO L130 PetriNetUnfolder]: 39519/53957 cut-off events. [2022-12-06 01:59:38,469 INFO L131 PetriNetUnfolder]: For 2754/2754 co-relation queries the response was YES. [2022-12-06 01:59:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865511 conditions, 53957 events. 39519/53957 cut-off events. For 2754/2754 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 313844 event pairs, 119 based on Foata normal form. 1/39871 useless extension candidates. Maximal degree in co-relation 857395. Up to 53955 conditions per place. [2022-12-06 01:59:38,940 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 1875 selfloop transitions, 168 changer transitions 647/2690 dead transitions. [2022-12-06 01:59:38,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 2690 transitions, 86794 flow [2022-12-06 01:59:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:59:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:59:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2022-12-06 01:59:38,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-06 01:59:38,941 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2022-12-06 01:59:38,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:59:38,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 2690 transitions, 86794 flow [2022-12-06 01:59:39,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 2690 transitions, 86794 flow [2022-12-06 01:59:39,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:59:39,324 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:59:39,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-06 01:59:39,325 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 2690 transitions, 86794 flow [2022-12-06 01:59:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 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:59:39,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:59:39,325 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 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:59:39,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 01:59:39,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 01:59:39,527 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:59:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:59:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1489615757, now seen corresponding path program 2 times [2022-12-06 01:59:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:59:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277671680] [2022-12-06 01:59:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:59:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:59:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:59:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 01:59:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:59:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277671680] [2022-12-06 01:59:39,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277671680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:59:39,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:59:39,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:59:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685412051] [2022-12-06 01:59:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:59:39,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:59:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:59:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:59:39,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:59:39,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 01:59:39,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 2690 transitions, 86794 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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:59:39,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:59:39,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 01:59:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:00:08,708 INFO L130 PetriNetUnfolder]: 49251/67209 cut-off events. [2022-12-06 02:00:08,708 INFO L131 PetriNetUnfolder]: For 3183/3183 co-relation queries the response was YES. [2022-12-06 02:00:08,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144944 conditions, 67209 events. 49251/67209 cut-off events. For 3183/3183 co-relation queries the response was YES. Maximal size of possible extension queue 1723. Compared 399181 event pairs, 260 based on Foata normal form. 1/49515 useless extension candidates. Maximal degree in co-relation 1135325. Up to 67207 conditions per place. [2022-12-06 02:00:09,358 INFO L137 encePairwiseOnDemand]: 40/49 looper letters, 2505 selfloop transitions, 131 changer transitions 746/3382 dead transitions. [2022-12-06 02:00:09,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 3382 transitions, 115834 flow [2022-12-06 02:00:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:00:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:00:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2022-12-06 02:00:09,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2022-12-06 02:00:09,359 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2022-12-06 02:00:09,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:00:09,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 3382 transitions, 115834 flow [2022-12-06 02:00:09,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 3382 transitions, 115834 flow [2022-12-06 02:00:09,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:00:09,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:00:09,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 534 [2022-12-06 02:00:09,894 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 3382 transitions, 115834 flow [2022-12-06 02:00:09,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 02:00:09,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:00:09,894 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 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 02:00:09,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 02:00:09,894 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:00:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:00:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash -346129188, now seen corresponding path program 1 times [2022-12-06 02:00:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:00:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785537186] [2022-12-06 02:00:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:00:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:00:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:00:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 02:00:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:00:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785537186] [2022-12-06 02:00:10,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785537186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:00:10,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:00:10,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:00:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743556968] [2022-12-06 02:00:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:00:10,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:00:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:00:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:00:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:00:10,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 02:00:10,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 3382 transitions, 115834 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 02:00:10,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:00:10,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 02:00:10,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:01:07,578 INFO L130 PetriNetUnfolder]: 70294/96416 cut-off events. [2022-12-06 02:01:07,579 INFO L131 PetriNetUnfolder]: For 4466/4466 co-relation queries the response was YES. [2022-12-06 02:01:07,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739001 conditions, 96416 events. 70294/96416 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 2421. Compared 602179 event pairs, 394 based on Foata normal form. 1654/73263 useless extension candidates. Maximal degree in co-relation 1728827. Up to 96414 conditions per place. [2022-12-06 02:01:08,477 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 4615 selfloop transitions, 484 changer transitions 1250/6349 dead transitions. [2022-12-06 02:01:08,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 6349 transitions, 230076 flow [2022-12-06 02:01:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:01:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:01:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-06 02:01:08,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-06 02:01:08,478 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places. [2022-12-06 02:01:08,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:01:08,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 6349 transitions, 230076 flow [2022-12-06 02:01:09,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 6349 transitions, 230076 flow [2022-12-06 02:01:09,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:01:09,374 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:01:09,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 896 [2022-12-06 02:01:09,374 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 6349 transitions, 230076 flow [2022-12-06 02:01:09,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 02:01:09,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:01:09,375 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 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 02:01:09,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 02:01:09,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:01:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:01:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 195998858, now seen corresponding path program 2 times [2022-12-06 02:01:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:01:09,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222149682] [2022-12-06 02:01:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:01:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:01:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:01:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 02:01:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:01:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222149682] [2022-12-06 02:01:09,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222149682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:01:09,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:01:09,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:01:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799916678] [2022-12-06 02:01:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:01:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:01:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:01:09,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:01:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:01:09,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 02:01:09,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 6349 transitions, 230076 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 02:01:09,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:01:09,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 02:01:09,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:03:48,272 INFO L130 PetriNetUnfolder]: 77819/106861 cut-off events. [2022-12-06 02:03:48,273 INFO L131 PetriNetUnfolder]: For 4710/4710 co-relation queries the response was YES. [2022-12-06 02:03:48,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034297 conditions, 106861 events. 77819/106861 cut-off events. For 4710/4710 co-relation queries the response was YES. Maximal size of possible extension queue 2628. Compared 675698 event pairs, 280 based on Foata normal form. 844/80159 useless extension candidates. Maximal degree in co-relation 2023568. Up to 106859 conditions per place. [2022-12-06 02:03:49,356 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 6074 selfloop transitions, 575 changer transitions 1425/8074 dead transitions. [2022-12-06 02:03:49,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 8074 transitions, 308726 flow [2022-12-06 02:03:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:03:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:03:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 02:03:49,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 02:03:49,357 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 71 predicate places. [2022-12-06 02:03:49,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:03:49,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 8074 transitions, 308726 flow [2022-12-06 02:03:50,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 8074 transitions, 308726 flow [2022-12-06 02:03:50,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:03:50,437 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:03:50,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 02:03:50,443 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 8074 transitions, 308726 flow [2022-12-06 02:03:50,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 02:03:50,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:03:50,443 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 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 02:03:50,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 02:03:50,443 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:03:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:03:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash 52608705, now seen corresponding path program 3 times [2022-12-06 02:03:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:03:50,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692586130] [2022-12-06 02:03:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:03:50,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:03:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:03:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 02:03:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:03:50,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692586130] [2022-12-06 02:03:50,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692586130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:03:50,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110789044] [2022-12-06 02:03:50,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:03:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:03:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:03:50,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:03:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:03:51,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:03:51,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:03:51,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 02:03:51,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:03:51,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:03:51,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-12-06 02:03:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 02:03:51,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:03:51,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:03:51,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2022-12-06 02:03:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 02:03:51,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110789044] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:03:51,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:03:51,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 16 [2022-12-06 02:03:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268941619] [2022-12-06 02:03:51,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:03:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:03:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:03:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:03:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:03:51,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 02:03:51,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 8074 transitions, 308726 flow. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 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 02:03:51,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:03:51,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 02:03:51,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:10:47,121 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:10:47,121 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:10:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-06 02:10:47,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:10:47,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:10:47,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:10:47,735 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 4249560 conditions, 212014 events (154056/212013 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 9278. Compared 1575702 event pairs, 226 based on Foata normal form. 6/164111 useless extension candidates. Maximal degree in co-relation 4046444. Up to 212011 conditions per place.). [2022-12-06 02:10:47,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:10:47,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:10:47,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:10:47,737 INFO L458 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1, 1] [2022-12-06 02:10:47,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:10:47,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:10:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:10:47 BasicIcfg [2022-12-06 02:10:47,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:10:47,741 INFO L158 Benchmark]: Toolchain (without parser) took 789202.29ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 159.6MB in the beginning and 579.9MB in the end (delta: -420.3MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-12-06 02:10:47,741 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 95.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:10:47,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.87ms. Allocated memory is still 183.5MB. Free memory was 159.6MB in the beginning and 144.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:10:47,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.06ms. Allocated memory is still 183.5MB. Free memory was 144.4MB in the beginning and 140.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 02:10:47,742 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 183.5MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:10:47,742 INFO L158 Benchmark]: RCFGBuilder took 887.29ms. Allocated memory is still 183.5MB. Free memory was 137.1MB in the beginning and 93.5MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-06 02:10:47,742 INFO L158 Benchmark]: TraceAbstraction took 787901.62ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 93.0MB in the beginning and 579.9MB in the end (delta: -486.9MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-12-06 02:10:47,744 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.15ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 95.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.87ms. Allocated memory is still 183.5MB. Free memory was 159.6MB in the beginning and 144.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.06ms. Allocated memory is still 183.5MB. Free memory was 144.4MB in the beginning and 140.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 183.5MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 887.29ms. Allocated memory is still 183.5MB. Free memory was 137.1MB in the beginning and 93.5MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 787901.62ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 93.0MB in the beginning and 579.9MB in the end (delta: -486.9MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5s, 614 PlacesBefore, 46 PlacesAfterwards, 677 TransitionsBefore, 49 TransitionsAfterwards, 153384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 174 TrivialYvCompositions, 394 ConcurrentYvCompositions, 60 ChoiceCompositions, 632 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 108276, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94688, independent: 94633, independent conditional: 0, independent unconditional: 94633, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94688, independent: 94633, independent conditional: 0, independent unconditional: 94633, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108369, independent: 13643, independent conditional: 0, independent unconditional: 13643, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 94688, unknown conditional: 0, unknown unconditional: 94688] , Statistics on independence cache: Total cache size (in pairs): 213974, Positive cache size: 213919, Positive conditional cache size: 0, Positive unconditional cache size: 213919, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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.4s, 48 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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.5s, 53 PlacesBefore, 53 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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.2s, 57 PlacesBefore, 57 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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, 61 PlacesBefore, 61 PlacesAfterwards, 180 TransitionsBefore, 180 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, 67 PlacesBefore, 67 PlacesAfterwards, 183 TransitionsBefore, 183 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, 71 PlacesBefore, 71 PlacesAfterwards, 340 TransitionsBefore, 340 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, 75 PlacesBefore, 75 PlacesAfterwards, 420 TransitionsBefore, 420 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, 79 PlacesBefore, 79 PlacesAfterwards, 577 TransitionsBefore, 577 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, 85 PlacesBefore, 85 PlacesAfterwards, 752 TransitionsBefore, 752 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, 87 PlacesBefore, 87 PlacesAfterwards, 950 TransitionsBefore, 950 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, 89 PlacesBefore, 89 PlacesAfterwards, 1289 TransitionsBefore, 1289 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, 91 PlacesBefore, 91 PlacesAfterwards, 1589 TransitionsBefore, 1589 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, 1860 TransitionsBefore, 1860 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, 97 PlacesBefore, 97 PlacesAfterwards, 1856 TransitionsBefore, 1856 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, 104 PlacesBefore, 104 PlacesAfterwards, 2690 TransitionsBefore, 2690 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, 109 PlacesBefore, 109 PlacesAfterwards, 3382 TransitionsBefore, 3382 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, 112 PlacesBefore, 112 PlacesAfterwards, 6349 TransitionsBefore, 6349 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, 117 PlacesBefore, 117 PlacesAfterwards, 8074 TransitionsBefore, 8074 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 - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 4249560 conditions, 212014 events (154056/212013 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 9278. Compared 1575702 event pairs, 226 based on Foata normal form. 6/164111 useless extension candidates. Maximal degree in co-relation 4046444. Up to 212011 conditions per place.). - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 4249560 conditions, 212014 events (154056/212013 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 9278. Compared 1575702 event pairs, 226 based on Foata normal form. 6/164111 useless extension candidates. Maximal degree in co-relation 4046444. Up to 212011 conditions per place.). - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 4249560 conditions, 212014 events (154056/212013 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 9278. Compared 1575702 event pairs, 226 based on Foata normal form. 6/164111 useless extension candidates. Maximal degree in co-relation 4046444. Up to 212011 conditions per place.). - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 4249560 conditions, 212014 events (154056/212013 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 9278. Compared 1575702 event pairs, 226 based on Foata normal form. 6/164111 useless extension candidates. Maximal degree in co-relation 4046444. Up to 212011 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1026 locations, 4 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: 787.7s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 743.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1970 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1970 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9012 IncrementalHoareTripleChecker+Invalid, 9178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 0 mSDtfsCounter, 9012 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 394 SyntacticMatches, 3 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308726occurred in iteration=18, InterpolantAutomatonStates: 89, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 842 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 946 ConstructedInterpolants, 6 QuantifiedInterpolants, 6975 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1842 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 981/1040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown