/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:21:01,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:21:01,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:21:01,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:21:01,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:21:01,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:21:01,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:21:01,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:21:01,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:21:01,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:21:01,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:21:01,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:21:01,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:21:01,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:21:01,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:21:01,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:21:01,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:21:01,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:21:01,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:21:01,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:21:01,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:21:01,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:21:01,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:21:01,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:21:01,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:21:01,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:21:01,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:21:01,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:21:01,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:21:01,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:21:01,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:21:01,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:21:01,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:21:01,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:21:01,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:21:01,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:21:01,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:21:01,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:21:01,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:21:01,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:21:01,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:21:01,550 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-13 07:21:01,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:21:01,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:21:01,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:21:01,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:21:01,566 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:21:01,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:21:01,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:21:01,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:21:01,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:21:01,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:21:01,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:21:01,569 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:21:01,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:21:01,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:21:01,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:21:01,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:21:01,921 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:21:01,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-13 07:21:02,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:21:03,131 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:21:03,132 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-13 07:21:03,158 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dcdcab39/8d57fb1711f04644a9c593c46d736bdc/FLAGf36806b1e [2022-12-13 07:21:03,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dcdcab39/8d57fb1711f04644a9c593c46d736bdc [2022-12-13 07:21:03,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:21:03,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:21:03,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:21:03,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:21:03,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:21:03,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4ec7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03, skipping insertion in model container [2022-12-13 07:21:03,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:21:03,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:21:03,326 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/mult-dist.wvr.c[2116,2129] [2022-12-13 07:21:03,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:21:03,341 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:21:03,368 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/mult-dist.wvr.c[2116,2129] [2022-12-13 07:21:03,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:21:03,386 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:21:03,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03 WrapperNode [2022-12-13 07:21:03,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:21:03,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:21:03,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:21:03,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:21:03,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,423 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-13 07:21:03,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:21:03,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:21:03,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:21:03,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:21:03,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:21:03,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:21:03,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:21:03,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:21:03,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (1/1) ... [2022-12-13 07:21:03,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:21:03,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:03,490 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-13 07:21:03,498 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-13 07:21:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:21:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:21:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:21:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:21:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:21:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:21:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:21:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:21:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:21:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:21:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:21:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:21:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:21:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:21:03,519 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:21:03,617 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:21:03,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:21:03,808 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:21:03,813 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:21:03,813 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 07:21:03,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:21:03 BoogieIcfgContainer [2022-12-13 07:21:03,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:21:03,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:21:03,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:21:03,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:21:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:21:03" (1/3) ... [2022-12-13 07:21:03,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d030e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:21:03, skipping insertion in model container [2022-12-13 07:21:03,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:21:03" (2/3) ... [2022-12-13 07:21:03,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d030e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:21:03, skipping insertion in model container [2022-12-13 07:21:03,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:21:03" (3/3) ... [2022-12-13 07:21:03,833 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2022-12-13 07:21:03,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:21:03,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:21:03,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:21:03,941 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:21:03,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-13 07:21:04,023 INFO L130 PetriNetUnfolder]: 7/99 cut-off events. [2022-12-13 07:21:04,023 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:21:04,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 99 events. 7/99 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-13 07:21:04,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 228 flow [2022-12-13 07:21:04,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 196 flow [2022-12-13 07:21:04,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:04,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-13 07:21:04,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 196 flow [2022-12-13 07:21:04,109 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-13 07:21:04,110 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:21:04,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-13 07:21:04,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-13 07:21:04,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 07:21:06,297 INFO L241 LiptonReduction]: Total number of compositions: 67 [2022-12-13 07:21:06,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:21:06,333 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;@5286788c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:21:06,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:21:06,340 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-13 07:21:06,340 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:21:06,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:06,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:06,353 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-13 07:21:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1839579012, now seen corresponding path program 1 times [2022-12-13 07:21:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:06,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689587410] [2022-12-13 07:21:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:06,875 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-13 07:21:06,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:06,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689587410] [2022-12-13 07:21:06,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689587410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:06,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:06,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:21:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123605107] [2022-12-13 07:21:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:06,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:21:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:21:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:21:06,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 07:21:06,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 07:21:06,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:06,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 07:21:06,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:07,007 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2022-12-13 07:21:07,008 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 07:21:07,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 506 events. 359/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1613 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-13 07:21:07,015 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2022-12-13 07:21:07,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2022-12-13 07:21:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:21:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:21:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 07:21:07,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-13 07:21:07,027 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-13 07:21:07,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 38 transitions, 179 flow [2022-12-13 07:21:07,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 37 transitions, 172 flow [2022-12-13 07:21:07,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:07,034 INFO L89 Accepts]: Start accepts. Operand has 31 places, 37 transitions, 172 flow [2022-12-13 07:21:07,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:07,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:07,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 37 transitions, 172 flow [2022-12-13 07:21:07,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 37 transitions, 172 flow [2022-12-13 07:21:07,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 07:21:07,042 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:07,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:21:07,044 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 37 transitions, 172 flow [2022-12-13 07:21:07,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 07:21:07,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:07,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:07,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:21:07,047 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-13 07:21:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1296714879, now seen corresponding path program 1 times [2022-12-13 07:21:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:07,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905377551] [2022-12-13 07:21:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:07,283 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-13 07:21:07,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:07,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905377551] [2022-12-13 07:21:07,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905377551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:07,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:07,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083626759] [2022-12-13 07:21:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:07,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:07,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:07,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:07,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 37 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:07,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:07,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:07,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:07,552 INFO L130 PetriNetUnfolder]: 638/971 cut-off events. [2022-12-13 07:21:07,552 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 07:21:07,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 971 events. 638/971 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3890 event pairs, 64 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 2561. Up to 557 conditions per place. [2022-12-13 07:21:07,557 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 96 selfloop transitions, 9 changer transitions 16/121 dead transitions. [2022-12-13 07:21:07,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 121 transitions, 798 flow [2022-12-13 07:21:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 07:21:07,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525974025974026 [2022-12-13 07:21:07,559 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-12-13 07:21:07,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 121 transitions, 798 flow [2022-12-13 07:21:07,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 105 transitions, 689 flow [2022-12-13 07:21:07,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:07,567 INFO L89 Accepts]: Start accepts. Operand has 36 places, 105 transitions, 689 flow [2022-12-13 07:21:07,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:07,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:07,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 105 transitions, 689 flow [2022-12-13 07:21:07,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 105 transitions, 689 flow [2022-12-13 07:21:07,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:07,570 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:07,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:21:07,571 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 105 transitions, 689 flow [2022-12-13 07:21:07,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:07,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:07,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:07,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:21:07,571 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-13 07:21:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -256174547, now seen corresponding path program 2 times [2022-12-13 07:21:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442672408] [2022-12-13 07:21:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:07,718 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-13 07:21:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:07,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442672408] [2022-12-13 07:21:07,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442672408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:07,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:07,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058610998] [2022-12-13 07:21:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:07,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:07,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:07,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 105 transitions, 689 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:07,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:07,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:07,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:07,990 INFO L130 PetriNetUnfolder]: 851/1296 cut-off events. [2022-12-13 07:21:07,990 INFO L131 PetriNetUnfolder]: For 391/391 co-relation queries the response was YES. [2022-12-13 07:21:07,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5124 conditions, 1296 events. 851/1296 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5423 event pairs, 54 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 4615. Up to 863 conditions per place. [2022-12-13 07:21:07,997 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 206 selfloop transitions, 29 changer transitions 23/258 dead transitions. [2022-12-13 07:21:07,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 258 transitions, 2190 flow [2022-12-13 07:21:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 07:21:07,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-13 07:21:07,999 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-13 07:21:07,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 258 transitions, 2190 flow [2022-12-13 07:21:08,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 235 transitions, 1996 flow [2022-12-13 07:21:08,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:08,011 INFO L89 Accepts]: Start accepts. Operand has 42 places, 235 transitions, 1996 flow [2022-12-13 07:21:08,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:08,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:08,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 235 transitions, 1996 flow [2022-12-13 07:21:08,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 235 transitions, 1996 flow [2022-12-13 07:21:08,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:08,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:08,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:21:08,017 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 235 transitions, 1996 flow [2022-12-13 07:21:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:08,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:08,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:08,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:21:08,017 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-13 07:21:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash -347308812, now seen corresponding path program 1 times [2022-12-13 07:21:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:08,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633996063] [2022-12-13 07:21:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:08,174 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-13 07:21:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:08,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633996063] [2022-12-13 07:21:08,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633996063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:08,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:08,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:08,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265820726] [2022-12-13 07:21:08,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:08,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:08,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:08,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:08,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:08,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:08,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 235 transitions, 1996 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:08,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:08,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:08,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:08,560 INFO L130 PetriNetUnfolder]: 1084/1655 cut-off events. [2022-12-13 07:21:08,561 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-13 07:21:08,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8218 conditions, 1655 events. 1084/1655 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7110 event pairs, 80 based on Foata normal form. 4/1183 useless extension candidates. Maximal degree in co-relation 7461. Up to 1217 conditions per place. [2022-12-13 07:21:08,575 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 361 selfloop transitions, 53 changer transitions 26/440 dead transitions. [2022-12-13 07:21:08,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 440 transitions, 4593 flow [2022-12-13 07:21:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-12-13 07:21:08,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2022-12-13 07:21:08,580 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-13 07:21:08,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 440 transitions, 4593 flow [2022-12-13 07:21:08,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 414 transitions, 4314 flow [2022-12-13 07:21:08,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:08,607 INFO L89 Accepts]: Start accepts. Operand has 47 places, 414 transitions, 4314 flow [2022-12-13 07:21:08,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:08,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:08,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 414 transitions, 4314 flow [2022-12-13 07:21:08,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 414 transitions, 4314 flow [2022-12-13 07:21:08,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:08,622 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:08,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 07:21:08,628 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 414 transitions, 4314 flow [2022-12-13 07:21:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:08,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:08,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:21:08,629 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-13 07:21:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1558864720, now seen corresponding path program 2 times [2022-12-13 07:21:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:08,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27220750] [2022-12-13 07:21:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:08,816 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-13 07:21:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:08,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27220750] [2022-12-13 07:21:08,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27220750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:08,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641497132] [2022-12-13 07:21:08,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:08,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:08,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:08,827 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-13 07:21:08,874 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-13 07:21:08,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:08,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:08,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:21:08,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:09,081 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-13 07:21:09,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:09,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-13 07:21:09,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641497132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:09,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:09,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247445450] [2022-12-13 07:21:09,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:09,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:09,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:09,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 414 transitions, 4314 flow. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-13 07:21:09,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:09,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:09,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:09,693 INFO L130 PetriNetUnfolder]: 1125/1704 cut-off events. [2022-12-13 07:21:09,693 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2022-12-13 07:21:09,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 1704 events. 1125/1704 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7254 event pairs, 24 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 9233. Up to 1295 conditions per place. [2022-12-13 07:21:09,704 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 389 selfloop transitions, 86 changer transitions 0/475 dead transitions. [2022-12-13 07:21:09,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:21:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:21:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-13 07:21:09,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 07:21:09,706 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2022-12-13 07:21:09,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:09,726 INFO L89 Accepts]: Start accepts. Operand has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:09,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:09,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:09,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:09,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:21:09,736 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 475 transitions, 5896 flow [2022-12-13 07:21:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-13 07:21:09,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:09,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:09,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:21:09,942 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-13 07:21:09,942 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-13 07:21:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1760848272, now seen corresponding path program 3 times [2022-12-13 07:21:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:09,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452020414] [2022-12-13 07:21:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:10,119 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-13 07:21:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452020414] [2022-12-13 07:21:10,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452020414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:10,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005850389] [2022-12-13 07:21:10,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:10,123 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-13 07:21:10,126 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-13 07:21:10,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:21:10,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:10,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:10,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:10,312 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-13 07:21:10,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:10,839 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-13 07:21:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005850389] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:10,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:10,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2022-12-13 07:21:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533605719] [2022-12-13 07:21:10,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:10,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:10,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:10,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 475 transitions, 5896 flow. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-13 07:21:10,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:10,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:10,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:11,928 INFO L130 PetriNetUnfolder]: 1947/3048 cut-off events. [2022-12-13 07:21:11,929 INFO L131 PetriNetUnfolder]: For 956/956 co-relation queries the response was YES. [2022-12-13 07:21:11,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21359 conditions, 3048 events. 1947/3048 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15453 event pairs, 24 based on Foata normal form. 0/2186 useless extension candidates. Maximal degree in co-relation 19069. Up to 2509 conditions per place. [2022-12-13 07:21:11,945 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 813 selfloop transitions, 142 changer transitions 0/955 dead transitions. [2022-12-13 07:21:11,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:21:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:21:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 194 transitions. [2022-12-13 07:21:11,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2022-12-13 07:21:11,947 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2022-12-13 07:21:11,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:11,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:11,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:11,980 INFO L89 Accepts]: Start accepts. Operand has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:11,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:11,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:11,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:12,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:12,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:12,006 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:12,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 07:21:12,007 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 955 transitions, 13869 flow [2022-12-13 07:21:12,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-13 07:21:12,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:12,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:12,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:12,212 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,SelfDestructingSolverStorable5 [2022-12-13 07:21:12,212 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-13 07:21:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1609054800, now seen corresponding path program 4 times [2022-12-13 07:21:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709982501] [2022-12-13 07:21:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:12,372 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-13 07:21:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:12,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709982501] [2022-12-13 07:21:12,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709982501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:12,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:12,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027108843] [2022-12-13 07:21:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:12,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:12,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 955 transitions, 13869 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:12,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:12,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:12,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:12,931 INFO L130 PetriNetUnfolder]: 1931/3008 cut-off events. [2022-12-13 07:21:12,931 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2022-12-13 07:21:12,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24080 conditions, 3008 events. 1931/3008 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15090 event pairs, 24 based on Foata normal form. 4/2158 useless extension candidates. Maximal degree in co-relation 21511. Up to 2469 conditions per place. [2022-12-13 07:21:12,948 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 865 selfloop transitions, 64 changer transitions 4/933 dead transitions. [2022-12-13 07:21:12,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 933 transitions, 15406 flow [2022-12-13 07:21:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 07:21:12,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2022-12-13 07:21:12,950 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2022-12-13 07:21:12,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 933 transitions, 15406 flow [2022-12-13 07:21:12,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 929 transitions, 15339 flow [2022-12-13 07:21:12,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:12,986 INFO L89 Accepts]: Start accepts. Operand has 77 places, 929 transitions, 15339 flow [2022-12-13 07:21:12,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:12,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:12,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 929 transitions, 15339 flow [2022-12-13 07:21:13,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 929 transitions, 15339 flow [2022-12-13 07:21:13,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:13,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:13,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 07:21:13,016 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 929 transitions, 15339 flow [2022-12-13 07:21:13,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:13,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:13,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:13,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:21:13,017 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-13 07:21:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 300581684, now seen corresponding path program 5 times [2022-12-13 07:21:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967835963] [2022-12-13 07:21:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:13,154 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-13 07:21:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967835963] [2022-12-13 07:21:13,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967835963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:13,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:13,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062496362] [2022-12-13 07:21:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:13,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:13,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:13,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:13,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 929 transitions, 15339 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:13,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:13,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:13,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:13,668 INFO L130 PetriNetUnfolder]: 1951/3046 cut-off events. [2022-12-13 07:21:13,668 INFO L131 PetriNetUnfolder]: For 974/974 co-relation queries the response was YES. [2022-12-13 07:21:13,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27436 conditions, 3046 events. 1951/3046 cut-off events. For 974/974 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15432 event pairs, 24 based on Foata normal form. 12/2198 useless extension candidates. Maximal degree in co-relation 24558. Up to 2501 conditions per place. [2022-12-13 07:21:13,684 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 860 selfloop transitions, 71 changer transitions 16/947 dead transitions. [2022-12-13 07:21:13,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 947 transitions, 17536 flow [2022-12-13 07:21:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:21:13,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2022-12-13 07:21:13,686 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-13 07:21:13,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 947 transitions, 17536 flow [2022-12-13 07:21:13,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 931 transitions, 17238 flow [2022-12-13 07:21:13,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:13,755 INFO L89 Accepts]: Start accepts. Operand has 82 places, 931 transitions, 17238 flow [2022-12-13 07:21:13,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:13,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:13,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 931 transitions, 17238 flow [2022-12-13 07:21:13,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 931 transitions, 17238 flow [2022-12-13 07:21:13,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:13,777 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:13,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:21:13,778 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 931 transitions, 17238 flow [2022-12-13 07:21:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:13,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:13,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:13,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:21:13,778 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-13 07:21:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1391209412, now seen corresponding path program 6 times [2022-12-13 07:21:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:13,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345706390] [2022-12-13 07:21:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:13,878 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-13 07:21:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:13,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345706390] [2022-12-13 07:21:13,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345706390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:13,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123825010] [2022-12-13 07:21:13,879 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:13,880 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-13 07:21:13,882 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-13 07:21:13,955 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:21:13,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:13,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:21:13,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:14,007 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-13 07:21:14,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:14,073 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-13 07:21:14,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123825010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:14,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:14,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 07:21:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947444524] [2022-12-13 07:21:14,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:14,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:21:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:21:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:21:14,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:14,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 931 transitions, 17238 flow. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-13 07:21:14,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:14,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:14,801 INFO L130 PetriNetUnfolder]: 1927/2994 cut-off events. [2022-12-13 07:21:14,801 INFO L131 PetriNetUnfolder]: For 941/941 co-relation queries the response was YES. [2022-12-13 07:21:14,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29959 conditions, 2994 events. 1927/2994 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14957 event pairs, 24 based on Foata normal form. 0/2156 useless extension candidates. Maximal degree in co-relation 26793. Up to 2477 conditions per place. [2022-12-13 07:21:14,817 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 847 selfloop transitions, 75 changer transitions 0/922 dead transitions. [2022-12-13 07:21:14,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-13 07:21:14,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2022-12-13 07:21:14,819 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2022-12-13 07:21:14,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:14,864 INFO L89 Accepts]: Start accepts. Operand has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:14,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:14,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:14,891 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:14,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 07:21:14,892 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 922 transitions, 18911 flow [2022-12-13 07:21:14,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-13 07:21:14,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:14,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:14,904 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-13 07:21:15,098 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-13 07:21:15,100 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-13 07:21:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1644924168, now seen corresponding path program 1 times [2022-12-13 07:21:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025668350] [2022-12-13 07:21:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:15,209 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-13 07:21:15,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:15,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025668350] [2022-12-13 07:21:15,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025668350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:15,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133609502] [2022-12-13 07:21:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:15,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:15,211 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-13 07:21:15,246 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-13 07:21:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:15,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:15,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:15,392 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-13 07:21:15,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:15,452 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-13 07:21:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133609502] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2022-12-13 07:21:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522334625] [2022-12-13 07:21:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:15,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:21:15,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:15,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 922 transitions, 18911 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-13 07:21:15,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:15,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:15,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:16,209 INFO L130 PetriNetUnfolder]: 2274/3513 cut-off events. [2022-12-13 07:21:16,209 INFO L131 PetriNetUnfolder]: For 1178/1178 co-relation queries the response was YES. [2022-12-13 07:21:16,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38622 conditions, 3513 events. 2274/3513 cut-off events. For 1178/1178 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17957 event pairs, 6 based on Foata normal form. 0/2505 useless extension candidates. Maximal degree in co-relation 34548. Up to 2968 conditions per place. [2022-12-13 07:21:16,230 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1013 selfloop transitions, 124 changer transitions 0/1150 dead transitions. [2022-12-13 07:21:16,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-12-13 07:21:16,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6420454545454546 [2022-12-13 07:21:16,232 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2022-12-13 07:21:16,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:16,339 INFO L89 Accepts]: Start accepts. Operand has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:16,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:16,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:16,364 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:16,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 07:21:16,365 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 1150 transitions, 25833 flow [2022-12-13 07:21:16,365 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-13 07:21:16,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:16,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:16,383 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-13 07:21:16,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:16,570 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-13 07:21:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash 446266956, now seen corresponding path program 2 times [2022-12-13 07:21:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838719433] [2022-12-13 07:21:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:16,675 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-13 07:21:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:16,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838719433] [2022-12-13 07:21:16,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838719433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:16,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911696598] [2022-12-13 07:21:16,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:16,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:21:16,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:16,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:16,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:16,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:16,870 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-13 07:21:16,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:16,938 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-13 07:21:16,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911696598] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:16,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2022-12-13 07:21:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124382861] [2022-12-13 07:21:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:16,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:21:16,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:16,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1150 transitions, 25833 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-13 07:21:16,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:16,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:16,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:17,719 INFO L130 PetriNetUnfolder]: 2378/3677 cut-off events. [2022-12-13 07:21:17,720 INFO L131 PetriNetUnfolder]: For 1383/1383 co-relation queries the response was YES. [2022-12-13 07:21:17,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44054 conditions, 3677 events. 2378/3677 cut-off events. For 1383/1383 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18998 event pairs, 6 based on Foata normal form. 0/2617 useless extension candidates. Maximal degree in co-relation 39581. Up to 3132 conditions per place. [2022-12-13 07:21:17,740 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1128 selfloop transitions, 85 changer transitions 0/1226 dead transitions. [2022-12-13 07:21:17,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:21:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:21:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 07:21:17,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 07:21:17,741 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-13 07:21:17,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:17,785 INFO L89 Accepts]: Start accepts. Operand has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:17,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:17,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:17,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:17,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 07:21:17,817 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 1226 transitions, 29973 flow [2022-12-13 07:21:17,817 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-13 07:21:17,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:17,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:17,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 07:21:18,024 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-13 07:21:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 292689546, now seen corresponding path program 3 times [2022-12-13 07:21:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:18,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519268877] [2022-12-13 07:21:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:18,160 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-13 07:21:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519268877] [2022-12-13 07:21:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519268877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398539643] [2022-12-13 07:21:18,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:18,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:18,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:18,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:18,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:21:18,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:21:18,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:18,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 07:21:18,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:18,357 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-13 07:21:18,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:18,430 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-13 07:21:18,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398539643] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:18,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:18,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 16 [2022-12-13 07:21:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510496771] [2022-12-13 07:21:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:18,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:18,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:18,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:21:18,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:18,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 1226 transitions, 29973 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-13 07:21:18,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:18,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:19,130 INFO L130 PetriNetUnfolder]: 2353/3624 cut-off events. [2022-12-13 07:21:19,131 INFO L131 PetriNetUnfolder]: For 1597/1597 co-relation queries the response was YES. [2022-12-13 07:21:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46970 conditions, 3624 events. 2353/3624 cut-off events. For 1597/1597 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18578 event pairs, 0 based on Foata normal form. 0/2590 useless extension candidates. Maximal degree in co-relation 42225. Up to 3079 conditions per place. [2022-12-13 07:21:19,153 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1102 selfloop transitions, 81 changer transitions 0/1196 dead transitions. [2022-12-13 07:21:19,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:21:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:21:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 07:21:19,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 07:21:19,154 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2022-12-13 07:21:19,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:19,249 INFO L89 Accepts]: Start accepts. Operand has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:19,254 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:19,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:19,275 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:19,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 07:21:19,276 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 1196 transitions, 31592 flow [2022-12-13 07:21:19,276 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-13 07:21:19,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:19,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:19,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 07:21:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:19,482 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-13 07:21:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 255821494, now seen corresponding path program 4 times [2022-12-13 07:21:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894295705] [2022-12-13 07:21:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:19,614 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-13 07:21:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:19,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894295705] [2022-12-13 07:21:19,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894295705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:19,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858569058] [2022-12-13 07:21:19,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:19,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:19,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:19,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:19,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:21:19,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:19,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:19,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:21:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:19,776 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-13 07:21:19,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:19,848 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-13 07:21:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858569058] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2022-12-13 07:21:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66347457] [2022-12-13 07:21:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:19,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:21:19,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:19,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 1196 transitions, 31592 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-13 07:21:19,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:19,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:19,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:21,033 INFO L130 PetriNetUnfolder]: 2815/4348 cut-off events. [2022-12-13 07:21:21,033 INFO L131 PetriNetUnfolder]: For 1968/1968 co-relation queries the response was YES. [2022-12-13 07:21:21,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60706 conditions, 4348 events. 2815/4348 cut-off events. For 1968/1968 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23157 event pairs, 6 based on Foata normal form. 0/3074 useless extension candidates. Maximal degree in co-relation 55353. Up to 3779 conditions per place. [2022-12-13 07:21:21,062 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1367 selfloop transitions, 94 changer transitions 0/1474 dead transitions. [2022-12-13 07:21:21,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:21:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:21:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-13 07:21:21,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 07:21:21,064 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2022-12-13 07:21:21,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:21,135 INFO L89 Accepts]: Start accepts. Operand has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:21,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:21,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:21,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:21,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 07:21:21,192 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 1474 transitions, 41895 flow [2022-12-13 07:21:21,192 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-13 07:21:21,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:21,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:21,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:21,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:21,400 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-13 07:21:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash 409398904, now seen corresponding path program 5 times [2022-12-13 07:21:21,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834504335] [2022-12-13 07:21:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:21,637 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-13 07:21:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:21,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834504335] [2022-12-13 07:21:21,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834504335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:21,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352649855] [2022-12-13 07:21:21,637 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:21:21,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:21,639 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:21,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:21:21,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:21,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:21,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:21:21,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:21,753 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-13 07:21:21,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:21,814 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-13 07:21:21,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352649855] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:21,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:21,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 10 [2022-12-13 07:21:21,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268553608] [2022-12-13 07:21:21,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:21,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:21:21,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:21,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 1474 transitions, 41895 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-13 07:21:21,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:21,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:21,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:22,993 INFO L130 PetriNetUnfolder]: 2834/4383 cut-off events. [2022-12-13 07:21:22,993 INFO L131 PetriNetUnfolder]: For 2364/2364 co-relation queries the response was YES. [2022-12-13 07:21:22,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65519 conditions, 4383 events. 2834/4383 cut-off events. For 2364/2364 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23504 event pairs, 6 based on Foata normal form. 0/3105 useless extension candidates. Maximal degree in co-relation 59801. Up to 3814 conditions per place. [2022-12-13 07:21:23,018 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1385 selfloop transitions, 94 changer transitions 0/1492 dead transitions. [2022-12-13 07:21:23,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:21:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:21:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-13 07:21:23,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 07:21:23,019 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2022-12-13 07:21:23,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:23,075 INFO L89 Accepts]: Start accepts. Operand has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:23,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:23,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:23,113 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:23,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 07:21:23,114 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 1492 transitions, 45366 flow [2022-12-13 07:21:23,114 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-13 07:21:23,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:23,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:23,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 07:21:23,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 07:21:23,319 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-13 07:21:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash -461963192, now seen corresponding path program 6 times [2022-12-13 07:21:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:23,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547056370] [2022-12-13 07:21:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:23,440 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-13 07:21:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:23,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547056370] [2022-12-13 07:21:23,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547056370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:23,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027468439] [2022-12-13 07:21:23,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:21:23,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:23,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:23,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:21:23,523 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:21:23,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:23,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:23,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:23,708 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-13 07:21:23,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:23,763 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-13 07:21:23,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027468439] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:23,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:23,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2022-12-13 07:21:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784873679] [2022-12-13 07:21:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:23,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:21:23,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:23,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 1492 transitions, 45366 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-13 07:21:23,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:23,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:23,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:25,021 INFO L130 PetriNetUnfolder]: 2815/4336 cut-off events. [2022-12-13 07:21:25,022 INFO L131 PetriNetUnfolder]: For 2768/2768 co-relation queries the response was YES. [2022-12-13 07:21:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69078 conditions, 4336 events. 2815/4336 cut-off events. For 2768/2768 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 22947 event pairs, 6 based on Foata normal form. 0/3078 useless extension candidates. Maximal degree in co-relation 63094. Up to 3767 conditions per place. [2022-12-13 07:21:25,059 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1381 selfloop transitions, 166 changer transitions 0/1560 dead transitions. [2022-12-13 07:21:25,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-12-13 07:21:25,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6420454545454546 [2022-12-13 07:21:25,062 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 93 predicate places. [2022-12-13 07:21:25,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:25,145 INFO L89 Accepts]: Start accepts. Operand has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:25,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:25,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:25,185 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:25,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 07:21:25,185 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 1560 transitions, 50503 flow [2022-12-13 07:21:25,185 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-13 07:21:25,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:25,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:25,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:25,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:21:25,391 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-13 07:21:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1897158106, now seen corresponding path program 7 times [2022-12-13 07:21:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284759308] [2022-12-13 07:21:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:25,533 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-13 07:21:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284759308] [2022-12-13 07:21:25,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284759308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325292917] [2022-12-13 07:21:25,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:25,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:25,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:21:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:25,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:25,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:25,760 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-13 07:21:25,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:25,878 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-13 07:21:25,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325292917] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:25,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:25,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2022-12-13 07:21:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974219817] [2022-12-13 07:21:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:25,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:21:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:21:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:21:25,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 07:21:25,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1560 transitions, 50503 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-13 07:21:25,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:25,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 07:21:25,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:27,499 INFO L130 PetriNetUnfolder]: 3109/4804 cut-off events. [2022-12-13 07:21:27,499 INFO L131 PetriNetUnfolder]: For 3314/3314 co-relation queries the response was YES. [2022-12-13 07:21:27,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81258 conditions, 4804 events. 3109/4804 cut-off events. For 3314/3314 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 26000 event pairs, 6 based on Foata normal form. 0/3414 useless extension candidates. Maximal degree in co-relation 74221. Up to 4211 conditions per place. [2022-12-13 07:21:27,551 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1495 selfloop transitions, 187 changer transitions 0/1714 dead transitions. [2022-12-13 07:21:27,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:21:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:21:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-13 07:21:27,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2022-12-13 07:21:27,553 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 100 predicate places. [2022-12-13 07:21:27,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:27,842 INFO L89 Accepts]: Start accepts. Operand has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:27,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:27,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:27,878 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:27,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 07:21:27,878 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 1714 transitions, 58832 flow [2022-12-13 07:21:27,878 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-13 07:21:27,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:27,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:27,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:28,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:21:28,083 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-13 07:21:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1775179607, now seen corresponding path program 3 times [2022-12-13 07:21:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:28,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556018487] [2022-12-13 07:21:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:28,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:28,188 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-13 07:21:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:28,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556018487] [2022-12-13 07:21:28,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556018487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:21:28,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:21:28,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:21:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758720336] [2022-12-13 07:21:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:28,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:21:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:21:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:21:28,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:28,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 1714 transitions, 58832 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:28,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:28,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:29,791 INFO L130 PetriNetUnfolder]: 3302/5133 cut-off events. [2022-12-13 07:21:29,791 INFO L131 PetriNetUnfolder]: For 3935/3935 co-relation queries the response was YES. [2022-12-13 07:21:29,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92007 conditions, 5133 events. 3302/5133 cut-off events. For 3935/3935 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 28443 event pairs, 0 based on Foata normal form. 18/3679 useless extension candidates. Maximal degree in co-relation 84007. Up to 4401 conditions per place. [2022-12-13 07:21:29,825 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 1750 selfloop transitions, 91 changer transitions 26/1867 dead transitions. [2022-12-13 07:21:29,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1867 transitions, 67854 flow [2022-12-13 07:21:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:21:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:21:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-13 07:21:29,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.551948051948052 [2022-12-13 07:21:29,827 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2022-12-13 07:21:29,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 1867 transitions, 67854 flow [2022-12-13 07:21:29,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 1841 transitions, 66893 flow [2022-12-13 07:21:29,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:29,907 INFO L89 Accepts]: Start accepts. Operand has 134 places, 1841 transitions, 66893 flow [2022-12-13 07:21:29,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:29,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:29,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 1841 transitions, 66893 flow [2022-12-13 07:21:29,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 1841 transitions, 66893 flow [2022-12-13 07:21:29,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:29,951 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:29,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 07:21:29,951 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 1841 transitions, 66893 flow [2022-12-13 07:21:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:21:29,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:29,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 07:21:29,952 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-13 07:21:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1439950457, now seen corresponding path program 4 times [2022-12-13 07:21:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582140252] [2022-12-13 07:21:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:30,042 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-13 07:21:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:30,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582140252] [2022-12-13 07:21:30,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582140252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:30,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675543530] [2022-12-13 07:21:30,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:21:30,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:30,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:21:30,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:21:30,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:30,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 07:21:30,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:30,256 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-13 07:21:30,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:33,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (let ((.cse0 (+ (* 4294967295 aux_mod_~a~0_21) 1))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)) (< (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) aux_mod_~a~0_21) (> 0 aux_mod_~a~0_21))) is different from false [2022-12-13 07:21:35,635 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-13 07:21:35,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675543530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:35,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:35,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2022-12-13 07:21:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41398272] [2022-12-13 07:21:35,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:21:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:21:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=137, Unknown=2, NotChecked=24, Total=210 [2022-12-13 07:21:35,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:35,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 1841 transitions, 66893 flow. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-13 07:21:35,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:35,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:37,946 INFO L130 PetriNetUnfolder]: 3410/5313 cut-off events. [2022-12-13 07:21:37,946 INFO L131 PetriNetUnfolder]: For 3844/3844 co-relation queries the response was YES. [2022-12-13 07:21:37,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100588 conditions, 5313 events. 3410/5313 cut-off events. For 3844/3844 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29812 event pairs, 6 based on Foata normal form. 0/3799 useless extension candidates. Maximal degree in co-relation 92069. Up to 4623 conditions per place. [2022-12-13 07:21:37,986 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 1802 selfloop transitions, 114 changer transitions 0/1916 dead transitions. [2022-12-13 07:21:37,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:21:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:21:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2022-12-13 07:21:37,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 07:21:37,988 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 116 predicate places. [2022-12-13 07:21:37,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:38,081 INFO L89 Accepts]: Start accepts. Operand has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:38,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:38,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:38,131 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:38,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 07:21:38,132 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 1916 transitions, 73488 flow [2022-12-13 07:21:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-13 07:21:38,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:38,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:38,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:21:38,342 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-13 07:21:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1683178030, now seen corresponding path program 8 times [2022-12-13 07:21:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397546831] [2022-12-13 07:21:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:38,468 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-13 07:21:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397546831] [2022-12-13 07:21:38,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397546831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043385864] [2022-12-13 07:21:38,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:38,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:38,484 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:38,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:21:38,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:38,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:38,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:38,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:38,795 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-13 07:21:38,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:38,970 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-13 07:21:38,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043385864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:38,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:38,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-12-13 07:21:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051376072] [2022-12-13 07:21:38,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:38,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:21:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:21:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:21:38,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:38,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1916 transitions, 73488 flow. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-13 07:21:38,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:38,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:38,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:42,861 INFO L130 PetriNetUnfolder]: 4979/7852 cut-off events. [2022-12-13 07:21:42,862 INFO L131 PetriNetUnfolder]: For 4812/4812 co-relation queries the response was YES. [2022-12-13 07:21:42,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156851 conditions, 7852 events. 4979/7852 cut-off events. For 4812/4812 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 48390 event pairs, 0 based on Foata normal form. 0/5592 useless extension candidates. Maximal degree in co-relation 143681. Up to 7036 conditions per place. [2022-12-13 07:21:42,951 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 2443 selfloop transitions, 549 changer transitions 0/2992 dead transitions. [2022-12-13 07:21:42,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 07:21:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 07:21:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 409 transitions. [2022-12-13 07:21:42,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5633608815426997 [2022-12-13 07:21:42,954 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 146 predicate places. [2022-12-13 07:21:42,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:43,134 INFO L89 Accepts]: Start accepts. Operand has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:43,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:43,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:43,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:43,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 07:21:43,237 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 2992 transitions, 121002 flow [2022-12-13 07:21:43,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-13 07:21:43,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:43,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:43,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 07:21:43,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:43,442 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-13 07:21:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash -208027534, now seen corresponding path program 9 times [2022-12-13 07:21:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:43,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207806326] [2022-12-13 07:21:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:43,537 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-13 07:21:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:43,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207806326] [2022-12-13 07:21:43,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207806326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:43,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997573267] [2022-12-13 07:21:43,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:21:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:43,553 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:21:43,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:21:43,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:43,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:21:43,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:43,788 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-13 07:21:43,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:48,071 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-13 07:21:48,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997573267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:48,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:48,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-12-13 07:21:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878318289] [2022-12-13 07:21:48,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:48,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:21:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:21:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:21:48,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:48,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 2992 transitions, 121002 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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-13 07:21:48,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:48,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:48,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:53,174 INFO L130 PetriNetUnfolder]: 5329/8474 cut-off events. [2022-12-13 07:21:53,174 INFO L131 PetriNetUnfolder]: For 4985/4985 co-relation queries the response was YES. [2022-12-13 07:21:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177844 conditions, 8474 events. 5329/8474 cut-off events. For 4985/4985 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 53723 event pairs, 0 based on Foata normal form. 0/6020 useless extension candidates. Maximal degree in co-relation 163421. Up to 7658 conditions per place. [2022-12-13 07:21:53,246 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 2812 selfloop transitions, 453 changer transitions 0/3265 dead transitions. [2022-12-13 07:21:53,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 07:21:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 07:21:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 289 transitions. [2022-12-13 07:21:53,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5473484848484849 [2022-12-13 07:21:53,248 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 169 predicate places. [2022-12-13 07:21:53,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:53,507 INFO L89 Accepts]: Start accepts. Operand has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:53,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:53,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:53,609 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:21:53,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 07:21:53,610 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 3265 transitions, 138650 flow [2022-12-13 07:21:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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-13 07:21:53,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:53,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:21:53,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:21:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-13 07:21:53,812 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-13 07:21:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 982113452, now seen corresponding path program 7 times [2022-12-13 07:21:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124035319] [2022-12-13 07:21:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:53,974 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-13 07:21:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124035319] [2022-12-13 07:21:53,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124035319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438367584] [2022-12-13 07:21:53,974 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:21:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:53,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:53,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:21:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:21:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:54,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 07:21:54,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:54,209 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-13 07:21:54,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:56,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) is different from false [2022-12-13 07:21:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:21:56,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438367584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:21:56,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:21:56,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-12-13 07:21:56,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385697809] [2022-12-13 07:21:56,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:21:56,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:21:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:21:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=163, Unknown=1, NotChecked=26, Total=240 [2022-12-13 07:21:56,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:21:56,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 3265 transitions, 138650 flow. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-13 07:21:56,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:56,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:21:56,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:21:58,666 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~x_3~0 0) (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0))))) is different from false [2022-12-13 07:22:01,344 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296))) is different from false [2022-12-13 07:22:11,059 INFO L130 PetriNetUnfolder]: 8961/14168 cut-off events. [2022-12-13 07:22:11,060 INFO L131 PetriNetUnfolder]: For 8441/8441 co-relation queries the response was YES. [2022-12-13 07:22:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311601 conditions, 14168 events. 8961/14168 cut-off events. For 8441/8441 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 96807 event pairs, 0 based on Foata normal form. 0/9933 useless extension candidates. Maximal degree in co-relation 276639. Up to 12986 conditions per place. [2022-12-13 07:22:11,298 INFO L137 encePairwiseOnDemand]: 7/22 looper letters, 4641 selfloop transitions, 711 changer transitions 0/5352 dead transitions. [2022-12-13 07:22:11,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 07:22:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 07:22:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 246 transitions. [2022-12-13 07:22:11,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5885167464114832 [2022-12-13 07:22:11,300 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 187 predicate places. [2022-12-13 07:22:11,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:11,604 INFO L89 Accepts]: Start accepts. Operand has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:11,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:11,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:11,826 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:11,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-13 07:22:11,827 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 5352 transitions, 237990 flow [2022-12-13 07:22:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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-13 07:22:11,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:11,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:11,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 07:22:12,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:12,032 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-13 07:22:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1013457852, now seen corresponding path program 10 times [2022-12-13 07:22:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:12,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46920328] [2022-12-13 07:22:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:12,137 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-13 07:22:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:12,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46920328] [2022-12-13 07:22:12,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46920328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:12,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065947329] [2022-12-13 07:22:12,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:22:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:12,152 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:12,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 07:22:12,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:22:12,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:12,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:22:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:12,344 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-13 07:22:12,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:12,422 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-13 07:22:12,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065947329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:12,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:12,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:22:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559131526] [2022-12-13 07:22:12,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:12,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:22:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:22:12,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:22:12,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:22:12,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 5352 transitions, 237990 flow. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:22:12,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:12,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:22:12,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:28,159 INFO L130 PetriNetUnfolder]: 8845/13952 cut-off events. [2022-12-13 07:22:28,159 INFO L131 PetriNetUnfolder]: For 8415/8415 co-relation queries the response was YES. [2022-12-13 07:22:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320768 conditions, 13952 events. 8845/13952 cut-off events. For 8415/8415 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 94648 event pairs, 0 based on Foata normal form. 0/9821 useless extension candidates. Maximal degree in co-relation 284924. Up to 12770 conditions per place. [2022-12-13 07:22:28,293 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 5006 selfloop transitions, 257 changer transitions 0/5263 dead transitions. [2022-12-13 07:22:28,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:22:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:22:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-13 07:22:28,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6038961038961039 [2022-12-13 07:22:28,294 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 193 predicate places. [2022-12-13 07:22:28,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:28,707 INFO L89 Accepts]: Start accepts. Operand has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:28,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:28,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:28,923 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:28,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-13 07:22:28,924 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 5263 transitions, 244516 flow [2022-12-13 07:22:28,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:22:28,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:28,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:29,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:29,128 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:22:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1258544766, now seen corresponding path program 8 times [2022-12-13 07:22:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:29,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961168003] [2022-12-13 07:22:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:29,244 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-13 07:22:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961168003] [2022-12-13 07:22:29,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961168003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478103729] [2022-12-13 07:22:29,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:22:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:29,246 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:29,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:22:29,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:22:29,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:29,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:22:29,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:29,397 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-13 07:22:29,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:31,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) is different from false [2022-12-13 07:22:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:22:31,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478103729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:31,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:31,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-12-13 07:22:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914562425] [2022-12-13 07:22:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:31,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:22:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:22:31,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2022-12-13 07:22:31,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:22:31,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 5263 transitions, 244516 flow. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 07:22:31,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:31,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:22:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:47,020 INFO L130 PetriNetUnfolder]: 8829/13936 cut-off events. [2022-12-13 07:22:47,021 INFO L131 PetriNetUnfolder]: For 8439/8439 co-relation queries the response was YES. [2022-12-13 07:22:47,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334337 conditions, 13936 events. 8829/13936 cut-off events. For 8439/8439 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 94467 event pairs, 4 based on Foata normal form. 0/9821 useless extension candidates. Maximal degree in co-relation 296942. Up to 12754 conditions per place. [2022-12-13 07:22:47,147 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 4875 selfloop transitions, 385 changer transitions 0/5260 dead transitions. [2022-12-13 07:22:47,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:22:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:22:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2022-12-13 07:22:47,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5991735537190083 [2022-12-13 07:22:47,149 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 203 predicate places. [2022-12-13 07:22:47,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:47,472 INFO L89 Accepts]: Start accepts. Operand has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:47,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:47,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:47,699 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:47,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-13 07:22:47,700 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 5260 transitions, 254898 flow [2022-12-13 07:22:47,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 07:22:47,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:47,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:22:47,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:22:47,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 07:22:47,905 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:22:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1104967356, now seen corresponding path program 9 times [2022-12-13 07:22:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182442225] [2022-12-13 07:22:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:48,030 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-13 07:22:48,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182442225] [2022-12-13 07:22:48,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182442225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:22:48,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145397397] [2022-12-13 07:22:48,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:22:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:22:48,032 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:22:48,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:22:48,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:22:48,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:22:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:22:48,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:22:48,339 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-13 07:22:48,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:22:58,742 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-13 07:22:58,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145397397] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:22:58,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:22:58,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2022-12-13 07:22:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154588579] [2022-12-13 07:22:58,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:22:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:22:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:22:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=174, Unknown=4, NotChecked=0, Total=240 [2022-12-13 07:22:58,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:22:58,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 5260 transitions, 254898 flow. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-13 07:22:58,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:58,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:22:58,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:00,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:02,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:05,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:07,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:09,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:11,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:13,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:15,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:17,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:19,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:21,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:23,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:26,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:28,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:30,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:32,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:34,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:38,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:23:51,351 INFO L130 PetriNetUnfolder]: 9783/15376 cut-off events. [2022-12-13 07:23:51,351 INFO L131 PetriNetUnfolder]: For 9205/9205 co-relation queries the response was YES. [2022-12-13 07:23:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384363 conditions, 15376 events. 9783/15376 cut-off events. For 9205/9205 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 105272 event pairs, 4 based on Foata normal form. 0/10805 useless extension candidates. Maximal degree in co-relation 340993. Up to 14104 conditions per place. [2022-12-13 07:23:51,503 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 5250 selfloop transitions, 618 changer transitions 0/5868 dead transitions. [2022-12-13 07:23:51,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 07:23:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 07:23:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 174 transitions. [2022-12-13 07:23:51,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2022-12-13 07:23:51,504 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 221 predicate places. [2022-12-13 07:23:51,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:51,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:51,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:23:51,911 INFO L89 Accepts]: Start accepts. Operand has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:51,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:23:51,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:23:51,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:52,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:52,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:23:52,204 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:23:52,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 07:23:52,205 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 5868 transitions, 296096 flow [2022-12-13 07:23:52,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-13 07:23:52,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:23:52,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:23:52,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 07:23:52,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:52,410 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:23:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:23:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 50819976, now seen corresponding path program 10 times [2022-12-13 07:23:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:23:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216552885] [2022-12-13 07:23:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:23:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:23:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:23:52,511 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-13 07:23:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:23:52,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216552885] [2022-12-13 07:23:52,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216552885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:23:52,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652598587] [2022-12-13 07:23:52,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:23:52,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:23:52,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:23:52,513 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:23:52,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:23:52,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:23:52,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:23:52,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:23:52,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:23:52,663 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-13 07:23:52,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:23:54,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~b~0_21 Int)) (or (> 0 aux_mod_~b~0_21) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1))) (< (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) aux_mod_~b~0_21))) is different from false [2022-12-13 07:23:54,781 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-13 07:23:54,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652598587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:23:54,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:23:54,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-12-13 07:23:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931065794] [2022-12-13 07:23:54,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:23:54,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:23:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:23:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:23:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2022-12-13 07:23:54,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:23:54,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 5868 transitions, 296096 flow. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-13 07:23:54,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:23:54,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:23:54,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:23:57,679 WARN L837 $PredicateComparison]: unable to prove that (and (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296)) (forall ((aux_mod_~b~0_21 Int)) (or (> 0 aux_mod_~b~0_21) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1))) (< (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) aux_mod_~b~0_21)))) is different from false [2022-12-13 07:24:17,846 INFO L130 PetriNetUnfolder]: 10059/15932 cut-off events. [2022-12-13 07:24:17,847 INFO L131 PetriNetUnfolder]: For 9420/9420 co-relation queries the response was YES. [2022-12-13 07:24:17,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414179 conditions, 15932 events. 10059/15932 cut-off events. For 9420/9420 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 111237 event pairs, 4 based on Foata normal form. 0/11245 useless extension candidates. Maximal degree in co-relation 368232. Up to 14621 conditions per place. [2022-12-13 07:24:18,141 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 5350 selfloop transitions, 757 changer transitions 0/6107 dead transitions. [2022-12-13 07:24:18,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:24:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:24:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 198 transitions. [2022-12-13 07:24:18,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 07:24:18,143 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 236 predicate places. [2022-12-13 07:24:18,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:18,556 INFO L89 Accepts]: Start accepts. Operand has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:18,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:18,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:18,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:18,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-13 07:24:18,865 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 6107 transitions, 320385 flow [2022-12-13 07:24:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-13 07:24:18,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:18,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:24:18,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 07:24:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:19,080 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:24:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:24:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash -3851907, now seen corresponding path program 5 times [2022-12-13 07:24:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:24:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098020294] [2022-12-13 07:24:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:24:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:19,229 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-13 07:24:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:24:19,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098020294] [2022-12-13 07:24:19,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098020294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:24:19,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:24:19,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:24:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638276825] [2022-12-13 07:24:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:24:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:24:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:24:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:24:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:24:19,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:24:19,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 6107 transitions, 320385 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:24:19,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:24:19,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:24:19,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:24:42,194 INFO L130 PetriNetUnfolder]: 10021/15866 cut-off events. [2022-12-13 07:24:42,194 INFO L131 PetriNetUnfolder]: For 9407/9407 co-relation queries the response was YES. [2022-12-13 07:24:42,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428320 conditions, 15866 events. 10021/15866 cut-off events. For 9407/9407 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 110644 event pairs, 4 based on Foata normal form. 18/11209 useless extension candidates. Maximal degree in co-relation 380724. Up to 14555 conditions per place. [2022-12-13 07:24:42,353 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 5869 selfloop transitions, 186 changer transitions 26/6081 dead transitions. [2022-12-13 07:24:42,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 6081 transitions, 331171 flow [2022-12-13 07:24:42,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:24:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:24:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:24:42,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2022-12-13 07:24:42,354 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 242 predicate places. [2022-12-13 07:24:42,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 6081 transitions, 331171 flow [2022-12-13 07:24:42,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 6055 transitions, 329742 flow [2022-12-13 07:24:42,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:42,778 INFO L89 Accepts]: Start accepts. Operand has 269 places, 6055 transitions, 329742 flow [2022-12-13 07:24:42,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:42,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:42,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 6055 transitions, 329742 flow [2022-12-13 07:24:43,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 6055 transitions, 329742 flow [2022-12-13 07:24:43,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:43,095 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:43,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-13 07:24:43,095 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 6055 transitions, 329742 flow [2022-12-13 07:24:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:24:43,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:43,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:24:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 07:24:43,096 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:24:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:24:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2134218088, now seen corresponding path program 11 times [2022-12-13 07:24:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:24:43,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522247015] [2022-12-13 07:24:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:24:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:43,200 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-13 07:24:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:24:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522247015] [2022-12-13 07:24:43,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522247015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:24:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31508405] [2022-12-13 07:24:43,201 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:24:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:24:43,202 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:24:43,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 07:24:43,300 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:24:43,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:24:43,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:24:43,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:24:43,353 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-13 07:24:43,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:24:43,425 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-13 07:24:43,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31508405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:24:43,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:24:43,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-12-13 07:24:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975057992] [2022-12-13 07:24:43,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:24:43,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:24:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:24:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:24:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:24:43,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:24:43,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 6055 transitions, 329742 flow. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-13 07:24:43,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:24:43,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:24:43,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:25:12,622 INFO L130 PetriNetUnfolder]: 10045/15884 cut-off events. [2022-12-13 07:25:12,622 INFO L131 PetriNetUnfolder]: For 9339/9339 co-relation queries the response was YES. [2022-12-13 07:25:12,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444691 conditions, 15884 events. 10045/15884 cut-off events. For 9339/9339 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 110511 event pairs, 4 based on Foata normal form. 0/11223 useless extension candidates. Maximal degree in co-relation 395400. Up to 14609 conditions per place. [2022-12-13 07:25:12,821 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 5476 selfloop transitions, 599 changer transitions 0/6075 dead transitions. [2022-12-13 07:25:12,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:25:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:25:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-12-13 07:25:12,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4834710743801653 [2022-12-13 07:25:12,823 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 250 predicate places. [2022-12-13 07:25:12,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:25:13,424 INFO L89 Accepts]: Start accepts. Operand has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:25:13,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:25:13,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:25:13,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:25:13,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-13 07:25:13,707 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 6075 transitions, 342984 flow [2022-12-13 07:25:13,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-13 07:25:13,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:25:13,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:25:13,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 07:25:13,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:25:13,913 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:25:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:25:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1717831120, now seen corresponding path program 12 times [2022-12-13 07:25:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:25:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664110703] [2022-12-13 07:25:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:25:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:25:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:25:13,994 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-13 07:25:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:25:13,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664110703] [2022-12-13 07:25:13,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664110703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:25:13,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:25:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:25:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325430659] [2022-12-13 07:25:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:25:13,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:25:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:25:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:25:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:25:13,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:25:13,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 6075 transitions, 342984 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:25:13,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:25:13,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:25:13,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:25:43,698 INFO L130 PetriNetUnfolder]: 10107/15998 cut-off events. [2022-12-13 07:25:43,698 INFO L131 PetriNetUnfolder]: For 9335/9335 co-relation queries the response was YES. [2022-12-13 07:25:43,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463894 conditions, 15998 events. 10107/15998 cut-off events. For 9335/9335 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 111601 event pairs, 5 based on Foata normal form. 0/11313 useless extension candidates. Maximal degree in co-relation 412732. Up to 14697 conditions per place. [2022-12-13 07:25:43,891 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 5936 selfloop transitions, 204 changer transitions 0/6140 dead transitions. [2022-12-13 07:25:43,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:25:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:25:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 07:25:43,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 07:25:43,898 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 256 predicate places. [2022-12-13 07:25:43,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:25:44,360 INFO L89 Accepts]: Start accepts. Operand has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:25:44,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:25:44,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:25:44,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:25:44,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-13 07:25:44,787 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 6140 transitions, 358940 flow [2022-12-13 07:25:44,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:25:44,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:25:44,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:25:44,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 07:25:44,788 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:25:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:25:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1942790542, now seen corresponding path program 13 times [2022-12-13 07:25:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:25:44,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013292509] [2022-12-13 07:25:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:25:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:25:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:25:44,880 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-13 07:25:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:25:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013292509] [2022-12-13 07:25:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013292509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:25:44,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:25:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:25:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473752490] [2022-12-13 07:25:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:25:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:25:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:25:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:25:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:25:44,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:25:44,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 6140 transitions, 358940 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:25:44,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:25:44,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:25:44,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:26:17,550 INFO L130 PetriNetUnfolder]: 10105/16002 cut-off events. [2022-12-13 07:26:17,550 INFO L131 PetriNetUnfolder]: For 9411/9411 co-relation queries the response was YES. [2022-12-13 07:26:17,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480014 conditions, 16002 events. 10105/16002 cut-off events. For 9411/9411 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 111727 event pairs, 0 based on Foata normal form. 6/11323 useless extension candidates. Maximal degree in co-relation 427095. Up to 14697 conditions per place. [2022-12-13 07:26:17,764 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 5852 selfloop transitions, 286 changer transitions 6/6144 dead transitions. [2022-12-13 07:26:17,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 6144 transitions, 371463 flow [2022-12-13 07:26:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:26:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:26:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-13 07:26:17,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42272727272727273 [2022-12-13 07:26:17,765 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 265 predicate places. [2022-12-13 07:26:17,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 6144 transitions, 371463 flow [2022-12-13 07:26:18,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 6138 transitions, 371100 flow [2022-12-13 07:26:18,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:26:18,320 INFO L89 Accepts]: Start accepts. Operand has 293 places, 6138 transitions, 371100 flow [2022-12-13 07:26:18,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:26:18,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:26:18,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 6138 transitions, 371100 flow [2022-12-13 07:26:18,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 6138 transitions, 371100 flow [2022-12-13 07:26:18,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:26:18,627 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:26:18,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-13 07:26:18,628 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 6138 transitions, 371100 flow [2022-12-13 07:26:18,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:26:18,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:26:18,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:26:18,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 07:26:18,628 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:26:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:26:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -955087568, now seen corresponding path program 11 times [2022-12-13 07:26:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:26:18,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132558938] [2022-12-13 07:26:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:26:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:26:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:26:18,732 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-13 07:26:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:26:18,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132558938] [2022-12-13 07:26:18,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132558938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:26:18,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445123740] [2022-12-13 07:26:18,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:26:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:26:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:26:18,735 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:26:18,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 07:26:18,826 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:26:18,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:26:18,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:26:18,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:26:18,872 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-13 07:26:18,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:26:18,958 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-13 07:26:18,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445123740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:26:18,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:26:18,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-12-13 07:26:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215569372] [2022-12-13 07:26:18,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:26:18,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:26:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:26:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:26:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:26:18,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:26:18,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 6138 transitions, 371100 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-13 07:26:18,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:26:18,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:26:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:26:50,798 INFO L130 PetriNetUnfolder]: 11203/17858 cut-off events. [2022-12-13 07:26:50,798 INFO L131 PetriNetUnfolder]: For 10793/10793 co-relation queries the response was YES. [2022-12-13 07:26:50,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553732 conditions, 17858 events. 11203/17858 cut-off events. For 10793/10793 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 128271 event pairs, 4 based on Foata normal form. 0/12593 useless extension candidates. Maximal degree in co-relation 490094. Up to 16496 conditions per place. [2022-12-13 07:26:50,994 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6436 selfloop transitions, 450 changer transitions 0/6886 dead transitions. [2022-12-13 07:26:50,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:26:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:26:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-12-13 07:26:50,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2022-12-13 07:26:50,997 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 273 predicate places. [2022-12-13 07:26:50,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:51,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:51,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:26:51,739 INFO L89 Accepts]: Start accepts. Operand has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:51,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:26:51,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:26:51,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:52,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:52,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:26:52,192 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:26:52,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-13 07:26:52,193 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 6886 transitions, 430216 flow [2022-12-13 07:26:52,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-13 07:26:52,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:26:52,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:26:52,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 07:26:52,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:26:52,398 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:26:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:26:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2068591478, now seen corresponding path program 12 times [2022-12-13 07:26:52,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:26:52,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381653425] [2022-12-13 07:26:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:26:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:26:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:26:52,542 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-13 07:26:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:26:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381653425] [2022-12-13 07:26:52,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381653425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:26:52,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:26:52,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:26:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125923701] [2022-12-13 07:26:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:26:52,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:26:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:26:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:26:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:26:52,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:26:52,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 6886 transitions, 430216 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:26:52,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:26:52,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:26:52,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:27:30,763 INFO L130 PetriNetUnfolder]: 11150/17761 cut-off events. [2022-12-13 07:27:30,763 INFO L131 PetriNetUnfolder]: For 10678/10678 co-relation queries the response was YES. [2022-12-13 07:27:30,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568472 conditions, 17761 events. 11150/17761 cut-off events. For 10678/10678 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 127106 event pairs, 5 based on Foata normal form. 0/12544 useless extension candidates. Maximal degree in co-relation 503049. Up to 16399 conditions per place. [2022-12-13 07:27:31,189 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6577 selfloop transitions, 267 changer transitions 0/6844 dead transitions. [2022-12-13 07:27:31,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:27:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:27:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 07:27:31,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2022-12-13 07:27:31,191 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 279 predicate places. [2022-12-13 07:27:31,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:31,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:31,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:27:31,875 INFO L89 Accepts]: Start accepts. Operand has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:32,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:27:32,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:27:32,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:32,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:32,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:27:32,397 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:27:32,400 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-13 07:27:32,400 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 6844 transitions, 441261 flow [2022-12-13 07:27:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:27:32,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:27:32,400 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:27:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 07:27:32,400 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:27:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:27:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1061070468, now seen corresponding path program 13 times [2022-12-13 07:27:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:27:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033898324] [2022-12-13 07:27:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:27:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:27:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:27:32,487 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-13 07:27:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:27:32,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033898324] [2022-12-13 07:27:32,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033898324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:27:32,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310796929] [2022-12-13 07:27:32,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:27:32,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:27:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:27:32,502 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:27:32,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 07:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:27:32,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:27:32,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:27:32,652 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-13 07:27:32,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:27:32,744 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-13 07:27:32,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310796929] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:27:32,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:27:32,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:27:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821659608] [2022-12-13 07:27:32,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:27:32,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:27:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:27:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:27:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:27:32,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:27:32,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 6844 transitions, 441261 flow. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-13 07:27:32,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:27:32,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:27:32,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:28:10,160 INFO L130 PetriNetUnfolder]: 11040/17591 cut-off events. [2022-12-13 07:28:10,160 INFO L131 PetriNetUnfolder]: For 10665/10665 co-relation queries the response was YES. [2022-12-13 07:28:10,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580604 conditions, 17591 events. 11040/17591 cut-off events. For 10665/10665 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 125863 event pairs, 5 based on Foata normal form. 0/12474 useless extension candidates. Maximal degree in co-relation 513743. Up to 16229 conditions per place. [2022-12-13 07:28:10,362 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6337 selfloop transitions, 450 changer transitions 0/6787 dead transitions. [2022-12-13 07:28:10,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:28:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:28:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2022-12-13 07:28:10,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2022-12-13 07:28:10,368 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 288 predicate places. [2022-12-13 07:28:10,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:10,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:11,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:28:11,154 INFO L89 Accepts]: Start accepts. Operand has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:11,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:28:11,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:28:11,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:11,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:11,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:28:11,518 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:28:11,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 365 [2022-12-13 07:28:11,519 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 6787 transitions, 451139 flow [2022-12-13 07:28:11,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-13 07:28:11,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:28:11,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:28:11,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 07:28:11,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:28:11,724 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:28:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:28:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1150764022, now seen corresponding path program 14 times [2022-12-13 07:28:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:28:11,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460906769] [2022-12-13 07:28:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:28:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:28:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:28:11,827 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-13 07:28:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:28:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460906769] [2022-12-13 07:28:11,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460906769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:28:11,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:28:11,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:28:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077315183] [2022-12-13 07:28:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:28:11,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:28:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:28:11,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:28:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:28:11,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:28:11,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 6787 transitions, 451139 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:28:11,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:28:11,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:28:11,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:28:49,216 INFO L130 PetriNetUnfolder]: 11018/17525 cut-off events. [2022-12-13 07:28:49,217 INFO L131 PetriNetUnfolder]: For 10594/10594 co-relation queries the response was YES. [2022-12-13 07:28:49,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595938 conditions, 17525 events. 11018/17525 cut-off events. For 10594/10594 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 124907 event pairs, 4 based on Foata normal form. 6/12426 useless extension candidates. Maximal degree in co-relation 527334. Up to 16163 conditions per place. [2022-12-13 07:28:49,421 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 6490 selfloop transitions, 249 changer transitions 6/6745 dead transitions. [2022-12-13 07:28:49,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 6745 transitions, 461818 flow [2022-12-13 07:28:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:28:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:28:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-13 07:28:49,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2022-12-13 07:28:49,422 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 297 predicate places. [2022-12-13 07:28:49,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 6745 transitions, 461818 flow [2022-12-13 07:28:49,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 6739 transitions, 461407 flow [2022-12-13 07:28:50,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:28:50,097 INFO L89 Accepts]: Start accepts. Operand has 325 places, 6739 transitions, 461407 flow [2022-12-13 07:28:50,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:28:50,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:28:50,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 6739 transitions, 461407 flow [2022-12-13 07:28:50,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 6739 transitions, 461407 flow [2022-12-13 07:28:50,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:28:50,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:28:50,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-13 07:28:50,476 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 6739 transitions, 461407 flow [2022-12-13 07:28:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:28:50,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:28:50,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:28:50,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 07:28:50,476 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:28:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:28:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -366337210, now seen corresponding path program 14 times [2022-12-13 07:28:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:28:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672054178] [2022-12-13 07:28:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:28:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:28:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:28:50,589 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-13 07:28:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:28:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672054178] [2022-12-13 07:28:50,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672054178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:28:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165205572] [2022-12-13 07:28:50,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:28:50,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:28:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:28:50,600 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:28:50,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 07:28:50,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:28:50,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:28:50,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:28:50,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:28:50,749 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-13 07:28:50,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:28:53,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) (* 4294967296 (div (+ (mod c_thread3Thread1of1ForFork0_~i~2 4294967296) .cse0) 4294967296))) .cse0)) (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)))) is different from false [2022-12-13 07:28:55,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) is different from false [2022-12-13 07:28:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:28:55,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165205572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:28:55,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:28:55,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2022-12-13 07:28:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021441698] [2022-12-13 07:28:55,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:28:55,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:28:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:28:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:28:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-12-13 07:28:55,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:28:55,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 6739 transitions, 461407 flow. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-13 07:28:55,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:28:55,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:28:55,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:29:34,603 INFO L130 PetriNetUnfolder]: 11254/17885 cut-off events. [2022-12-13 07:29:34,603 INFO L131 PetriNetUnfolder]: For 10651/10651 co-relation queries the response was YES. [2022-12-13 07:29:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626086 conditions, 17885 events. 11254/17885 cut-off events. For 10651/10651 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 127564 event pairs, 1 based on Foata normal form. 0/12662 useless extension candidates. Maximal degree in co-relation 555187. Up to 16528 conditions per place. [2022-12-13 07:29:34,862 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 6442 selfloop transitions, 478 changer transitions 0/6920 dead transitions. [2022-12-13 07:29:34,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:29:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:29:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2022-12-13 07:29:34,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5206611570247934 [2022-12-13 07:29:34,864 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 306 predicate places. [2022-12-13 07:29:34,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:35,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:35,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:29:35,702 INFO L89 Accepts]: Start accepts. Operand has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:35,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:29:35,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:29:35,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:36,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:36,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:29:36,101 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:29:36,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-13 07:29:36,112 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 6920 transitions, 487631 flow [2022-12-13 07:29:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-13 07:29:36,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:29:36,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:29:36,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 07:29:36,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:29:36,318 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:29:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:29:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1829141878, now seen corresponding path program 15 times [2022-12-13 07:29:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:29:36,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000862736] [2022-12-13 07:29:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:29:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:29:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:29:36,474 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-13 07:29:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:29:36,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000862736] [2022-12-13 07:29:36,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000862736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:29:36,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093038564] [2022-12-13 07:29:36,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:29:36,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:29:36,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:29:36,494 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:29:36,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 07:29:36,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:29:36,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:29:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:29:36,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:29:36,683 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-13 07:29:36,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:29:39,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (mod c_thread2Thread1of1ForFork2_~i~1 4294967296) (* 4294967296 (div (+ (mod c_thread3Thread1of1ForFork0_~i~2 4294967296) .cse0) 4294967296))) .cse0)) (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)))) is different from false [2022-12-13 07:29:41,286 WARN L837 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork2_~i~1 4294967296)) .cse0)))) is different from false [2022-12-13 07:29:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 07:29:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093038564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:29:41,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:29:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2022-12-13 07:29:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876263686] [2022-12-13 07:29:41,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:29:41,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:29:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:29:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:29:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-12-13 07:29:41,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:29:41,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 6920 transitions, 487631 flow. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 07:29:41,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:29:41,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:29:41,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:30:18,936 INFO L130 PetriNetUnfolder]: 11234/17845 cut-off events. [2022-12-13 07:30:18,936 INFO L131 PetriNetUnfolder]: For 10665/10665 co-relation queries the response was YES. [2022-12-13 07:30:18,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642526 conditions, 17845 events. 11234/17845 cut-off events. For 10665/10665 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 127241 event pairs, 4 based on Foata normal form. 0/12642 useless extension candidates. Maximal degree in co-relation 569754. Up to 16488 conditions per place. [2022-12-13 07:30:19,243 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 6420 selfloop transitions, 478 changer transitions 0/6898 dead transitions. [2022-12-13 07:30:19,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:30:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:30:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2022-12-13 07:30:19,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2022-12-13 07:30:19,255 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 316 predicate places. [2022-12-13 07:30:19,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:19,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:19,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:30:19,847 INFO L89 Accepts]: Start accepts. Operand has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:20,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:30:20,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:30:20,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:20,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:20,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:30:20,323 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:30:20,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 477 [2022-12-13 07:30:20,324 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 6898 transitions, 499869 flow [2022-12-13 07:30:20,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-13 07:30:20,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:30:20,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:30:20,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 07:30:20,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:30:20,529 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:30:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:30:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1054131952, now seen corresponding path program 16 times [2022-12-13 07:30:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:30:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733764212] [2022-12-13 07:30:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:30:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:30:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:30:20,631 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-13 07:30:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:30:20,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733764212] [2022-12-13 07:30:20,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733764212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:30:20,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:30:20,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:30:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860073049] [2022-12-13 07:30:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:30:20,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:30:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:30:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:30:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:30:20,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:30:20,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 6898 transitions, 499869 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:30:20,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:30:20,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:30:20,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:02,896 INFO L130 PetriNetUnfolder]: 11218/17809 cut-off events. [2022-12-13 07:31:02,897 INFO L131 PetriNetUnfolder]: For 10659/10659 co-relation queries the response was YES. [2022-12-13 07:31:02,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659034 conditions, 17809 events. 11218/17809 cut-off events. For 10659/10659 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 126852 event pairs, 0 based on Foata normal form. 0/12622 useless extension candidates. Maximal degree in co-relation 584397. Up to 16452 conditions per place. [2022-12-13 07:31:03,120 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6629 selfloop transitions, 247 changer transitions 0/6876 dead transitions. [2022-12-13 07:31:03,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:31:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:31:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-13 07:31:03,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2022-12-13 07:31:03,121 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 322 predicate places. [2022-12-13 07:31:03,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:03,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:03,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:03,852 INFO L89 Accepts]: Start accepts. Operand has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:03,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:03,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:03,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:04,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:04,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:04,244 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:04,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-13 07:31:04,247 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 6876 transitions, 512019 flow [2022-12-13 07:31:04,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:04,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:04,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 07:31:04,247 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:31:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1929913670, now seen corresponding path program 15 times [2022-12-13 07:31:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197276420] [2022-12-13 07:31:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:04,376 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-13 07:31:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197276420] [2022-12-13 07:31:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197276420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:04,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:04,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:31:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269937589] [2022-12-13 07:31:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:04,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:31:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:31:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:31:04,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:04,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 6876 transitions, 512019 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:04,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:04,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:04,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:51,058 INFO L130 PetriNetUnfolder]: 11193/17740 cut-off events. [2022-12-13 07:31:51,059 INFO L131 PetriNetUnfolder]: For 10597/10597 co-relation queries the response was YES. [2022-12-13 07:31:51,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674207 conditions, 17740 events. 11193/17740 cut-off events. For 10597/10597 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 125955 event pairs, 1 based on Foata normal form. 0/12573 useless extension candidates. Maximal degree in co-relation 597867. Up to 16383 conditions per place. [2022-12-13 07:31:51,339 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6592 selfloop transitions, 244 changer transitions 0/6836 dead transitions. [2022-12-13 07:31:51,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:31:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:31:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:31:51,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 07:31:51,341 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 328 predicate places. [2022-12-13 07:31:51,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:51,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:52,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:52,001 INFO L89 Accepts]: Start accepts. Operand has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:52,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:52,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:52,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:52,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:52,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:52,404 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:52,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-13 07:31:52,404 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 6836 transitions, 522692 flow [2022-12-13 07:31:52,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:52,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:52,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:52,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 07:31:52,405 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:31:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1153425232, now seen corresponding path program 16 times [2022-12-13 07:31:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:52,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49782357] [2022-12-13 07:31:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:52,506 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-13 07:31:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49782357] [2022-12-13 07:31:52,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49782357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972042471] [2022-12-13 07:31:52,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:31:52,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:52,520 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:52,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 07:31:52,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:31:52,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:52,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:31:52,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:52,674 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-13 07:31:52,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:52,772 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-13 07:31:52,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972042471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:52,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:52,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:31:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428068045] [2022-12-13 07:31:52,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:31:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:31:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:31:52,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:52,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 6836 transitions, 522692 flow. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-13 07:31:52,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:52,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:52,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:38,809 INFO L130 PetriNetUnfolder]: 11505/18260 cut-off events. [2022-12-13 07:32:38,809 INFO L131 PetriNetUnfolder]: For 10869/10869 co-relation queries the response was YES. [2022-12-13 07:32:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712286 conditions, 18260 events. 11505/18260 cut-off events. For 10869/10869 co-relation queries the response was YES. Maximal size of possible extension queue 1078. Compared 130557 event pairs, 0 based on Foata normal form. 0/12939 useless extension candidates. Maximal degree in co-relation 632843. Up to 16867 conditions per place. [2022-12-13 07:32:39,143 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6607 selfloop transitions, 459 changer transitions 0/7066 dead transitions. [2022-12-13 07:32:39,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:32:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:32:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-13 07:32:39,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-13 07:32:39,145 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 336 predicate places. [2022-12-13 07:32:39,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:39,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:40,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:40,077 INFO L89 Accepts]: Start accepts. Operand has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:40,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:40,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:40,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:40,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:40,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:40,525 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:40,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 459 [2022-12-13 07:32:40,536 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 7066 transitions, 554454 flow [2022-12-13 07:32:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-13 07:32:40,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:40,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:40,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 07:32:40,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 07:32:40,737 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:32:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -754058890, now seen corresponding path program 17 times [2022-12-13 07:32:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:40,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285873411] [2022-12-13 07:32:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:40,933 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-13 07:32:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285873411] [2022-12-13 07:32:40,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285873411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:32:40,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:32:40,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:32:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13185884] [2022-12-13 07:32:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:32:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:32:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:32:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:32:40,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:40,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 7066 transitions, 554454 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:32:40,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:40,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:40,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:33:28,633 INFO L130 PetriNetUnfolder]: 11483/18318 cut-off events. [2022-12-13 07:33:28,633 INFO L131 PetriNetUnfolder]: For 10936/10936 co-relation queries the response was YES. [2022-12-13 07:33:28,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732885 conditions, 18318 events. 11483/18318 cut-off events. For 10936/10936 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 132256 event pairs, 0 based on Foata normal form. 16/13037 useless extension candidates. Maximal degree in co-relation 650965. Up to 16906 conditions per place. [2022-12-13 07:33:28,887 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 6675 selfloop transitions, 432 changer transitions 20/7127 dead transitions. [2022-12-13 07:33:28,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 7127 transitions, 573537 flow [2022-12-13 07:33:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:33:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:33:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-13 07:33:28,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.512987012987013 [2022-12-13 07:33:28,890 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 342 predicate places. [2022-12-13 07:33:28,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 7127 transitions, 573537 flow [2022-12-13 07:33:29,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 7107 transitions, 571926 flow [2022-12-13 07:33:29,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:33:29,640 INFO L89 Accepts]: Start accepts. Operand has 370 places, 7107 transitions, 571926 flow [2022-12-13 07:33:29,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:33:29,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:33:29,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 7107 transitions, 571926 flow [2022-12-13 07:33:30,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 370 places, 7107 transitions, 571926 flow [2022-12-13 07:33:30,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:33:30,059 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:33:30,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-13 07:33:30,060 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 7107 transitions, 571926 flow [2022-12-13 07:33:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:33:30,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:33:30,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:33:30,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 07:33:30,060 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:33:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:33:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1987895302, now seen corresponding path program 18 times [2022-12-13 07:33:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:33:30,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854635570] [2022-12-13 07:33:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:33:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:33:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:30,182 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-13 07:33:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:33:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854635570] [2022-12-13 07:33:30,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854635570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:33:30,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:33:30,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:33:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856734374] [2022-12-13 07:33:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:33:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:33:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:33:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:33:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:33:30,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:33:30,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 7107 transitions, 571926 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:33:30,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:33:30,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:33:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:34:17,761 INFO L130 PetriNetUnfolder]: 11473/18296 cut-off events. [2022-12-13 07:34:17,761 INFO L131 PetriNetUnfolder]: For 10850/10850 co-relation queries the response was YES. [2022-12-13 07:34:17,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750306 conditions, 18296 events. 11473/18296 cut-off events. For 10850/10850 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 131893 event pairs, 4 based on Foata normal form. 6/13017 useless extension candidates. Maximal degree in co-relation 666344. Up to 16910 conditions per place. [2022-12-13 07:34:18,005 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 6688 selfloop transitions, 422 changer transitions 6/7116 dead transitions. [2022-12-13 07:34:18,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 7116 transitions, 586881 flow [2022-12-13 07:34:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:34:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:34:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 07:34:18,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 07:34:18,007 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 347 predicate places. [2022-12-13 07:34:18,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 376 places, 7116 transitions, 586881 flow [2022-12-13 07:34:18,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 7110 transitions, 586386 flow [2022-12-13 07:34:18,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:34:18,770 INFO L89 Accepts]: Start accepts. Operand has 375 places, 7110 transitions, 586386 flow [2022-12-13 07:34:18,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:34:18,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:34:18,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 7110 transitions, 586386 flow [2022-12-13 07:34:19,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 7110 transitions, 586386 flow [2022-12-13 07:34:19,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:34:19,306 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:34:19,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 537 [2022-12-13 07:34:19,307 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 7110 transitions, 586386 flow [2022-12-13 07:34:19,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:34:19,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:34:19,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:34:19,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 07:34:19,307 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:34:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:34:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 93547328, now seen corresponding path program 17 times [2022-12-13 07:34:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:34:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585504750] [2022-12-13 07:34:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:34:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:34:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:34:19,422 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-13 07:34:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:34:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585504750] [2022-12-13 07:34:19,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585504750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:34:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561622527] [2022-12-13 07:34:19,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:34:19,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:34:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:34:19,425 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:34:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 07:34:19,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:34:19,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:34:19,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:34:19,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:34:19,609 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-13 07:34:19,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:34:19,700 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-13 07:34:19,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561622527] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:34:19,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:34:19,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2022-12-13 07:34:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130165519] [2022-12-13 07:34:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:34:19,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:34:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:34:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:34:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:34:19,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:34:19,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 7110 transitions, 586386 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:34:19,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:34:19,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:34:19,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:35:08,428 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:35:08,429 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-13 07:35:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:35:08,442 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:35:08,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 07:35:08,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-13 07:35:08,648 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/22 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 802171 conditions, 19107 events (12797/19106 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 133830 event pairs, 0 based on Foata normal form. 0/13651 useless extension candidates. Maximal degree in co-relation 783126. Up to 17660 conditions per place.). [2022-12-13 07:35:08,650 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:35:08,650 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:35:08,650 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:35:08,650 INFO L445 BasicCegarLoop]: Path program histogram: [18, 17, 5, 1] [2022-12-13 07:35:08,653 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:35:08,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:35:08,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:35:08 BasicIcfg [2022-12-13 07:35:08,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:35:08,667 INFO L158 Benchmark]: Toolchain (without parser) took 845494.49ms. Allocated memory was 181.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 158.0MB in the beginning and 647.3MB in the end (delta: -489.3MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-13 07:35:08,667 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 158.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:35:08,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.35ms. Allocated memory is still 181.4MB. Free memory was 157.5MB in the beginning and 147.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 07:35:08,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 181.4MB. Free memory was 147.0MB in the beginning and 145.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:35:08,668 INFO L158 Benchmark]: Boogie Preprocessor took 31.36ms. Allocated memory is still 181.4MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:35:08,668 INFO L158 Benchmark]: RCFGBuilder took 370.65ms. Allocated memory is still 181.4MB. Free memory was 143.9MB in the beginning and 130.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 07:35:08,668 INFO L158 Benchmark]: TraceAbstraction took 844837.68ms. Allocated memory was 181.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 129.2MB in the beginning and 647.3MB in the end (delta: -518.1MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-13 07:35:08,669 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 158.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.35ms. Allocated memory is still 181.4MB. Free memory was 157.5MB in the beginning and 147.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 181.4MB. Free memory was 147.0MB in the beginning and 145.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.36ms. Allocated memory is still 181.4MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 370.65ms. Allocated memory is still 181.4MB. Free memory was 143.9MB in the beginning and 130.2MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 844837.68ms. Allocated memory was 181.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 129.2MB in the beginning and 647.3MB in the end (delta: -518.1MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 92 PlacesBefore, 29 PlacesAfterwards, 89 TransitionsBefore, 22 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 30 ConcurrentYvCompositions, 4 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 1001, Positive conditional cache size: 0, Positive unconditional cache size: 1001, 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, 31 PlacesBefore, 31 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 110 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, 36 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 105 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, 42 PlacesBefore, 42 PlacesAfterwards, 235 TransitionsBefore, 235 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, 47 PlacesBefore, 47 PlacesAfterwards, 414 TransitionsBefore, 414 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, 475 TransitionsBefore, 475 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, 72 PlacesBefore, 72 PlacesAfterwards, 955 TransitionsBefore, 955 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, 77 PlacesBefore, 77 PlacesAfterwards, 929 TransitionsBefore, 929 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, 82 PlacesBefore, 82 PlacesAfterwards, 931 TransitionsBefore, 931 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, 88 PlacesBefore, 88 PlacesAfterwards, 922 TransitionsBefore, 922 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, 95 PlacesBefore, 95 PlacesAfterwards, 1150 TransitionsBefore, 1150 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, 100 PlacesBefore, 100 PlacesAfterwards, 1226 TransitionsBefore, 1226 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, 105 PlacesBefore, 105 PlacesAfterwards, 1196 TransitionsBefore, 1196 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, 110 PlacesBefore, 110 PlacesAfterwards, 1474 TransitionsBefore, 1474 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, 115 PlacesBefore, 115 PlacesAfterwards, 1492 TransitionsBefore, 1492 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, 122 PlacesBefore, 122 PlacesAfterwards, 1560 TransitionsBefore, 1560 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, 129 PlacesBefore, 129 PlacesAfterwards, 1714 TransitionsBefore, 1714 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, 134 PlacesBefore, 134 PlacesAfterwards, 1841 TransitionsBefore, 1841 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, 145 PlacesBefore, 145 PlacesAfterwards, 1916 TransitionsBefore, 1916 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, 175 PlacesBefore, 175 PlacesAfterwards, 2992 TransitionsBefore, 2992 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, 3265 TransitionsBefore, 3265 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, 216 PlacesBefore, 216 PlacesAfterwards, 5352 TransitionsBefore, 5352 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, 222 PlacesBefore, 222 PlacesAfterwards, 5263 TransitionsBefore, 5263 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, 232 PlacesBefore, 232 PlacesAfterwards, 5260 TransitionsBefore, 5260 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, 250 PlacesBefore, 250 PlacesAfterwards, 5868 TransitionsBefore, 5868 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, 265 PlacesBefore, 265 PlacesAfterwards, 6107 TransitionsBefore, 6107 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, 269 PlacesBefore, 269 PlacesAfterwards, 6055 TransitionsBefore, 6055 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, 279 PlacesBefore, 279 PlacesAfterwards, 6075 TransitionsBefore, 6075 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, 285 PlacesBefore, 285 PlacesAfterwards, 6140 TransitionsBefore, 6140 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, 293 PlacesBefore, 293 PlacesAfterwards, 6138 TransitionsBefore, 6138 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, 302 PlacesBefore, 302 PlacesAfterwards, 6886 TransitionsBefore, 6886 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, 308 PlacesBefore, 308 PlacesAfterwards, 6844 TransitionsBefore, 6844 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, 317 PlacesBefore, 317 PlacesAfterwards, 6787 TransitionsBefore, 6787 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, 325 PlacesBefore, 325 PlacesAfterwards, 6739 TransitionsBefore, 6739 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, 335 PlacesBefore, 335 PlacesAfterwards, 6920 TransitionsBefore, 6920 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, 345 PlacesBefore, 345 PlacesAfterwards, 6898 TransitionsBefore, 6898 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, 351 PlacesBefore, 351 PlacesAfterwards, 6876 TransitionsBefore, 6876 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, 357 PlacesBefore, 357 PlacesAfterwards, 6836 TransitionsBefore, 6836 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, 365 PlacesBefore, 365 PlacesAfterwards, 7066 TransitionsBefore, 7066 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, 370 PlacesBefore, 370 PlacesAfterwards, 7107 TransitionsBefore, 7107 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, 375 PlacesBefore, 375 PlacesAfterwards, 7110 TransitionsBefore, 7110 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: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/22 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 802171 conditions, 19107 events (12797/19106 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 133830 event pairs, 0 based on Foata normal form. 0/13651 useless extension candidates. Maximal degree in co-relation 783126. Up to 17660 conditions per place.). - TimeoutResultAtElement [Line: 74]: 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 (6states, 0/22 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 802171 conditions, 19107 events (12797/19106 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 133830 event pairs, 0 based on Foata normal form. 0/13651 useless extension candidates. Maximal degree in co-relation 783126. Up to 17660 conditions per place.). - TimeoutResultAtElement [Line: 72]: 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 (6states, 0/22 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 802171 conditions, 19107 events (12797/19106 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 133830 event pairs, 0 based on Foata normal form. 0/13651 useless extension candidates. Maximal degree in co-relation 783126. Up to 17660 conditions per place.). - TimeoutResultAtElement [Line: 73]: 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 (6states, 0/22 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 802171 conditions, 19107 events (12797/19106 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 133830 event pairs, 0 based on Foata normal form. 0/13651 useless extension candidates. Maximal degree in co-relation 783126. Up to 17660 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 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: 844.7s, OverallIterations: 41, TraceHistogramMax: 1, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 766.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 3530 SdHoareTripleChecker+Valid, 48.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3530 mSDsluCounter, 1152 SdHoareTripleChecker+Invalid, 45.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 664 IncrementalHoareTripleChecker+Unchecked, 827 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14604 IncrementalHoareTripleChecker+Invalid, 15392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 325 mSDtfsCounter, 14604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1005 SyntacticMatches, 45 SemanticMatches, 546 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586386occurred in iteration=40, InterpolantAutomatonStates: 401, 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.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 44.5s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1728 ConstructedInterpolants, 11 QuantifiedInterpolants, 11591 SizeOfPredicates, 184 NumberOfNonLiveVariables, 3975 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 91 InterpolantComputations, 24 PerfectInterpolantSequences, 23/90 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