/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-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:45:08,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:45:08,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:45:08,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:45:08,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:45:08,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:45:08,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:45:08,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:45:08,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:45:08,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:45:08,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:45:08,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:45:08,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:45:08,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:45:08,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:45:08,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:45:08,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:45:08,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:45:08,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:45:08,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:45:08,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:45:08,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:45:08,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:45:08,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:45:08,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:45:08,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:45:08,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:45:08,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:45:08,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:45:08,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:45:08,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:45:08,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:45:08,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:45:08,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:45:08,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:45:08,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:45:08,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:45:08,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:45:08,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:45:08,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:45:08,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:45:08,257 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:45:08,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:45:08,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:45:08,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:45:08,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:45:08,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:45:08,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:45:08,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:45:08,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:45:08,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:45:08,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:45:08,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:45:08,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:45:08,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:45:08,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:45:08,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:45:08,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:45:08,300 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:45:08,300 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:45:08,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:45:08,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:45:08,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:45:08,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:45:08,592 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:45:08,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-06 01:45:09,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:45:10,004 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:45:10,004 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-06 01:45:10,010 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd0b1fa9/d36f15ef2cf54bb4b1f1a1ccef5b66ce/FLAG6bb47efb0 [2022-12-06 01:45:10,026 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd0b1fa9/d36f15ef2cf54bb4b1f1a1ccef5b66ce [2022-12-06 01:45:10,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:45:10,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:45:10,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:45:10,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:45:10,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:45:10,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ceeb427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10, skipping insertion in model container [2022-12-06 01:45:10,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:45:10,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:45:10,238 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-array-int-trans.wvr.c[2728,2741] [2022-12-06 01:45:10,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:45:10,265 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:45:10,303 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-array-int-trans.wvr.c[2728,2741] [2022-12-06 01:45:10,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:45:10,324 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:45:10,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10 WrapperNode [2022-12-06 01:45:10,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:45:10,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:45:10,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:45:10,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:45:10,335 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:45:10" (1/1) ... [2022-12-06 01:45:10,356 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:45:10" (1/1) ... [2022-12-06 01:45:10,400 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 277 [2022-12-06 01:45:10,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:45:10,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:45:10,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:45:10,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:45:10,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:45:10,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:45:10,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:45:10,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:45:10,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (1/1) ... [2022-12-06 01:45:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:45:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:45:10,496 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:45:10,502 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:45:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 01:45:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 01:45:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 01:45:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 01:45:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 01:45:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:45:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 01:45:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:45:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:45:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:45:10,526 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:45:10,625 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:45:10,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:45:11,037 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:45:11,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:45:11,046 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 01:45:11,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:45:11 BoogieIcfgContainer [2022-12-06 01:45:11,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:45:11,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:45:11,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:45:11,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:45:11,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:45:10" (1/3) ... [2022-12-06 01:45:11,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390c877b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:45:11, skipping insertion in model container [2022-12-06 01:45:11,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:45:10" (2/3) ... [2022-12-06 01:45:11,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390c877b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:45:11, skipping insertion in model container [2022-12-06 01:45:11,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:45:11" (3/3) ... [2022-12-06 01:45:11,054 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2022-12-06 01:45:11,066 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:45:11,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:45:11,067 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:45:11,133 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 01:45:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 01:45:11,351 INFO L130 PetriNetUnfolder]: 28/309 cut-off events. [2022-12-06 01:45:11,351 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:45:11,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 309 events. 28/309 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 508 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 01:45:11,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 01:45:11,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 299 transitions, 616 flow [2022-12-06 01:45:11,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:11,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-06 01:45:11,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 299 transitions, 616 flow [2022-12-06 01:45:11,455 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-12-06 01:45:11,456 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:45:11,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 508 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 01:45:11,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-06 01:45:11,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-06 01:45:20,555 INFO L203 LiptonReduction]: Total number of compositions: 263 [2022-12-06 01:45:20,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:45:20,579 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;@6fab737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:45:20,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:45:20,584 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-06 01:45:20,584 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:45:20,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:20,585 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:45:20,585 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:45:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1970597914, now seen corresponding path program 1 times [2022-12-06 01:45:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:20,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390681200] [2022-12-06 01:45:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:21,154 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:45:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390681200] [2022-12-06 01:45:21,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390681200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:21,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:21,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:45:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609875965] [2022-12-06 01:45:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:21,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:45:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:45:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:45:21,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 01:45:21,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:45:21,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:21,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 01:45:21,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:21,609 INFO L130 PetriNetUnfolder]: 2196/3223 cut-off events. [2022-12-06 01:45:21,609 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-06 01:45:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6642 conditions, 3223 events. 2196/3223 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14585 event pairs, 842 based on Foata normal form. 2/2391 useless extension candidates. Maximal degree in co-relation 1869. Up to 851 conditions per place. [2022-12-06 01:45:21,624 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 130 selfloop transitions, 8 changer transitions 12/152 dead transitions. [2022-12-06 01:45:21,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 152 transitions, 694 flow [2022-12-06 01:45:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:45:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:45:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-12-06 01:45:21,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 01:45:21,638 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-06 01:45:21,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:21,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 152 transitions, 694 flow [2022-12-06 01:45:21,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 152 transitions, 694 flow [2022-12-06 01:45:21,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 01:45:25,551 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:45:25,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3914 [2022-12-06 01:45:25,553 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 149 transitions, 686 flow [2022-12-06 01:45:25,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:45:25,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:25,553 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:45:25,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:45:25,553 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:45:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:25,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1046584421, now seen corresponding path program 1 times [2022-12-06 01:45:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651257097] [2022-12-06 01:45:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:25,904 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:45:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:25,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651257097] [2022-12-06 01:45:25,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651257097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:25,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:25,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:45:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794621685] [2022-12-06 01:45:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:25,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:45:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:45:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:45:25,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 01:45:25,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 149 transitions, 686 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:45:25,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:25,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 01:45:25,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:26,570 INFO L130 PetriNetUnfolder]: 2774/3935 cut-off events. [2022-12-06 01:45:26,571 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-06 01:45:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12197 conditions, 3935 events. 2774/3935 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17190 event pairs, 752 based on Foata normal form. 1/2937 useless extension candidates. Maximal degree in co-relation 3240. Up to 2193 conditions per place. [2022-12-06 01:45:26,584 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 146 selfloop transitions, 14 changer transitions 80/240 dead transitions. [2022-12-06 01:45:26,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 240 transitions, 1578 flow [2022-12-06 01:45:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:45:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:45:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-12-06 01:45:26,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3404761904761905 [2022-12-06 01:45:26,586 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 01:45:26,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:26,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 240 transitions, 1578 flow [2022-12-06 01:45:26,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 240 transitions, 1578 flow [2022-12-06 01:45:26,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:27,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:45:27,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-06 01:45:27,157 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 239 transitions, 1572 flow [2022-12-06 01:45:27,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:45:27,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:27,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:27,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:45:27,158 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:45:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1822568905, now seen corresponding path program 1 times [2022-12-06 01:45:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:27,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743206089] [2022-12-06 01:45:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:27,238 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:45:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743206089] [2022-12-06 01:45:27,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743206089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:27,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:27,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:45:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10407264] [2022-12-06 01:45:27,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:45:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:27,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:45:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:45:27,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 01:45:27,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 239 transitions, 1572 flow. Second operand has 4 states, 4 states have (on average 5.75) 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:45:27,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:27,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 01:45:27,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:27,585 INFO L130 PetriNetUnfolder]: 1916/2748 cut-off events. [2022-12-06 01:45:27,585 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-06 01:45:27,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 2748 events. 1916/2748 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11550 event pairs, 544 based on Foata normal form. 0/2121 useless extension candidates. Maximal degree in co-relation 3469. Up to 1722 conditions per place. [2022-12-06 01:45:27,594 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 54 selfloop transitions, 0 changer transitions 161/215 dead transitions. [2022-12-06 01:45:27,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 215 transitions, 1834 flow [2022-12-06 01:45:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:45:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:45:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 01:45:27,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 01:45:27,597 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 01:45:27,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:27,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 215 transitions, 1834 flow [2022-12-06 01:45:27,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 215 transitions, 1834 flow [2022-12-06 01:45:27,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:27,610 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:27,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 01:45:27,611 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 215 transitions, 1834 flow [2022-12-06 01:45:27,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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:45:27,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:27,612 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:45:27,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:45:27,612 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:45:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 264897750, now seen corresponding path program 1 times [2022-12-06 01:45:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040502651] [2022-12-06 01:45:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:27,785 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:45:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040502651] [2022-12-06 01:45:27,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040502651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:27,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:27,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:45:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838560450] [2022-12-06 01:45:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:27,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:45:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:45:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:45:27,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:45:27,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 215 transitions, 1834 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:45:27,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:27,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:45:27,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:28,298 INFO L130 PetriNetUnfolder]: 3210/4594 cut-off events. [2022-12-06 01:45:28,298 INFO L131 PetriNetUnfolder]: For 452/452 co-relation queries the response was YES. [2022-12-06 01:45:28,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23433 conditions, 4594 events. 3210/4594 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21287 event pairs, 682 based on Foata normal form. 1/3521 useless extension candidates. Maximal degree in co-relation 4908. Up to 3568 conditions per place. [2022-12-06 01:45:28,312 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 115 selfloop transitions, 8 changer transitions 234/357 dead transitions. [2022-12-06 01:45:28,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 357 transitions, 3759 flow [2022-12-06 01:45:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:45:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:45:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-06 01:45:28,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.605 [2022-12-06 01:45:28,314 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-06 01:45:28,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:28,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 357 transitions, 3759 flow [2022-12-06 01:45:28,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 357 transitions, 3759 flow [2022-12-06 01:45:28,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:28,335 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:28,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 01:45:28,335 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 357 transitions, 3759 flow [2022-12-06 01:45:28,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:45:28,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:28,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:28,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:45:28,336 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:45:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1855047123, now seen corresponding path program 1 times [2022-12-06 01:45:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136431520] [2022-12-06 01:45:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136431520] [2022-12-06 01:45:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136431520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:28,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485728314] [2022-12-06 01:45:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:28,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:28,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:45:28,464 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:45:28,470 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:45:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 01:45:28,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:45:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:28,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:45:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:28,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485728314] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:28,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 01:45:28,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-12-06 01:45:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110547816] [2022-12-06 01:45:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:28,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:45:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:45:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:45:28,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:45:28,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 357 transitions, 3759 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:28,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:28,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:45:28,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:29,578 INFO L130 PetriNetUnfolder]: 3921/5728 cut-off events. [2022-12-06 01:45:29,579 INFO L131 PetriNetUnfolder]: For 640/640 co-relation queries the response was YES. [2022-12-06 01:45:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34989 conditions, 5728 events. 3921/5728 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 28572 event pairs, 618 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 7258. Up to 4702 conditions per place. [2022-12-06 01:45:29,613 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 158 selfloop transitions, 13 changer transitions 298/469 dead transitions. [2022-12-06 01:45:29,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 469 transitions, 5901 flow [2022-12-06 01:45:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:45:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:45:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2022-12-06 01:45:29,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.434375 [2022-12-06 01:45:29,618 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-06 01:45:29,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:29,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 469 transitions, 5901 flow [2022-12-06 01:45:29,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 469 transitions, 5901 flow [2022-12-06 01:45:29,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:29,659 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:29,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 01:45:29,661 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 469 transitions, 5901 flow [2022-12-06 01:45:29,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:29,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:29,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:29,679 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:45:29,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:29,866 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:45:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 238829793, now seen corresponding path program 1 times [2022-12-06 01:45:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:29,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182605620] [2022-12-06 01:45:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:29,972 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:45:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182605620] [2022-12-06 01:45:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182605620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:29,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:29,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:45:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205808677] [2022-12-06 01:45:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:45:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:45:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:45:29,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:45:29,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 469 transitions, 5901 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:29,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:29,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:45:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:30,665 INFO L130 PetriNetUnfolder]: 3053/4589 cut-off events. [2022-12-06 01:45:30,666 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-06 01:45:30,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32668 conditions, 4589 events. 3053/4589 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23210 event pairs, 452 based on Foata normal form. 0/3732 useless extension candidates. Maximal degree in co-relation 8451. Up to 3536 conditions per place. [2022-12-06 01:45:30,681 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 74 selfloop transitions, 2 changer transitions 433/509 dead transitions. [2022-12-06 01:45:30,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 509 transitions, 7441 flow [2022-12-06 01:45:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:45:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:45:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 01:45:30,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2022-12-06 01:45:30,684 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-06 01:45:30,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:30,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 509 transitions, 7441 flow [2022-12-06 01:45:30,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 509 transitions, 7441 flow [2022-12-06 01:45:30,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:30,708 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:30,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 01:45:30,708 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 509 transitions, 7441 flow [2022-12-06 01:45:30,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:30,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:30,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:45:30,709 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:45:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1860401031, now seen corresponding path program 1 times [2022-12-06 01:45:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:30,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87540819] [2022-12-06 01:45:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:30,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87540819] [2022-12-06 01:45:30,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87540819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315157892] [2022-12-06 01:45:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:30,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:45:30,864 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:45:30,867 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:45:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:30,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 01:45:30,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:45:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:31,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:45:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:31,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315157892] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:31,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 01:45:31,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2022-12-06 01:45:31,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912828003] [2022-12-06 01:45:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:31,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:45:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:31,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:45:31,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:45:31,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:45:31,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 509 transitions, 7441 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:45:31,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:31,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:45:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:31,946 INFO L130 PetriNetUnfolder]: 3427/5234 cut-off events. [2022-12-06 01:45:31,947 INFO L131 PetriNetUnfolder]: For 672/672 co-relation queries the response was YES. [2022-12-06 01:45:31,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42507 conditions, 5234 events. 3427/5234 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 27541 event pairs, 266 based on Foata normal form. 0/4279 useless extension candidates. Maximal degree in co-relation 12740. Up to 4107 conditions per place. [2022-12-06 01:45:31,966 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 103 selfloop transitions, 13 changer transitions 502/618 dead transitions. [2022-12-06 01:45:31,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 618 transitions, 10284 flow [2022-12-06 01:45:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:45:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:45:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-06 01:45:31,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2022-12-06 01:45:31,969 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 01:45:31,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:31,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 618 transitions, 10284 flow [2022-12-06 01:45:32,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 618 transitions, 10284 flow [2022-12-06 01:45:32,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:32,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:32,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 01:45:32,007 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 618 transitions, 10284 flow [2022-12-06 01:45:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:45:32,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:32,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:32,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 01:45:32,230 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,SelfDestructingSolverStorable6 [2022-12-06 01:45:32,230 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:45:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash -515894236, now seen corresponding path program 1 times [2022-12-06 01:45:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123420036] [2022-12-06 01:45:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:33,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:33,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123420036] [2022-12-06 01:45:33,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123420036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:33,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:33,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:45:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451262114] [2022-12-06 01:45:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:33,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:45:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:45:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:45:33,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:45:33,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 618 transitions, 10284 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:33,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:33,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:45:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:34,869 INFO L130 PetriNetUnfolder]: 4651/7165 cut-off events. [2022-12-06 01:45:34,869 INFO L131 PetriNetUnfolder]: For 987/987 co-relation queries the response was YES. [2022-12-06 01:45:34,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65369 conditions, 7165 events. 4651/7165 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 40067 event pairs, 264 based on Foata normal form. 1/5791 useless extension candidates. Maximal degree in co-relation 24511. Up to 6038 conditions per place. [2022-12-06 01:45:34,890 INFO L137 encePairwiseOnDemand]: 19/39 looper letters, 213 selfloop transitions, 25 changer transitions 625/863 dead transitions. [2022-12-06 01:45:34,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 863 transitions, 16119 flow [2022-12-06 01:45:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 01:45:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 01:45:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 211 transitions. [2022-12-06 01:45:34,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33814102564102566 [2022-12-06 01:45:34,894 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-06 01:45:34,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:34,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 863 transitions, 16119 flow [2022-12-06 01:45:34,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 863 transitions, 16119 flow [2022-12-06 01:45:34,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:39,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:45:39,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4264 [2022-12-06 01:45:39,158 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 862 transitions, 16101 flow [2022-12-06 01:45:39,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:39,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:39,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:39,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:45:39,159 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:45:39,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash -795940156, now seen corresponding path program 1 times [2022-12-06 01:45:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:39,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446871893] [2022-12-06 01:45:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446871893] [2022-12-06 01:45:39,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446871893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989140475] [2022-12-06 01:45:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:45:39,472 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:45:39,531 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:45:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:39,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 01:45:39,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:45:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:39,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:45:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:39,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989140475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:45:39,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:45:39,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 01:45:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166796109] [2022-12-06 01:45:39,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:45:39,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 01:45:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 01:45:39,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-06 01:45:39,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:45:39,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 862 transitions, 16101 flow. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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:45:39,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:39,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:45:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:43,913 INFO L130 PetriNetUnfolder]: 13046/19864 cut-off events. [2022-12-06 01:45:43,914 INFO L131 PetriNetUnfolder]: For 2690/2690 co-relation queries the response was YES. [2022-12-06 01:45:43,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200992 conditions, 19864 events. 13046/19864 cut-off events. For 2690/2690 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 127166 event pairs, 404 based on Foata normal form. 10/15744 useless extension candidates. Maximal degree in co-relation 30992. Up to 17297 conditions per place. [2022-12-06 01:45:44,044 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 1046 selfloop transitions, 41 changer transitions 1324/2411 dead transitions. [2022-12-06 01:45:44,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 2411 transitions, 49837 flow [2022-12-06 01:45:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 01:45:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 01:45:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 346 transitions. [2022-12-06 01:45:44,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2022-12-06 01:45:44,046 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-06 01:45:44,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:44,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 2411 transitions, 49837 flow [2022-12-06 01:45:44,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 2411 transitions, 49837 flow [2022-12-06 01:45:44,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:48,946 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:45:48,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4900 [2022-12-06 01:45:48,946 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 2408 transitions, 49777 flow [2022-12-06 01:45:48,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 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:45:48,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:48,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:48,962 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:45:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:49,150 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:45:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1130716302, now seen corresponding path program 2 times [2022-12-06 01:45:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:49,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125711981] [2022-12-06 01:45:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:49,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125711981] [2022-12-06 01:45:49,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125711981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:49,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:49,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:45:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781576998] [2022-12-06 01:45:49,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:45:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:45:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:45:49,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:45:49,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 2408 transitions, 49777 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:49,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:49,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:45:49,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:57,796 INFO L130 PetriNetUnfolder]: 15650/24063 cut-off events. [2022-12-06 01:45:57,796 INFO L131 PetriNetUnfolder]: For 3362/3362 co-relation queries the response was YES. [2022-12-06 01:45:57,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267376 conditions, 24063 events. 15650/24063 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 161207 event pairs, 380 based on Foata normal form. 4/18889 useless extension candidates. Maximal degree in co-relation 38577. Up to 21499 conditions per place. [2022-12-06 01:45:57,906 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 1512 selfloop transitions, 205 changer transitions 1637/3354 dead transitions. [2022-12-06 01:45:57,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 3354 transitions, 76053 flow [2022-12-06 01:45:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:45:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:45:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2022-12-06 01:45:57,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 01:45:57,908 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-06 01:45:57,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:57,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 3354 transitions, 76053 flow [2022-12-06 01:45:58,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 3354 transitions, 76053 flow [2022-12-06 01:45:58,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:58,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:58,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 01:45:58,070 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 3354 transitions, 76053 flow [2022-12-06 01:45:58,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:58,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:58,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:45:58,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:45:58,070 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:45:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1874267314, now seen corresponding path program 3 times [2022-12-06 01:45:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213655266] [2022-12-06 01:45:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213655266] [2022-12-06 01:45:58,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213655266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:58,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:58,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:45:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949458137] [2022-12-06 01:45:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:58,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:45:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:45:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:45:58,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:45:58,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 3354 transitions, 76053 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:45:58,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:58,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:45:58,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:46:12,767 INFO L130 PetriNetUnfolder]: 20564/31777 cut-off events. [2022-12-06 01:46:12,768 INFO L131 PetriNetUnfolder]: For 4648/4648 co-relation queries the response was YES. [2022-12-06 01:46:12,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384844 conditions, 31777 events. 20564/31777 cut-off events. For 4648/4648 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 224157 event pairs, 504 based on Foata normal form. 4/24827 useless extension candidates. Maximal degree in co-relation 59210. Up to 29213 conditions per place. [2022-12-06 01:46:12,927 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 2300 selfloop transitions, 241 changer transitions 1975/4516 dead transitions. [2022-12-06 01:46:12,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 4516 transitions, 111501 flow [2022-12-06 01:46:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:46:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:46:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 214 transitions. [2022-12-06 01:46:12,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31703703703703706 [2022-12-06 01:46:12,938 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 95 predicate places. [2022-12-06 01:46:12,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:46:12,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 4516 transitions, 111501 flow [2022-12-06 01:46:13,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 4516 transitions, 111501 flow [2022-12-06 01:46:13,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:46:13,169 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:46:13,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 01:46:13,170 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 4516 transitions, 111501 flow [2022-12-06 01:46:13,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:13,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:46:13,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:46:13,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:46:13,170 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:46:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:46:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1653948454, now seen corresponding path program 4 times [2022-12-06 01:46:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:46:13,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359705144] [2022-12-06 01:46:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:46:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:46:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:46:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:46:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:46:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359705144] [2022-12-06 01:46:13,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359705144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:46:13,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:46:13,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:46:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935760781] [2022-12-06 01:46:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:46:13,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:46:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:46:13,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:46:13,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:46:13,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:46:13,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 4516 transitions, 111501 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:13,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:46:13,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:46:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:46:31,969 INFO L130 PetriNetUnfolder]: 20648/31937 cut-off events. [2022-12-06 01:46:31,969 INFO L131 PetriNetUnfolder]: For 4708/4708 co-relation queries the response was YES. [2022-12-06 01:46:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418730 conditions, 31937 events. 20648/31937 cut-off events. For 4708/4708 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 225999 event pairs, 504 based on Foata normal form. 4/24939 useless extension candidates. Maximal degree in co-relation 64437. Up to 29373 conditions per place. [2022-12-06 01:46:32,136 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 2348 selfloop transitions, 245 changer transitions 2003/4596 dead transitions. [2022-12-06 01:46:32,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 4596 transitions, 122697 flow [2022-12-06 01:46:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:46:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:46:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2022-12-06 01:46:32,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3244444444444444 [2022-12-06 01:46:32,139 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 109 predicate places. [2022-12-06 01:46:32,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:46:32,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 4596 transitions, 122697 flow [2022-12-06 01:46:32,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 4596 transitions, 122697 flow [2022-12-06 01:46:32,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:46:32,369 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:46:32,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 01:46:32,370 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 4596 transitions, 122697 flow [2022-12-06 01:46:32,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:32,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:46:32,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:46:32,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:46:32,371 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:46:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:46:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 311625868, now seen corresponding path program 5 times [2022-12-06 01:46:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:46:32,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481003985] [2022-12-06 01:46:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:46:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:46:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:46:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:46:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:46:33,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481003985] [2022-12-06 01:46:33,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481003985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:46:33,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:46:33,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:46:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258550041] [2022-12-06 01:46:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:46:33,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:46:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:46:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:46:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:46:33,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:46:33,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 4596 transitions, 122697 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:33,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:46:33,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:46:33,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:46:53,303 INFO L130 PetriNetUnfolder]: 20788/32273 cut-off events. [2022-12-06 01:46:53,303 INFO L131 PetriNetUnfolder]: For 4832/4832 co-relation queries the response was YES. [2022-12-06 01:46:53,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455448 conditions, 32273 events. 20788/32273 cut-off events. For 4832/4832 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 229599 event pairs, 504 based on Foata normal form. 4/25203 useless extension candidates. Maximal degree in co-relation 70084. Up to 29709 conditions per place. [2022-12-06 01:46:53,485 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 2472 selfloop transitions, 249 changer transitions 2031/4752 dead transitions. [2022-12-06 01:46:53,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 4752 transitions, 136425 flow [2022-12-06 01:46:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:46:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:46:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2022-12-06 01:46:53,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33174603174603173 [2022-12-06 01:46:53,488 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2022-12-06 01:46:53,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:46:53,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 4752 transitions, 136425 flow [2022-12-06 01:46:53,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 4752 transitions, 136425 flow [2022-12-06 01:46:53,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:46:53,810 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:46:53,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 323 [2022-12-06 01:46:53,811 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 4752 transitions, 136425 flow [2022-12-06 01:46:53,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:53,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:46:53,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:46:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:46:53,811 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:46:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:46:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 49990220, now seen corresponding path program 6 times [2022-12-06 01:46:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:46:53,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597107734] [2022-12-06 01:46:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:46:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:46:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:46:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:46:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:46:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597107734] [2022-12-06 01:46:54,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597107734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:46:54,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:46:54,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:46:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651730760] [2022-12-06 01:46:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:46:54,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:46:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:46:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:46:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:46:54,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:46:54,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 4752 transitions, 136425 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:46:54,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:46:54,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:46:54,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:47:17,252 INFO L130 PetriNetUnfolder]: 22460/34995 cut-off events. [2022-12-06 01:47:17,252 INFO L131 PetriNetUnfolder]: For 5364/5364 co-relation queries the response was YES. [2022-12-06 01:47:17,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528804 conditions, 34995 events. 22460/34995 cut-off events. For 5364/5364 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 254230 event pairs, 504 based on Foata normal form. 4/27229 useless extension candidates. Maximal degree in co-relation 82485. Up to 32431 conditions per place. [2022-12-06 01:47:17,461 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 2854 selfloop transitions, 325 changer transitions 2217/5396 dead transitions. [2022-12-06 01:47:17,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 5396 transitions, 165741 flow [2022-12-06 01:47:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:47:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:47:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2022-12-06 01:47:17,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3244444444444444 [2022-12-06 01:47:17,464 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 136 predicate places. [2022-12-06 01:47:17,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:47:17,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 5396 transitions, 165741 flow [2022-12-06 01:47:17,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 5396 transitions, 165741 flow [2022-12-06 01:47:17,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:47:17,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:47:17,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 01:47:17,894 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 5396 transitions, 165741 flow [2022-12-06 01:47:17,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:47:17,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:47:17,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:47:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:47:17,899 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:47:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:47:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1970950294, now seen corresponding path program 7 times [2022-12-06 01:47:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:47:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675851592] [2022-12-06 01:47:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:47:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:47:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:47:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:47:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:47:18,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675851592] [2022-12-06 01:47:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675851592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:47:18,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:47:18,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:47:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38930784] [2022-12-06 01:47:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:47:18,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:47:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:47:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:47:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:47:18,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:47:18,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 5396 transitions, 165741 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:47:18,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:47:18,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:47:18,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:47:42,634 INFO L130 PetriNetUnfolder]: 22464/35147 cut-off events. [2022-12-06 01:47:42,634 INFO L131 PetriNetUnfolder]: For 5458/5458 co-relation queries the response was YES. [2022-12-06 01:47:42,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566280 conditions, 35147 events. 22464/35147 cut-off events. For 5458/5458 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 257478 event pairs, 504 based on Foata normal form. 4/27373 useless extension candidates. Maximal degree in co-relation 88325. Up to 32583 conditions per place. [2022-12-06 01:47:42,841 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 2936 selfloop transitions, 335 changer transitions 2249/5520 dead transitions. [2022-12-06 01:47:42,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 5520 transitions, 180645 flow [2022-12-06 01:47:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:47:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:47:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 218 transitions. [2022-12-06 01:47:42,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32296296296296295 [2022-12-06 01:47:42,842 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 150 predicate places. [2022-12-06 01:47:42,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:47:42,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 5520 transitions, 180645 flow [2022-12-06 01:47:43,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 5520 transitions, 180645 flow [2022-12-06 01:47:43,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:47:43,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:47:43,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-06 01:47:43,171 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 5520 transitions, 180645 flow [2022-12-06 01:47:43,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:47:43,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:47:43,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:47:43,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:47:43,173 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:47:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:47:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -583513476, now seen corresponding path program 8 times [2022-12-06 01:47:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:47:43,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896813724] [2022-12-06 01:47:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:47:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:47:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:47:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:47:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:47:44,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896813724] [2022-12-06 01:47:44,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896813724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:47:44,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881250866] [2022-12-06 01:47:44,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:47:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:47:44,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:47:44,227 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:47:44,228 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:47:44,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 01:47:44,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:47:44,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 01:47:44,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:47:44,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 01:47:44,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 01:47:44,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 01:47:44,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 01:47:44,840 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-12-06 01:47:44,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 40 [2022-12-06 01:47:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:47:44,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:47:44,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881250866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:47:44,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:47:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 20 [2022-12-06 01:47:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993315899] [2022-12-06 01:47:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:47:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 01:47:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:47:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 01:47:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-12-06 01:47:44,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:47:44,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 5520 transitions, 180645 flow. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:47:44,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:47:44,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:47:44,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:48:15,844 INFO L130 PetriNetUnfolder]: 22464/35143 cut-off events. [2022-12-06 01:48:15,844 INFO L131 PetriNetUnfolder]: For 5450/5450 co-relation queries the response was YES. [2022-12-06 01:48:15,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601360 conditions, 35143 events. 22464/35143 cut-off events. For 5450/5450 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 256913 event pairs, 504 based on Foata normal form. 4/27369 useless extension candidates. Maximal degree in co-relation 93816. Up to 32579 conditions per place. [2022-12-06 01:48:16,094 INFO L137 encePairwiseOnDemand]: 32/45 looper letters, 2928 selfloop transitions, 307 changer transitions 2281/5516 dead transitions. [2022-12-06 01:48:16,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 5516 transitions, 191549 flow [2022-12-06 01:48:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:48:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:48:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2022-12-06 01:48:16,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39191919191919194 [2022-12-06 01:48:16,095 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 160 predicate places. [2022-12-06 01:48:16,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:48:16,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 5516 transitions, 191549 flow [2022-12-06 01:48:16,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 5516 transitions, 191549 flow [2022-12-06 01:48:16,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:48:16,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:48:16,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-06 01:48:16,427 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 5516 transitions, 191549 flow [2022-12-06 01:48:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:48:16,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:48:16,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:48:16,433 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:48:16,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 01:48:16,633 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 01:48:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:48:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash -803832336, now seen corresponding path program 9 times [2022-12-06 01:48:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:48:16,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141317339] [2022-12-06 01:48:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:48:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:48:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:48:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:48:17,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:48:17,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141317339] [2022-12-06 01:48:17,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141317339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:48:17,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:48:17,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:48:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259698647] [2022-12-06 01:48:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:48:17,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:48:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:48:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:48:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:48:17,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 01:48:17,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 5516 transitions, 191549 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:48:17,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:48:17,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 01:48:17,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:48:45,665 INFO L130 PetriNetUnfolder]: 22464/35139 cut-off events. [2022-12-06 01:48:45,665 INFO L131 PetriNetUnfolder]: For 5454/5454 co-relation queries the response was YES. [2022-12-06 01:48:45,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636432 conditions, 35139 events. 22464/35139 cut-off events. For 5454/5454 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 257175 event pairs, 504 based on Foata normal form. 4/27365 useless extension candidates. Maximal degree in co-relation 99307. Up to 32575 conditions per place. [2022-12-06 01:48:45,892 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 2892 selfloop transitions, 311 changer transitions 2309/5512 dead transitions. [2022-12-06 01:48:45,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 5512 transitions, 202437 flow [2022-12-06 01:48:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 01:48:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 01:48:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2022-12-06 01:48:45,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 01:48:45,899 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 174 predicate places. [2022-12-06 01:48:45,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:48:45,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 5512 transitions, 202437 flow [2022-12-06 01:48:46,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 5512 transitions, 202437 flow [2022-12-06 01:48:46,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:48:58,275 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:48:58,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12377 [2022-12-06 01:48:58,276 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 5509 transitions, 202329 flow [2022-12-06 01:48:58,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:48:58,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:48:58,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:48:58,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 01:48:58,277 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 01:48:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:48:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 652933315, now seen corresponding path program 1 times [2022-12-06 01:48:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:48:58,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197952904] [2022-12-06 01:48:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:48:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:48:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:48:58,980 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:48:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:48:58,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197952904] [2022-12-06 01:48:58,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197952904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:48:58,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:48:58,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:48:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746651099] [2022-12-06 01:48:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:48:58,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:48:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:48:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:48:58,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:48:58,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 01:48:58,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 5509 transitions, 202329 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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:48:58,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:48:58,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 01:48:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:49:27,206 INFO L130 PetriNetUnfolder]: 22668/35584 cut-off events. [2022-12-06 01:49:27,207 INFO L131 PetriNetUnfolder]: For 5586/5586 co-relation queries the response was YES. [2022-12-06 01:49:27,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680099 conditions, 35584 events. 22668/35584 cut-off events. For 5586/5586 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 263475 event pairs, 504 based on Foata normal form. 4/27698 useless extension candidates. Maximal degree in co-relation 106306. Up to 33020 conditions per place. [2022-12-06 01:49:27,627 INFO L137 encePairwiseOnDemand]: 30/50 looper letters, 3042 selfloop transitions, 350 changer transitions 2341/5733 dead transitions. [2022-12-06 01:49:27,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 5733 transitions, 222075 flow [2022-12-06 01:49:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:49:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:49:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 223 transitions. [2022-12-06 01:49:27,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31857142857142856 [2022-12-06 01:49:27,629 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 183 predicate places. [2022-12-06 01:49:27,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:49:27,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 5733 transitions, 222075 flow [2022-12-06 01:49:27,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 5733 transitions, 222075 flow [2022-12-06 01:49:27,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:49:27,989 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:49:27,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-06 01:49:27,992 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 5733 transitions, 222075 flow [2022-12-06 01:49:27,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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:49:27,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:49:27,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:49:27,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 01:49:27,992 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 01:49:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:49:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash -640769363, now seen corresponding path program 2 times [2022-12-06 01:49:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:49:27,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822784881] [2022-12-06 01:49:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:49:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:49:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:49:28,929 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:49:28,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:49:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822784881] [2022-12-06 01:49:28,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822784881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:49:28,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:49:28,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 01:49:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495564370] [2022-12-06 01:49:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:49:28,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 01:49:28,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:49:28,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 01:49:28,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-06 01:49:28,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 01:49:28,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 5733 transitions, 222075 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:49:28,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:49:28,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 01:49:28,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:50:29,384 INFO L130 PetriNetUnfolder]: 43680/68583 cut-off events. [2022-12-06 01:50:29,385 INFO L131 PetriNetUnfolder]: For 10850/10850 co-relation queries the response was YES. [2022-12-06 01:50:29,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379318 conditions, 68583 events. 43680/68583 cut-off events. For 10850/10850 co-relation queries the response was YES. Maximal size of possible extension queue 2520. Compared 556535 event pairs, 936 based on Foata normal form. 4/53241 useless extension candidates. Maximal degree in co-relation 134676. Up to 66019 conditions per place. [2022-12-06 01:50:29,902 INFO L137 encePairwiseOnDemand]: 31/50 looper letters, 6394 selfloop transitions, 354 changer transitions 4320/11068 dead transitions. [2022-12-06 01:50:29,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 11068 transitions, 450919 flow [2022-12-06 01:50:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:50:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:50:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 229 transitions. [2022-12-06 01:50:29,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3271428571428571 [2022-12-06 01:50:29,904 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 196 predicate places. [2022-12-06 01:50:29,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:50:29,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 11068 transitions, 450919 flow [2022-12-06 01:50:30,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 11068 transitions, 450919 flow [2022-12-06 01:50:30,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:50:30,953 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:50:30,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1049 [2022-12-06 01:50:30,954 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 11068 transitions, 450919 flow [2022-12-06 01:50:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:50:30,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:50:30,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:50:30,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 01:50:30,954 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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:50:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:50:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 261162525, now seen corresponding path program 3 times [2022-12-06 01:50:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:50:30,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473216090] [2022-12-06 01:50:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:50:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:50:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:50:31,407 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:50:31,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:50:31,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473216090] [2022-12-06 01:50:31,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473216090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:50:31,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:50:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:50:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034032561] [2022-12-06 01:50:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:50:31,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:50:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:50:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:50:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:50:31,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 01:50:31,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 11068 transitions, 450919 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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:50:31,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:50:31,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 01:50:31,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:53:37,151 INFO L130 PetriNetUnfolder]: 44624/70519 cut-off events. [2022-12-06 01:53:37,151 INFO L131 PetriNetUnfolder]: For 11240/11240 co-relation queries the response was YES. [2022-12-06 01:53:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488894 conditions, 70519 events. 44624/70519 cut-off events. For 11240/11240 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 580124 event pairs, 1064 based on Foata normal form. 8/54757 useless extension candidates. Maximal degree in co-relation 142060. Up to 67955 conditions per place. [2022-12-06 01:53:37,798 INFO L137 encePairwiseOnDemand]: 29/50 looper letters, 6854 selfloop transitions, 778 changer transitions 4376/12008 dead transitions. [2022-12-06 01:53:37,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 12008 transitions, 513339 flow [2022-12-06 01:53:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:53:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:53:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 215 transitions. [2022-12-06 01:53:37,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30714285714285716 [2022-12-06 01:53:37,800 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 209 predicate places. [2022-12-06 01:53:37,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:53:37,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 12008 transitions, 513339 flow [2022-12-06 01:53:38,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 12008 transitions, 513339 flow [2022-12-06 01:53:38,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:53:38,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:53:38,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1008 [2022-12-06 01:53:38,808 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 12008 transitions, 513339 flow [2022-12-06 01:53:38,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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:53:38,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:53:38,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:53:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 01:53:38,809 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:53:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:53:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1416440810, now seen corresponding path program 1 times [2022-12-06 01:53:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:53:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55679643] [2022-12-06 01:53:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:53:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:53:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:53:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:53:38,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:53:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55679643] [2022-12-06 01:53:38,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55679643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:53:38,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:53:38,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:53:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952639428] [2022-12-06 01:53:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:53:38,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:53:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:53:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:53:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:53:38,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 01:53:38,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 12008 transitions, 513339 flow. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:53:38,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:53:38,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 01:53:38,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:57:17,699 INFO L130 PetriNetUnfolder]: 44624/70513 cut-off events. [2022-12-06 01:57:17,700 INFO L131 PetriNetUnfolder]: For 11174/11174 co-relation queries the response was YES. [2022-12-06 01:57:17,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559282 conditions, 70513 events. 44624/70513 cut-off events. For 11174/11174 co-relation queries the response was YES. Maximal size of possible extension queue 2652. Compared 579727 event pairs, 1136 based on Foata normal form. 6/54749 useless extension candidates. Maximal degree in co-relation 148804. Up to 67949 conditions per place. [2022-12-06 01:57:18,295 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 8008 selfloop transitions, 126 changer transitions 4502/12636 dead transitions. [2022-12-06 01:57:18,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 12636 transitions, 565137 flow [2022-12-06 01:57:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:57:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:57:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-06 01:57:18,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-06 01:57:18,296 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 214 predicate places. [2022-12-06 01:57:18,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:57:18,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 12636 transitions, 565137 flow [2022-12-06 01:57:19,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 12636 transitions, 565137 flow [2022-12-06 01:57:19,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:57:19,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:57:19,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1252 [2022-12-06 01:57:19,548 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 12636 transitions, 565137 flow [2022-12-06 01:57:19,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:57:19,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:57:19,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:57:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 01:57:19,548 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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:57:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:57:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash 736958147, now seen corresponding path program 4 times [2022-12-06 01:57:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:57:19,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586435594] [2022-12-06 01:57:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:57:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:57:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:57:20,468 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:57:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:57:20,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586435594] [2022-12-06 01:57:20,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586435594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:57:20,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:57:20,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:57:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612526049] [2022-12-06 01:57:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:57:20,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:57:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:57:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:57:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:57:20,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 01:57:20,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 12636 transitions, 565137 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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:57:20,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:57:20,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 01:57:20,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 01:58:55,674 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 01:58:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:58:55,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:58:55,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 01:58:55,713 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/50 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 770106 conditions, 33326 events (22475/33325 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 248532 event pairs, 414 based on Foata normal form. 0/28413 useless extension candidates. Maximal degree in co-relation 148004. Up to 30884 conditions per place.). [2022-12-06 01:58:55,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:58:55,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:58:55,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:58:55,715 INFO L458 BasicCegarLoop]: Path program histogram: [9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:55,717 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:58:55,717 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:58:55,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:58:55 BasicIcfg [2022-12-06 01:58:55,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:58:55,719 INFO L158 Benchmark]: Toolchain (without parser) took 825689.35ms. Allocated memory was 219.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 195.2MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 01:58:55,719 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory was 195.7MB in the beginning and 195.6MB in the end (delta: 82.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:58:55,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 219.2MB. Free memory was 195.2MB in the beginning and 183.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 01:58:55,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.65ms. Allocated memory is still 219.2MB. Free memory was 183.2MB in the beginning and 180.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:58:55,720 INFO L158 Benchmark]: Boogie Preprocessor took 51.82ms. Allocated memory is still 219.2MB. Free memory was 180.6MB in the beginning and 178.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:58:55,720 INFO L158 Benchmark]: RCFGBuilder took 594.37ms. Allocated memory is still 219.2MB. Free memory was 178.5MB in the beginning and 153.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 01:58:55,720 INFO L158 Benchmark]: TraceAbstraction took 824669.33ms. Allocated memory was 219.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 153.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 01:58:55,721 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.09ms. Allocated memory is still 219.2MB. Free memory was 195.7MB in the beginning and 195.6MB in the end (delta: 82.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 219.2MB. Free memory was 195.2MB in the beginning and 183.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.65ms. Allocated memory is still 219.2MB. Free memory was 183.2MB in the beginning and 180.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.82ms. Allocated memory is still 219.2MB. Free memory was 180.6MB in the beginning and 178.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.37ms. Allocated memory is still 219.2MB. Free memory was 178.5MB in the beginning and 153.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 824669.33ms. Allocated memory was 219.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 153.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 281 PlacesBefore, 38 PlacesAfterwards, 299 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 126 TrivialYvCompositions, 117 ConcurrentYvCompositions, 20 ChoiceCompositions, 263 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 9901, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8995, independent: 8953, independent conditional: 0, independent unconditional: 8953, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8995, independent: 8953, independent conditional: 0, independent unconditional: 8953, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9967, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 8995, unknown conditional: 0, unknown unconditional: 8995] , Statistics on independence cache: Total cache size (in pairs): 17857, Positive cache size: 17815, Positive conditional cache size: 0, Positive unconditional cache size: 17815, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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: 3.9s, 45 PlacesBefore, 42 PlacesAfterwards, 152 TransitionsBefore, 149 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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.6s, 51 PlacesBefore, 50 PlacesAfterwards, 240 TransitionsBefore, 239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 215 TransitionsBefore, 215 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 357 TransitionsBefore, 357 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, 62 PlacesBefore, 62 PlacesAfterwards, 469 TransitionsBefore, 469 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, 68 PlacesBefore, 68 PlacesAfterwards, 509 TransitionsBefore, 509 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, 74 PlacesBefore, 74 PlacesAfterwards, 618 TransitionsBefore, 618 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: 4.2s, 89 PlacesBefore, 88 PlacesAfterwards, 863 TransitionsBefore, 862 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 108 PlacesBefore, 105 PlacesAfterwards, 2411 TransitionsBefore, 2408 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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, 119 PlacesBefore, 119 PlacesAfterwards, 3354 TransitionsBefore, 3354 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, 133 PlacesBefore, 133 PlacesAfterwards, 4516 TransitionsBefore, 4516 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, 147 PlacesBefore, 147 PlacesAfterwards, 4596 TransitionsBefore, 4596 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, 160 PlacesBefore, 160 PlacesAfterwards, 4752 TransitionsBefore, 4752 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, 174 PlacesBefore, 174 PlacesAfterwards, 5396 TransitionsBefore, 5396 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, 188 PlacesBefore, 188 PlacesAfterwards, 5520 TransitionsBefore, 5520 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, 198 PlacesBefore, 198 PlacesAfterwards, 5516 TransitionsBefore, 5516 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: 11.9s, 212 PlacesBefore, 208 PlacesAfterwards, 5512 TransitionsBefore, 5509 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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, 221 PlacesBefore, 221 PlacesAfterwards, 5733 TransitionsBefore, 5733 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, 234 PlacesBefore, 234 PlacesAfterwards, 11068 TransitionsBefore, 11068 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, 247 PlacesBefore, 247 PlacesAfterwards, 12008 TransitionsBefore, 12008 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, 252 PlacesBefore, 252 PlacesAfterwards, 12636 TransitionsBefore, 12636 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: 108]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/50 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 770106 conditions, 33326 events (22475/33325 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 248532 event pairs, 414 based on Foata normal form. 0/28413 useless extension candidates. Maximal degree in co-relation 148004. Up to 30884 conditions per place.). - TimeoutResultAtElement [Line: 101]: 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 (11states, 0/50 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 770106 conditions, 33326 events (22475/33325 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 248532 event pairs, 414 based on Foata normal form. 0/28413 useless extension candidates. Maximal degree in co-relation 148004. Up to 30884 conditions per place.). - TimeoutResultAtElement [Line: 102]: 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 (11states, 0/50 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 770106 conditions, 33326 events (22475/33325 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 248532 event pairs, 414 based on Foata normal form. 0/28413 useless extension candidates. Maximal degree in co-relation 148004. Up to 30884 conditions per place.). - TimeoutResultAtElement [Line: 100]: 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 (11states, 0/50 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 770106 conditions, 33326 events (22475/33325 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 248532 event pairs, 414 based on Foata normal form. 0/28413 useless extension candidates. Maximal degree in co-relation 148004. Up to 30884 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 408 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: 824.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 768.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4631 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4631 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15276 IncrementalHoareTripleChecker+Invalid, 15490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 0 mSDtfsCounter, 15276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565137occurred in iteration=21, InterpolantAutomatonStates: 249, 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.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 658 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 704 ConstructedInterpolants, 1 QuantifiedInterpolants, 8933 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1243 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 29 InterpolantComputations, 21 PerfectInterpolantSequences, 15/23 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