/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:20:24,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:20:24,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:20:24,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:20:24,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:20:24,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:20:24,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:20:24,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:20:24,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:20:24,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:20:24,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:20:24,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:20:24,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:20:24,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:20:24,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:20:24,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:20:24,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:20:24,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:20:24,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:20:24,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:20:24,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:20:24,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:20:24,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:20:24,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:20:24,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:20:24,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:20:24,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:20:24,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:20:24,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:20:24,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:20:24,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:20:24,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:20:24,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:20:24,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:20:24,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:20:24,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:20:24,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:20:24,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:20:24,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:20:24,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:20:24,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:20:24,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:20:24,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:20:24,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:20:24,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:20:24,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:20:24,176 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:20:24,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:20:24,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:20:24,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:20:24,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:20:24,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:20:24,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:20:24,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:20:24,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:20:24,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:20:24,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:20:24,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:20:24,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:20:24,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:20:24,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:20:24,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:20:24,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:20:24,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:20:24,495 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:20:24,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 01:20:25,659 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:20:26,058 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:20:26,059 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 01:20:26,083 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081635f4a/b067264a864749d9aae7f85c9c45f33c/FLAG9ea922f20 [2022-12-06 01:20:26,105 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081635f4a/b067264a864749d9aae7f85c9c45f33c [2022-12-06 01:20:26,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:20:26,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:20:26,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:20:26,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:20:26,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:20:26,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:26,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7854aec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26, skipping insertion in model container [2022-12-06 01:20:26,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:26,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:20:26,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:20:26,715 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 01:20:26,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:20:26,756 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:20:26,817 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 01:20:26,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:20:26,988 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:20:26,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26 WrapperNode [2022-12-06 01:20:26,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:20:26,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:20:26,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:20:26,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:20:26,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,042 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-06 01:20:27,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:20:27,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:20:27,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:20:27,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:20:27,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,073 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:20:27,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:20:27,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:20:27,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:20:27,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (1/1) ... [2022-12-06 01:20:27,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:20:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:20:27,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:20:27,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:20:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:20:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:20:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 01:20:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 01:20:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:20:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:20:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:20:27,161 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:20:27,398 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:20:27,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:20:27,658 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:20:27,671 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:20:27,671 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:20:27,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:20:27 BoogieIcfgContainer [2022-12-06 01:20:27,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:20:27,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:20:27,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:20:27,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:20:27,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:20:26" (1/3) ... [2022-12-06 01:20:27,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11620c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:20:27, skipping insertion in model container [2022-12-06 01:20:27,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:20:26" (2/3) ... [2022-12-06 01:20:27,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11620c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:20:27, skipping insertion in model container [2022-12-06 01:20:27,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:20:27" (3/3) ... [2022-12-06 01:20:27,684 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-06 01:20:27,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:20:27,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 01:20:27,730 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:20:27,801 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 01:20:27,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 01:20:27,927 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-06 01:20:27,928 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:20:27,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-06 01:20:27,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 01:20:27,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-06 01:20:27,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:27,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-06 01:20:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-06 01:20:28,016 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-06 01:20:28,016 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:20:28,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 7/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-06 01:20:28,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-06 01:20:28,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-06 01:20:28,207 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:28,208 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:28,212 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:28,213 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:30,935 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:30,937 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:30,939 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:30,939 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:31,143 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,144 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:31,146 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,148 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:31,419 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,421 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:31,423 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,425 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:31,428 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,429 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 01:20:31,432 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:31,433 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:34,943 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:34,944 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:34,947 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:34,948 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:37,416 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:37,417 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 01:20:37,420 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:37,421 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:37,423 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:37,425 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 01:20:37,427 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:37,427 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:40,224 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:40,225 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:40,226 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:40,228 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:40,392 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:40,393 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:40,395 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:40,396 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:43,565 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:43,566 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:43,567 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:43,568 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:46,207 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,207 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:46,209 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,209 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:46,275 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,275 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:20:46,279 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,280 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:46,282 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,283 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:20:46,286 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:46,286 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:47,690 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:47,691 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:47,693 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:47,694 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:50,192 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:50,193 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:50,195 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:50,197 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:54,608 INFO L203 LiptonReduction]: Total number of compositions: 132 [2022-12-06 01:20:54,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:20:54,639 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;@2efc5289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:20:54,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 01:20:54,640 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 01:20:54,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:20:54,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:54,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 01:20:54,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2022-12-06 01:20:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:54,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943877906] [2022-12-06 01:20:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:20:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:20:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:20:54,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943877906] [2022-12-06 01:20:54,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943877906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:20:54,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:20:54,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 01:20:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086761533] [2022-12-06 01:20:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:20:54,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 01:20:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:20:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 01:20:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 01:20:54,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-06 01:20:54,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:54,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:20:54,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-06 01:20:54,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:20:55,075 INFO L130 PetriNetUnfolder]: 225/508 cut-off events. [2022-12-06 01:20:55,076 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 01:20:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 508 events. 225/508 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2817 event pairs, 224 based on Foata normal form. 25/419 useless extension candidates. Maximal degree in co-relation 855. Up to 403 conditions per place. [2022-12-06 01:20:55,083 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-06 01:20:55,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 126 flow [2022-12-06 01:20:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 01:20:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 01:20:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-12-06 01:20:55,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 01:20:55,096 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2022-12-06 01:20:55,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:55,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 126 flow [2022-12-06 01:20:55,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 126 flow [2022-12-06 01:20:55,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 01:20:55,105 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,106 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,114 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,115 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,359 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,360 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,361 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,362 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,458 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,459 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,460 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,461 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,767 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,768 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,769 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:55,770 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:55,950 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 01:20:55,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 855 [2022-12-06 01:20:55,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 114 flow [2022-12-06 01:20:55,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:55,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:55,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 01:20:55,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:20:55,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 18525369, now seen corresponding path program 1 times [2022-12-06 01:20:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029932012] [2022-12-06 01:20:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:20:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:20:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:20:56,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029932012] [2022-12-06 01:20:56,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029932012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:20:56,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:20:56,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:20:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254864388] [2022-12-06 01:20:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:20:56,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:20:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:20:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:20:56,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:20:56,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:20:56,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 114 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:56,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:20:56,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:20:56,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:20:56,507 INFO L130 PetriNetUnfolder]: 290/527 cut-off events. [2022-12-06 01:20:56,507 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 01:20:56,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 527 events. 290/527 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2374 event pairs, 157 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 1458. Up to 488 conditions per place. [2022-12-06 01:20:56,511 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2022-12-06 01:20:56,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 224 flow [2022-12-06 01:20:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:20:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:20:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 01:20:56,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2022-12-06 01:20:56,517 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-06 01:20:56,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:56,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 224 flow [2022-12-06 01:20:56,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 224 flow [2022-12-06 01:20:56,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:20:56,521 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:20:56,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:20:56,522 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 224 flow [2022-12-06 01:20:56,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:56,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:56,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 01:20:56,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:20:56,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 18525403, now seen corresponding path program 1 times [2022-12-06 01:20:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:56,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442083507] [2022-12-06 01:20:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:20:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:20:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:20:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442083507] [2022-12-06 01:20:56,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442083507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:20:56,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:20:56,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:20:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542980239] [2022-12-06 01:20:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:20:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:20:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:20:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:20:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:20:56,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:20:56,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 224 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:56,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:20:56,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:20:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:20:56,839 INFO L130 PetriNetUnfolder]: 279/530 cut-off events. [2022-12-06 01:20:56,840 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 01:20:56,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 530 events. 279/530 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2508 event pairs, 151 based on Foata normal form. 25/431 useless extension candidates. Maximal degree in co-relation 1969. Up to 491 conditions per place. [2022-12-06 01:20:56,843 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 42 selfloop transitions, 8 changer transitions 2/52 dead transitions. [2022-12-06 01:20:56,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 424 flow [2022-12-06 01:20:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:20:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:20:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 01:20:56,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 01:20:56,845 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 01:20:56,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:56,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 52 transitions, 424 flow [2022-12-06 01:20:56,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 52 transitions, 424 flow [2022-12-06 01:20:56,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:20:56,849 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:20:56,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:20:56,850 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 52 transitions, 424 flow [2022-12-06 01:20:56,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:56,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:56,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:20:56,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:20:56,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1127037796, now seen corresponding path program 1 times [2022-12-06 01:20:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:56,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000806391] [2022-12-06 01:20:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:20:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:20:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:20:56,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000806391] [2022-12-06 01:20:56,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000806391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:20:56,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:20:56,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:20:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060342447] [2022-12-06 01:20:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:20:56,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:20:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:20:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:20:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:20:56,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 01:20:56,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 52 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:56,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:20:56,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 01:20:56,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:20:57,025 INFO L130 PetriNetUnfolder]: 110/215 cut-off events. [2022-12-06 01:20:57,025 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 01:20:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 215 events. 110/215 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 730 event pairs, 25 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 932. Up to 215 conditions per place. [2022-12-06 01:20:57,027 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 23 selfloop transitions, 1 changer transitions 9/33 dead transitions. [2022-12-06 01:20:57,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 338 flow [2022-12-06 01:20:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:20:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:20:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 01:20:57,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 01:20:57,029 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 01:20:57,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:57,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 338 flow [2022-12-06 01:20:57,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 338 flow [2022-12-06 01:20:57,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:20:57,034 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:57,035 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:57,036 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:20:57,037 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:20:57,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:20:57,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 01:20:57,129 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 332 flow [2022-12-06 01:20:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:57,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:57,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:20:57,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:20:57,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1420996727, now seen corresponding path program 1 times [2022-12-06 01:20:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205506348] [2022-12-06 01:20:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:20:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:20:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:20:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205506348] [2022-12-06 01:20:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205506348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:20:57,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:20:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:20:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398545577] [2022-12-06 01:20:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:20:57,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:20:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:20:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:20:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:20:57,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 01:20:57,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:57,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:20:57,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 01:20:57,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:20:57,860 INFO L130 PetriNetUnfolder]: 137/268 cut-off events. [2022-12-06 01:20:57,860 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 01:20:57,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 268 events. 137/268 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 997 event pairs, 10 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 1440. Up to 269 conditions per place. [2022-12-06 01:20:57,862 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 36 selfloop transitions, 10 changer transitions 12/58 dead transitions. [2022-12-06 01:20:57,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 711 flow [2022-12-06 01:20:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:20:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:20:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 01:20:57,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3565217391304348 [2022-12-06 01:20:57,866 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-06 01:20:57,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:20:57,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 58 transitions, 711 flow [2022-12-06 01:20:57,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 58 transitions, 711 flow [2022-12-06 01:20:57,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:20:57,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:20:57,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 01:20:57,873 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 58 transitions, 711 flow [2022-12-06 01:20:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:20:57,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:20:57,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:20:57,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:20:57,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:20:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:20:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1859451439, now seen corresponding path program 1 times [2022-12-06 01:20:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:20:57,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812649663] [2022-12-06 01:20:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:20:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:20:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:00,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812649663] [2022-12-06 01:21:00,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812649663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:00,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:00,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529714515] [2022-12-06 01:21:00,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:00,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:00,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 01:21:00,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 58 transitions, 711 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:00,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:00,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 01:21:00,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:00,891 INFO L130 PetriNetUnfolder]: 156/315 cut-off events. [2022-12-06 01:21:00,891 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:21:00,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 315 events. 156/315 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1251 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1888. Up to 316 conditions per place. [2022-12-06 01:21:00,893 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 77 selfloop transitions, 28 changer transitions 40/145 dead transitions. [2022-12-06 01:21:00,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 145 transitions, 2072 flow [2022-12-06 01:21:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 01:21:00,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3217391304347826 [2022-12-06 01:21:00,905 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-06 01:21:00,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:00,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 145 transitions, 2072 flow [2022-12-06 01:21:00,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 145 transitions, 2072 flow [2022-12-06 01:21:00,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:00,910 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:00,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:21:00,910 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 145 transitions, 2072 flow [2022-12-06 01:21:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:00,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:00,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:00,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:21:00,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1751365645, now seen corresponding path program 2 times [2022-12-06 01:21:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597141823] [2022-12-06 01:21:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:01,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597141823] [2022-12-06 01:21:01,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597141823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:01,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:01,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:21:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248570413] [2022-12-06 01:21:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:01,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:21:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:21:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:21:01,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 01:21:01,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 145 transitions, 2072 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:01,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:01,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 01:21:01,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:01,529 INFO L130 PetriNetUnfolder]: 158/323 cut-off events. [2022-12-06 01:21:01,530 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 01:21:01,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 323 events. 158/323 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1274 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 2172. Up to 324 conditions per place. [2022-12-06 01:21:01,532 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 100 selfloop transitions, 29 changer transitions 49/178 dead transitions. [2022-12-06 01:21:01,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 178 transitions, 2896 flow [2022-12-06 01:21:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:21:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:21:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 01:21:01,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-06 01:21:01,535 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2022-12-06 01:21:01,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:01,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 178 transitions, 2896 flow [2022-12-06 01:21:01,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 178 transitions, 2896 flow [2022-12-06 01:21:01,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:01,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:01,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 01:21:01,542 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 178 transitions, 2896 flow [2022-12-06 01:21:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:01,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:01,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:01,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:21:01,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1362147451, now seen corresponding path program 3 times [2022-12-06 01:21:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481765004] [2022-12-06 01:21:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:03,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481765004] [2022-12-06 01:21:03,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481765004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:03,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:03,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861562304] [2022-12-06 01:21:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:03,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:03,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 01:21:03,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 178 transitions, 2896 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:03,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:03,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 01:21:03,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:03,721 INFO L130 PetriNetUnfolder]: 174/372 cut-off events. [2022-12-06 01:21:03,722 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 01:21:03,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3391 conditions, 372 events. 174/372 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1607 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 2640. Up to 373 conditions per place. [2022-12-06 01:21:03,725 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 123 selfloop transitions, 24 changer transitions 71/218 dead transitions. [2022-12-06 01:21:03,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 218 transitions, 3987 flow [2022-12-06 01:21:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-12-06 01:21:03,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3130434782608696 [2022-12-06 01:21:03,729 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2022-12-06 01:21:03,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:03,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 218 transitions, 3987 flow [2022-12-06 01:21:03,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 218 transitions, 3987 flow [2022-12-06 01:21:03,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:03,739 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:03,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 01:21:03,742 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 218 transitions, 3987 flow [2022-12-06 01:21:03,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:03,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:03,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:03,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:21:03,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1564432071, now seen corresponding path program 2 times [2022-12-06 01:21:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:03,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369225959] [2022-12-06 01:21:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:04,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369225959] [2022-12-06 01:21:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369225959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:04,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:04,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 01:21:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454851712] [2022-12-06 01:21:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 01:21:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 01:21:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 01:21:04,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 01:21:04,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 218 transitions, 3987 flow. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:04,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:04,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 01:21:04,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:05,118 INFO L130 PetriNetUnfolder]: 176/394 cut-off events. [2022-12-06 01:21:05,118 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 01:21:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3988 conditions, 394 events. 176/394 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1760 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 3012. Up to 395 conditions per place. [2022-12-06 01:21:05,122 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 112 selfloop transitions, 53 changer transitions 118/283 dead transitions. [2022-12-06 01:21:05,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 283 transitions, 5741 flow [2022-12-06 01:21:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:21:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:21:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-12-06 01:21:05,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25418060200668896 [2022-12-06 01:21:05,124 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2022-12-06 01:21:05,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:05,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 283 transitions, 5741 flow [2022-12-06 01:21:05,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 283 transitions, 5741 flow [2022-12-06 01:21:05,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:05,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_60| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_113| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_main_~#data~1#1.base_113| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (select (select |v_#memory_int_298| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_60|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_298|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_113|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_113|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_113|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_60|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_298|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_113|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [559] $Ultimate##0-->L1710: Formula: (and (= v_my_callbackThread1of1ForFork1_~dev~0.offset_13 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25) (= v_my_callbackThread1of1ForFork1_~dev~0.base_13 v_my_callbackThread1of1ForFork1_~__mptr~0.base_25) (= v_my_callbackThread1of1ForFork1_~dev~0.base_13 v_my_callbackThread1of1ForFork1_~arg.base_11) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_7|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_7|) (= v_my_callbackThread1of1ForFork1_~data~0.base_81 v_my_callbackThread1of1ForFork1_~__mptr~0.base_25) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_81 24)) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 v_my_callbackThread1of1ForFork1_~dev~0.offset_13)) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_7|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_7|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_7|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_81, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_81, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_25, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_13, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_13, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_7|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 01:21:05,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_60| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_113| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_main_~#data~1#1.base_113| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (select (select |v_#memory_int_298| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_60|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_298|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_113|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_113|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_113|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_60|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_298|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_113|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 01:21:05,418 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:21:05,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 01:21:05,419 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 282 transitions, 5725 flow [2022-12-06 01:21:05,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:05,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:05,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:05,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:21:05,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1248874369, now seen corresponding path program 3 times [2022-12-06 01:21:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:05,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251101403] [2022-12-06 01:21:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251101403] [2022-12-06 01:21:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251101403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:06,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:06,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572104651] [2022-12-06 01:21:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:06,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:06,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 01:21:06,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 282 transitions, 5725 flow. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:06,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:06,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 01:21:06,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:07,189 INFO L130 PetriNetUnfolder]: 302/732 cut-off events. [2022-12-06 01:21:07,189 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 01:21:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8150 conditions, 732 events. 302/732 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4383 event pairs, 0 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 5278. Up to 733 conditions per place. [2022-12-06 01:21:07,195 INFO L137 encePairwiseOnDemand]: 7/25 looper letters, 239 selfloop transitions, 87 changer transitions 259/585 dead transitions. [2022-12-06 01:21:07,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 585 transitions, 13084 flow [2022-12-06 01:21:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-12-06 01:21:07,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 01:21:07,197 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2022-12-06 01:21:07,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:07,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 585 transitions, 13084 flow [2022-12-06 01:21:07,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 585 transitions, 13084 flow [2022-12-06 01:21:07,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:07,213 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:07,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:21:07,214 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 585 transitions, 13084 flow [2022-12-06 01:21:07,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:07,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:07,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:07,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:21:07,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1435872471, now seen corresponding path program 4 times [2022-12-06 01:21:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:07,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583874266] [2022-12-06 01:21:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:08,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583874266] [2022-12-06 01:21:08,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583874266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:08,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:08,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072025968] [2022-12-06 01:21:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:08,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:08,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 01:21:08,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 585 transitions, 13084 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:08,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:08,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 01:21:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:09,430 INFO L130 PetriNetUnfolder]: 332/821 cut-off events. [2022-12-06 01:21:09,430 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-06 01:21:09,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9965 conditions, 821 events. 332/821 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5124 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 6156. Up to 822 conditions per place. [2022-12-06 01:21:09,438 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 270 selfloop transitions, 84 changer transitions 308/662 dead transitions. [2022-12-06 01:21:09,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 662 transitions, 16138 flow [2022-12-06 01:21:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-12-06 01:21:09,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.312 [2022-12-06 01:21:09,439 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2022-12-06 01:21:09,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:09,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 662 transitions, 16138 flow [2022-12-06 01:21:09,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 662 transitions, 16138 flow [2022-12-06 01:21:09,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:09,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:09,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:21:09,457 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 662 transitions, 16138 flow [2022-12-06 01:21:09,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:09,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:09,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:09,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:21:09,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1572641051, now seen corresponding path program 5 times [2022-12-06 01:21:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:09,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176891721] [2022-12-06 01:21:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:10,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176891721] [2022-12-06 01:21:10,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176891721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:10,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:10,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89082578] [2022-12-06 01:21:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:10,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:10,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:10,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 01:21:10,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 662 transitions, 16138 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:10,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:10,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 01:21:10,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:11,892 INFO L130 PetriNetUnfolder]: 334/831 cut-off events. [2022-12-06 01:21:11,892 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-06 01:21:11,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 831 events. 334/831 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5218 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 6667. Up to 832 conditions per place. [2022-12-06 01:21:11,900 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 276 selfloop transitions, 86 changer transitions 310/672 dead transitions. [2022-12-06 01:21:11,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 672 transitions, 17731 flow [2022-12-06 01:21:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-12-06 01:21:11,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.312 [2022-12-06 01:21:11,902 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2022-12-06 01:21:11,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:11,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 672 transitions, 17731 flow [2022-12-06 01:21:11,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 672 transitions, 17731 flow [2022-12-06 01:21:11,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:11,924 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:11,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 01:21:11,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 672 transitions, 17731 flow [2022-12-06 01:21:11,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:11,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:11,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:11,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:21:11,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 481443157, now seen corresponding path program 4 times [2022-12-06 01:21:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:11,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545201768] [2022-12-06 01:21:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545201768] [2022-12-06 01:21:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545201768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:12,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:12,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:21:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111898552] [2022-12-06 01:21:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:12,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:21:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:21:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:21:12,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 01:21:12,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 672 transitions, 17731 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:12,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:12,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 01:21:12,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:13,369 INFO L130 PetriNetUnfolder]: 347/934 cut-off events. [2022-12-06 01:21:13,369 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 01:21:13,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13211 conditions, 934 events. 347/934 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6433 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 7822. Up to 935 conditions per place. [2022-12-06 01:21:13,379 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 295 selfloop transitions, 90 changer transitions 375/760 dead transitions. [2022-12-06 01:21:13,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 760 transitions, 21584 flow [2022-12-06 01:21:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:21:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:21:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-12-06 01:21:13,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 01:21:13,381 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2022-12-06 01:21:13,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:13,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 760 transitions, 21584 flow [2022-12-06 01:21:13,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 760 transitions, 21584 flow [2022-12-06 01:21:13,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:13,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L1711-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_87 28)) (.cse4 (select |v_#memory_$Pointer$.offset_337| v_my_callbackThread1of1ForFork0_~data~0.base_87)) (.cse0 (select |v_#memory_$Pointer$.base_337| v_my_callbackThread1of1ForFork0_~data~0.base_87)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_87 24))) (and (= (store |v_#memory_$Pointer$.base_337| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.base_336| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse1))) |v_#memory_$Pointer$.base_336|) (= |v_#pthreadsMutex_151| (store |v_#pthreadsMutex_152| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#pthreadsMutex_152| v_my_callbackThread1of1ForFork0_~data~0.base_87) v_my_callbackThread1of1ForFork0_~data~0.offset_87 0))) (= |v_#memory_int_394| (store |v_#memory_int_396| v_my_callbackThread1of1ForFork0_~data~0.base_87 (let ((.cse2 (select |v_#memory_int_396| v_my_callbackThread1of1ForFork0_~data~0.base_87))) (store (store .cse2 .cse3 1) .cse1 (+ (select .cse2 .cse1) 1))))) (= (store |v_#memory_$Pointer$.offset_337| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store .cse4 .cse1 (select (select |v_#memory_$Pointer$.offset_336| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse1))) |v_#memory_$Pointer$.offset_336|) (= |v_#memory_$Pointer$.offset_337| (store |v_#memory_$Pointer$.offset_338| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#memory_$Pointer$.offset_338| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse3 (select .cse4 .cse3)))) (= |v_my_callbackThread1of1ForFork0_#res.base_19| 0) (= (store |v_#memory_$Pointer$.base_338| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#memory_$Pointer$.base_338| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse3 (select .cse0 .cse3))) |v_#memory_$Pointer$.base_337|) (= |v_my_callbackThread1of1ForFork0_#res.offset_19| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_87, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_338|, #memory_int=|v_#memory_int_396|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_87, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_338|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_87, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_19|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_336|, #memory_int=|v_#memory_int_394|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_19|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_87, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_336|} AuxVars[|v_#memory_$Pointer$.offset_337|, |v_#memory_$Pointer$.base_337|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 01:21:13,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L1711-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_87 28)) (.cse4 (select |v_#memory_$Pointer$.offset_337| v_my_callbackThread1of1ForFork0_~data~0.base_87)) (.cse0 (select |v_#memory_$Pointer$.base_337| v_my_callbackThread1of1ForFork0_~data~0.base_87)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_87 24))) (and (= (store |v_#memory_$Pointer$.base_337| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.base_336| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse1))) |v_#memory_$Pointer$.base_336|) (= |v_#pthreadsMutex_151| (store |v_#pthreadsMutex_152| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#pthreadsMutex_152| v_my_callbackThread1of1ForFork0_~data~0.base_87) v_my_callbackThread1of1ForFork0_~data~0.offset_87 0))) (= |v_#memory_int_394| (store |v_#memory_int_396| v_my_callbackThread1of1ForFork0_~data~0.base_87 (let ((.cse2 (select |v_#memory_int_396| v_my_callbackThread1of1ForFork0_~data~0.base_87))) (store (store .cse2 .cse3 1) .cse1 (+ (select .cse2 .cse1) 1))))) (= (store |v_#memory_$Pointer$.offset_337| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store .cse4 .cse1 (select (select |v_#memory_$Pointer$.offset_336| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse1))) |v_#memory_$Pointer$.offset_336|) (= |v_#memory_$Pointer$.offset_337| (store |v_#memory_$Pointer$.offset_338| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#memory_$Pointer$.offset_338| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse3 (select .cse4 .cse3)))) (= |v_my_callbackThread1of1ForFork0_#res.base_19| 0) (= (store |v_#memory_$Pointer$.base_338| v_my_callbackThread1of1ForFork0_~data~0.base_87 (store (select |v_#memory_$Pointer$.base_338| v_my_callbackThread1of1ForFork0_~data~0.base_87) .cse3 (select .cse0 .cse3))) |v_#memory_$Pointer$.base_337|) (= |v_my_callbackThread1of1ForFork0_#res.offset_19| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_87, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_338|, #memory_int=|v_#memory_int_396|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_87, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_338|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_87, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_19|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_336|, #memory_int=|v_#memory_int_394|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_19|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_87, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_336|} AuxVars[|v_#memory_$Pointer$.offset_337|, |v_#memory_$Pointer$.base_337|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [559] $Ultimate##0-->L1710: Formula: (and (= v_my_callbackThread1of1ForFork1_~dev~0.offset_13 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25) (= v_my_callbackThread1of1ForFork1_~dev~0.base_13 v_my_callbackThread1of1ForFork1_~__mptr~0.base_25) (= v_my_callbackThread1of1ForFork1_~dev~0.base_13 v_my_callbackThread1of1ForFork1_~arg.base_11) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_7|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_7|) (= v_my_callbackThread1of1ForFork1_~data~0.base_81 v_my_callbackThread1of1ForFork1_~__mptr~0.base_25) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_81 24)) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 v_my_callbackThread1of1ForFork1_~dev~0.offset_13)) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_7|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_7|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_7|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_81, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_81, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_25, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_25, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_13, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_13, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_7|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 01:21:13,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:21:13,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 605 [2022-12-06 01:21:13,986 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 759 transitions, 21560 flow [2022-12-06 01:21:13,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:13,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:13,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:13,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:21:13,986 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1578717783, now seen corresponding path program 6 times [2022-12-06 01:21:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:13,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57089838] [2022-12-06 01:21:13,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:15,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57089838] [2022-12-06 01:21:15,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57089838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:15,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:15,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989465546] [2022-12-06 01:21:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:15,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:15,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:15,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 759 transitions, 21560 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:15,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:15,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:15,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:16,224 INFO L130 PetriNetUnfolder]: 366/1007 cut-off events. [2022-12-06 01:21:16,224 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 01:21:16,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15254 conditions, 1007 events. 366/1007 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7229 event pairs, 0 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 8921. Up to 1008 conditions per place. [2022-12-06 01:21:16,232 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 316 selfloop transitions, 71 changer transitions 440/827 dead transitions. [2022-12-06 01:21:16,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 827 transitions, 25151 flow [2022-12-06 01:21:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2022-12-06 01:21:16,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2851851851851852 [2022-12-06 01:21:16,234 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 80 predicate places. [2022-12-06 01:21:16,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:16,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 827 transitions, 25151 flow [2022-12-06 01:21:16,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 827 transitions, 25151 flow [2022-12-06 01:21:16,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:16,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:16,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 01:21:16,286 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 827 transitions, 25151 flow [2022-12-06 01:21:16,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:16,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:16,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:21:16,287 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1254125933, now seen corresponding path program 7 times [2022-12-06 01:21:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210886890] [2022-12-06 01:21:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:17,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210886890] [2022-12-06 01:21:17,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210886890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:17,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:17,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017234241] [2022-12-06 01:21:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:17,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:17,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:17,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:17,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 827 transitions, 25151 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:17,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:17,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:17,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:18,627 INFO L130 PetriNetUnfolder]: 371/1035 cut-off events. [2022-12-06 01:21:18,627 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 01:21:18,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16713 conditions, 1035 events. 371/1035 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7548 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 9514. Up to 1036 conditions per place. [2022-12-06 01:21:18,634 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 319 selfloop transitions, 66 changer transitions 471/856 dead transitions. [2022-12-06 01:21:18,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 856 transitions, 27742 flow [2022-12-06 01:21:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-12-06 01:21:18,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 01:21:18,636 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2022-12-06 01:21:18,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:18,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 856 transitions, 27742 flow [2022-12-06 01:21:18,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 856 transitions, 27742 flow [2022-12-06 01:21:18,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:18,659 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:18,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 01:21:18,659 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 856 transitions, 27742 flow [2022-12-06 01:21:18,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:18,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:18,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:21:18,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 971956367, now seen corresponding path program 5 times [2022-12-06 01:21:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450079066] [2022-12-06 01:21:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450079066] [2022-12-06 01:21:19,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450079066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:19,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:19,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635948259] [2022-12-06 01:21:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:19,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:19,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 856 transitions, 27742 flow. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:19,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:19,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:19,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:20,368 INFO L130 PetriNetUnfolder]: 376/1089 cut-off events. [2022-12-06 01:21:20,368 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-06 01:21:20,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18679 conditions, 1089 events. 376/1089 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8210 event pairs, 0 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 10175. Up to 1090 conditions per place. [2022-12-06 01:21:20,378 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 340 selfloop transitions, 44 changer transitions 520/904 dead transitions. [2022-12-06 01:21:20,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 904 transitions, 31122 flow [2022-12-06 01:21:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:21:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:21:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-12-06 01:21:20,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31275720164609055 [2022-12-06 01:21:20,383 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2022-12-06 01:21:20,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:20,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 904 transitions, 31122 flow [2022-12-06 01:21:20,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 904 transitions, 31122 flow [2022-12-06 01:21:20,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:20,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:20,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 01:21:20,411 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 904 transitions, 31122 flow [2022-12-06 01:21:20,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:20,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:20,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 01:21:20,411 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1030746397, now seen corresponding path program 8 times [2022-12-06 01:21:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217057162] [2022-12-06 01:21:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217057162] [2022-12-06 01:21:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217057162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:21,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:21,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327272806] [2022-12-06 01:21:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:21,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:21,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:21,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 904 transitions, 31122 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:21,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:21,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:21,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:22,640 INFO L130 PetriNetUnfolder]: 375/1088 cut-off events. [2022-12-06 01:21:22,640 INFO L131 PetriNetUnfolder]: For 195/195 co-relation queries the response was YES. [2022-12-06 01:21:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19751 conditions, 1088 events. 375/1088 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8207 event pairs, 0 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 10772. Up to 1089 conditions per place. [2022-12-06 01:21:22,646 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 300 selfloop transitions, 45 changer transitions 560/905 dead transitions. [2022-12-06 01:21:22,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 905 transitions, 32966 flow [2022-12-06 01:21:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-12-06 01:21:22,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2814814814814815 [2022-12-06 01:21:22,649 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2022-12-06 01:21:22,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:22,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 905 transitions, 32966 flow [2022-12-06 01:21:22,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 905 transitions, 32966 flow [2022-12-06 01:21:22,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:22,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:22,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 01:21:22,675 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 905 transitions, 32966 flow [2022-12-06 01:21:22,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:22,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:22,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 01:21:22,676 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2012192165, now seen corresponding path program 6 times [2022-12-06 01:21:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:22,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950135887] [2022-12-06 01:21:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:23,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950135887] [2022-12-06 01:21:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950135887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:23,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:21:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613677141] [2022-12-06 01:21:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:23,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:21:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:21:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:21:23,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:23,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 905 transitions, 32966 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:23,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:23,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:23,916 INFO L130 PetriNetUnfolder]: 367/1086 cut-off events. [2022-12-06 01:21:23,917 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-06 01:21:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20804 conditions, 1086 events. 367/1086 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8267 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 11388. Up to 1087 conditions per place. [2022-12-06 01:21:23,923 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 221 selfloop transitions, 66 changer transitions 666/953 dead transitions. [2022-12-06 01:21:23,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 953 transitions, 36606 flow [2022-12-06 01:21:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:21:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:21:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 01:21:23,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2022-12-06 01:21:23,925 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 112 predicate places. [2022-12-06 01:21:23,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:23,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 953 transitions, 36606 flow [2022-12-06 01:21:23,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 953 transitions, 36606 flow [2022-12-06 01:21:23,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:23,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:23,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 01:21:23,952 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 953 transitions, 36606 flow [2022-12-06 01:21:23,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:23,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:23,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:23,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 01:21:23,952 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:23,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1906421475, now seen corresponding path program 9 times [2022-12-06 01:21:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:23,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693742641] [2022-12-06 01:21:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:25,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693742641] [2022-12-06 01:21:25,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693742641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:25,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:25,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005511701] [2022-12-06 01:21:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:25,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:25,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:25,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 953 transitions, 36606 flow. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:25,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:25,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:25,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:26,226 INFO L130 PetriNetUnfolder]: 365/1084 cut-off events. [2022-12-06 01:21:26,227 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-06 01:21:26,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21851 conditions, 1084 events. 365/1084 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8248 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 11986. Up to 1085 conditions per place. [2022-12-06 01:21:26,233 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 204 selfloop transitions, 62 changer transitions 685/951 dead transitions. [2022-12-06 01:21:26,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 951 transitions, 38432 flow [2022-12-06 01:21:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-12-06 01:21:26,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2022-12-06 01:21:26,235 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2022-12-06 01:21:26,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:26,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 951 transitions, 38432 flow [2022-12-06 01:21:26,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 951 transitions, 38432 flow [2022-12-06 01:21:26,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:26,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:26,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:21:26,265 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 951 transitions, 38432 flow [2022-12-06 01:21:26,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:26,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:26,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 01:21:26,265 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -71498599, now seen corresponding path program 10 times [2022-12-06 01:21:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579388088] [2022-12-06 01:21:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579388088] [2022-12-06 01:21:26,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579388088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:26,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:26,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:21:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990160819] [2022-12-06 01:21:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:26,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:21:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:21:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:21:26,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:26,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 951 transitions, 38432 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:26,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:26,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:26,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:27,132 INFO L130 PetriNetUnfolder]: 308/963 cut-off events. [2022-12-06 01:21:27,132 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-06 01:21:27,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20390 conditions, 963 events. 308/963 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7254 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 10589. Up to 964 conditions per place. [2022-12-06 01:21:27,136 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 142 selfloop transitions, 22 changer transitions 698/862 dead transitions. [2022-12-06 01:21:27,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 862 transitions, 36593 flow [2022-12-06 01:21:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:21:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:21:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 01:21:27,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 01:21:27,138 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 125 predicate places. [2022-12-06 01:21:27,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:27,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 862 transitions, 36593 flow [2022-12-06 01:21:27,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 862 transitions, 36593 flow [2022-12-06 01:21:27,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:27,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:27,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 01:21:27,167 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 862 transitions, 36593 flow [2022-12-06 01:21:27,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:27,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:27,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:27,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 01:21:27,167 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -602851369, now seen corresponding path program 11 times [2022-12-06 01:21:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:27,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975262891] [2022-12-06 01:21:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975262891] [2022-12-06 01:21:28,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975262891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:28,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:28,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:28,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883092475] [2022-12-06 01:21:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:28,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:28,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:28,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 862 transitions, 36593 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:28,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:28,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:28,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:29,279 INFO L130 PetriNetUnfolder]: 317/999 cut-off events. [2022-12-06 01:21:29,279 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-06 01:21:29,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22153 conditions, 999 events. 317/999 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7661 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 11246. Up to 1000 conditions per place. [2022-12-06 01:21:29,283 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 136 selfloop transitions, 26 changer transitions 738/900 dead transitions. [2022-12-06 01:21:29,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 900 transitions, 40013 flow [2022-12-06 01:21:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 01:21:29,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2022-12-06 01:21:29,284 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 134 predicate places. [2022-12-06 01:21:29,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:29,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 900 transitions, 40013 flow [2022-12-06 01:21:29,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 900 transitions, 40013 flow [2022-12-06 01:21:29,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:29,314 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:29,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:21:29,314 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 900 transitions, 40013 flow [2022-12-06 01:21:29,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:29,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:29,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 01:21:29,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -935736157, now seen corresponding path program 12 times [2022-12-06 01:21:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:29,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781105020] [2022-12-06 01:21:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:30,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:30,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781105020] [2022-12-06 01:21:30,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781105020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:30,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:30,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323168848] [2022-12-06 01:21:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:30,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:30,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:30,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:30,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 900 transitions, 40013 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:30,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:30,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:30,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:31,495 INFO L130 PetriNetUnfolder]: 325/1055 cut-off events. [2022-12-06 01:21:31,496 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-06 01:21:31,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24450 conditions, 1055 events. 325/1055 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8357 event pairs, 0 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 12239. Up to 1056 conditions per place. [2022-12-06 01:21:31,500 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 134 selfloop transitions, 14 changer transitions 802/950 dead transitions. [2022-12-06 01:21:31,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 950 transitions, 44140 flow [2022-12-06 01:21:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-12-06 01:21:31,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-06 01:21:31,504 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 143 predicate places. [2022-12-06 01:21:31,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:31,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 950 transitions, 44140 flow [2022-12-06 01:21:31,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 950 transitions, 44140 flow [2022-12-06 01:21:31,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:31,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:31,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 01:21:31,535 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 950 transitions, 44140 flow [2022-12-06 01:21:31,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:31,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:31,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:31,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 01:21:31,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 840305821, now seen corresponding path program 13 times [2022-12-06 01:21:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093816181] [2022-12-06 01:21:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093816181] [2022-12-06 01:21:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093816181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:32,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:32,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398214631] [2022-12-06 01:21:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:32,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:32,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:32,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 950 transitions, 44140 flow. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:32,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:32,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:32,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:33,751 INFO L130 PetriNetUnfolder]: 323/1053 cut-off events. [2022-12-06 01:21:33,751 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-06 01:21:33,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25458 conditions, 1053 events. 323/1053 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8330 event pairs, 0 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 12770. Up to 1054 conditions per place. [2022-12-06 01:21:33,756 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 99 selfloop transitions, 19 changer transitions 830/948 dead transitions. [2022-12-06 01:21:33,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 948 transitions, 45944 flow [2022-12-06 01:21:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2022-12-06 01:21:33,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2022-12-06 01:21:33,757 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 152 predicate places. [2022-12-06 01:21:33,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:33,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 948 transitions, 45944 flow [2022-12-06 01:21:33,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 948 transitions, 45944 flow [2022-12-06 01:21:33,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:33,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:33,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 01:21:33,782 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 948 transitions, 45944 flow [2022-12-06 01:21:33,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:33,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:33,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 01:21:33,783 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 481847459, now seen corresponding path program 1 times [2022-12-06 01:21:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:33,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065290550] [2022-12-06 01:21:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065290550] [2022-12-06 01:21:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065290550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:34,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:34,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728621194] [2022-12-06 01:21:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:34,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:34,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:34,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:34,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 948 transitions, 45944 flow. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:34,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:34,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:34,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:35,646 INFO L130 PetriNetUnfolder]: 322/1061 cut-off events. [2022-12-06 01:21:35,646 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-06 01:21:35,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26714 conditions, 1061 events. 322/1061 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8464 event pairs, 0 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 13376. Up to 1062 conditions per place. [2022-12-06 01:21:35,650 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 100 selfloop transitions, 19 changer transitions 841/960 dead transitions. [2022-12-06 01:21:35,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 960 transitions, 48446 flow [2022-12-06 01:21:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:21:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:21:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-12-06 01:21:35,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23868312757201646 [2022-12-06 01:21:35,652 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 160 predicate places. [2022-12-06 01:21:35,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:35,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 960 transitions, 48446 flow [2022-12-06 01:21:35,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 960 transitions, 48446 flow [2022-12-06 01:21:35,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:35,686 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:35,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 01:21:35,687 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 960 transitions, 48446 flow [2022-12-06 01:21:35,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:35,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:35,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:35,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 01:21:35,687 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 319317401, now seen corresponding path program 1 times [2022-12-06 01:21:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:35,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369169471] [2022-12-06 01:21:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:36,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369169471] [2022-12-06 01:21:36,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369169471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:36,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:36,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 01:21:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630728622] [2022-12-06 01:21:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:36,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 01:21:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 01:21:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 01:21:36,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:36,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 960 transitions, 48446 flow. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:36,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:36,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:36,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:37,566 INFO L130 PetriNetUnfolder]: 321/1064 cut-off events. [2022-12-06 01:21:37,566 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-06 01:21:37,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27855 conditions, 1064 events. 321/1064 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8520 event pairs, 0 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 13910. Up to 1065 conditions per place. [2022-12-06 01:21:37,574 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 100 selfloop transitions, 12 changer transitions 851/963 dead transitions. [2022-12-06 01:21:37,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 963 transitions, 50525 flow [2022-12-06 01:21:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:21:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:21:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-12-06 01:21:37,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24279835390946503 [2022-12-06 01:21:37,575 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 168 predicate places. [2022-12-06 01:21:37,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:37,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 963 transitions, 50525 flow [2022-12-06 01:21:37,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 963 transitions, 50525 flow [2022-12-06 01:21:37,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:37,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:37,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:21:37,605 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 963 transitions, 50525 flow [2022-12-06 01:21:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:37,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:37,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:37,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 01:21:37,605 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 786180801, now seen corresponding path program 14 times [2022-12-06 01:21:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:37,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093426970] [2022-12-06 01:21:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093426970] [2022-12-06 01:21:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093426970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795195373] [2022-12-06 01:21:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:38,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:38,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:38,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 963 transitions, 50525 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:38,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:38,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:38,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:39,671 INFO L130 PetriNetUnfolder]: 321/1075 cut-off events. [2022-12-06 01:21:39,672 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-06 01:21:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29219 conditions, 1075 events. 321/1075 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8696 event pairs, 0 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 14660. Up to 1076 conditions per place. [2022-12-06 01:21:39,676 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 78 selfloop transitions, 20 changer transitions 876/974 dead transitions. [2022-12-06 01:21:39,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 974 transitions, 53051 flow [2022-12-06 01:21:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-12-06 01:21:39,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-06 01:21:39,679 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 177 predicate places. [2022-12-06 01:21:39,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:39,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 974 transitions, 53051 flow [2022-12-06 01:21:39,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 974 transitions, 53051 flow [2022-12-06 01:21:39,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:39,706 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:39,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 01:21:39,706 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 974 transitions, 53051 flow [2022-12-06 01:21:39,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:39,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:39,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 01:21:39,707 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1708261367, now seen corresponding path program 15 times [2022-12-06 01:21:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:39,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271036327] [2022-12-06 01:21:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271036327] [2022-12-06 01:21:40,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271036327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:40,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:40,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497189494] [2022-12-06 01:21:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:40,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:40,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 974 transitions, 53051 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:40,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:40,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:40,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:41,579 INFO L130 PetriNetUnfolder]: 318/1074 cut-off events. [2022-12-06 01:21:41,579 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-06 01:21:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30267 conditions, 1074 events. 318/1074 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8716 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 15202. Up to 1075 conditions per place. [2022-12-06 01:21:41,583 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 67 selfloop transitions, 9 changer transitions 898/974 dead transitions. [2022-12-06 01:21:41,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 974 transitions, 54999 flow [2022-12-06 01:21:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-12-06 01:21:41,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-06 01:21:41,585 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 186 predicate places. [2022-12-06 01:21:41,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:41,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 974 transitions, 54999 flow [2022-12-06 01:21:41,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 974 transitions, 54999 flow [2022-12-06 01:21:41,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:41,612 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:41,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 01:21:41,613 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 974 transitions, 54999 flow [2022-12-06 01:21:41,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:41,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:41,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:41,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 01:21:41,614 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1864261445, now seen corresponding path program 7 times [2022-12-06 01:21:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:41,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358125323] [2022-12-06 01:21:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358125323] [2022-12-06 01:21:42,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358125323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:42,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:42,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:21:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165575884] [2022-12-06 01:21:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:42,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:21:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:21:42,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:21:42,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:21:42,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 974 transitions, 54999 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:42,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:42,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:21:42,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:42,917 INFO L130 PetriNetUnfolder]: 316/1073 cut-off events. [2022-12-06 01:21:42,917 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-06 01:21:42,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31313 conditions, 1073 events. 316/1073 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8729 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 15744. Up to 1074 conditions per place. [2022-12-06 01:21:42,921 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 62 selfloop transitions, 13 changer transitions 898/973 dead transitions. [2022-12-06 01:21:42,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 973 transitions, 56889 flow [2022-12-06 01:21:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:21:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:21:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 01:21:42,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 01:21:42,923 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 191 predicate places. [2022-12-06 01:21:42,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:42,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 973 transitions, 56889 flow [2022-12-06 01:21:42,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 973 transitions, 56889 flow [2022-12-06 01:21:42,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:42,955 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:42,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 01:21:42,955 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 973 transitions, 56889 flow [2022-12-06 01:21:42,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:42,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:42,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:42,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 01:21:42,956 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1864261457, now seen corresponding path program 16 times [2022-12-06 01:21:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:42,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246340374] [2022-12-06 01:21:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:44,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246340374] [2022-12-06 01:21:44,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246340374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:44,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:44,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 01:21:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472834722] [2022-12-06 01:21:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:44,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 01:21:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 01:21:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-06 01:21:44,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:21:44,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 973 transitions, 56889 flow. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:44,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:44,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:21:44,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:45,074 INFO L130 PetriNetUnfolder]: 315/1072 cut-off events. [2022-12-06 01:21:45,074 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-06 01:21:45,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32357 conditions, 1072 events. 315/1072 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8744 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 16286. Up to 1073 conditions per place. [2022-12-06 01:21:45,079 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 56 selfloop transitions, 7 changer transitions 909/972 dead transitions. [2022-12-06 01:21:45,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 972 transitions, 58775 flow [2022-12-06 01:21:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-12-06 01:21:45,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23461538461538461 [2022-12-06 01:21:45,081 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 200 predicate places. [2022-12-06 01:21:45,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:45,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 972 transitions, 58775 flow [2022-12-06 01:21:45,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 972 transitions, 58775 flow [2022-12-06 01:21:45,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:45,111 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:45,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 01:21:45,112 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 972 transitions, 58775 flow [2022-12-06 01:21:45,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:45,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:45,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:45,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 01:21:45,112 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1468263413, now seen corresponding path program 17 times [2022-12-06 01:21:45,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:45,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103327847] [2022-12-06 01:21:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:45,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103327847] [2022-12-06 01:21:45,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103327847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:45,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197648504] [2022-12-06 01:21:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:45,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:45,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:21:45,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 972 transitions, 58775 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:45,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:45,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:21:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:46,916 INFO L130 PetriNetUnfolder]: 314/1080 cut-off events. [2022-12-06 01:21:46,916 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 01:21:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33680 conditions, 1080 events. 314/1080 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8875 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 16921. Up to 1081 conditions per place. [2022-12-06 01:21:46,921 INFO L137 encePairwiseOnDemand]: 6/26 looper letters, 40 selfloop transitions, 15 changer transitions 925/980 dead transitions. [2022-12-06 01:21:46,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 980 transitions, 61221 flow [2022-12-06 01:21:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-12-06 01:21:46,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23846153846153847 [2022-12-06 01:21:46,922 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 209 predicate places. [2022-12-06 01:21:46,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:46,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 980 transitions, 61221 flow [2022-12-06 01:21:46,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 980 transitions, 61221 flow [2022-12-06 01:21:46,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:46,987 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:46,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 01:21:46,987 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 980 transitions, 61221 flow [2022-12-06 01:21:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:46,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:46,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:46,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 01:21:46,988 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash -553492159, now seen corresponding path program 18 times [2022-12-06 01:21:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690138590] [2022-12-06 01:21:46,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690138590] [2022-12-06 01:21:47,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690138590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:47,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:47,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838557506] [2022-12-06 01:21:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:47,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:21:47,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 980 transitions, 61221 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:47,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:47,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:21:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:49,096 INFO L130 PetriNetUnfolder]: 314/1082 cut-off events. [2022-12-06 01:21:49,097 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 01:21:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34826 conditions, 1082 events. 314/1082 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8891 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 17466. Up to 1083 conditions per place. [2022-12-06 01:21:49,102 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 24 selfloop transitions, 5 changer transitions 953/982 dead transitions. [2022-12-06 01:21:49,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 982 transitions, 63312 flow [2022-12-06 01:21:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-12-06 01:21:49,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22692307692307692 [2022-12-06 01:21:49,104 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 218 predicate places. [2022-12-06 01:21:49,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:49,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 982 transitions, 63312 flow [2022-12-06 01:21:49,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 982 transitions, 63312 flow [2022-12-06 01:21:49,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:49,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:49,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:21:49,144 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 982 transitions, 63312 flow [2022-12-06 01:21:49,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:49,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:21:49,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:49,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 01:21:49,145 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:21:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:21:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1472564655, now seen corresponding path program 19 times [2022-12-06 01:21:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:21:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003892767] [2022-12-06 01:21:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:21:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:21:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:21:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:21:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:21:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003892767] [2022-12-06 01:21:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003892767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:21:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:21:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 01:21:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233162787] [2022-12-06 01:21:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:21:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 01:21:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:21:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 01:21:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 01:21:50,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:21:50,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 982 transitions, 63312 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:50,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:21:50,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:21:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:21:51,285 INFO L130 PetriNetUnfolder]: 314/1081 cut-off events. [2022-12-06 01:21:51,285 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-06 01:21:51,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35876 conditions, 1081 events. 314/1081 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8904 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 18011. Up to 1082 conditions per place. [2022-12-06 01:21:51,291 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 0 selfloop transitions, 0 changer transitions 981/981 dead transitions. [2022-12-06 01:21:51,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 981 transitions, 65210 flow [2022-12-06 01:21:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:21:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:21:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-12-06 01:21:51,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2653846153846154 [2022-12-06 01:21:51,294 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 226 predicate places. [2022-12-06 01:21:51,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:51,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 981 transitions, 65210 flow [2022-12-06 01:21:51,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 981 transitions, 65210 flow [2022-12-06 01:21:51,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:21:51,334 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:21:51,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 01:21:51,335 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 981 transitions, 65210 flow [2022-12-06 01:21:51,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:21:51,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 01:21:51,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 01:21:51,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 01:21:51,339 INFO L458 BasicCegarLoop]: Path program histogram: [19, 7, 1, 1, 1, 1, 1, 1] [2022-12-06 01:21:51,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:21:51,342 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:21:51,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:21:51 BasicIcfg [2022-12-06 01:21:51,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:21:51,346 INFO L158 Benchmark]: Toolchain (without parser) took 85236.72ms. Allocated memory was 200.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 173.7MB in the beginning and 1.2GB in the end (delta: -987.1MB). Peak memory consumption was 342.9MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,346 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:21:51,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.22ms. Allocated memory is still 200.3MB. Free memory was 173.7MB in the beginning and 152.5MB in the end (delta: 21.2MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.53ms. Allocated memory is still 200.3MB. Free memory was 152.0MB in the beginning and 148.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,346 INFO L158 Benchmark]: Boogie Preprocessor took 35.78ms. Allocated memory is still 200.3MB. Free memory was 148.9MB in the beginning and 146.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,347 INFO L158 Benchmark]: RCFGBuilder took 593.02ms. Allocated memory is still 200.3MB. Free memory was 146.2MB in the beginning and 123.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,347 INFO L158 Benchmark]: TraceAbstraction took 83670.65ms. Allocated memory was 200.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 289.8MB. Max. memory is 8.0GB. [2022-12-06 01:21:51,348 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.12ms. Allocated memory is still 200.3MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 878.22ms. Allocated memory is still 200.3MB. Free memory was 173.7MB in the beginning and 152.5MB in the end (delta: 21.2MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.53ms. Allocated memory is still 200.3MB. Free memory was 152.0MB in the beginning and 148.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.78ms. Allocated memory is still 200.3MB. Free memory was 148.9MB in the beginning and 146.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.02ms. Allocated memory is still 200.3MB. Free memory was 146.2MB in the beginning and 123.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 83670.65ms. Allocated memory was 200.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 289.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.6s, 162 PlacesBefore, 39 PlacesAfterwards, 162 TransitionsBefore, 35 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 132 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 1744, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1512, independent: 1475, independent conditional: 0, independent unconditional: 1475, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1512, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15389, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 306, dependent conditional: 0, dependent unconditional: 306, unknown: 15064, unknown conditional: 0, unknown unconditional: 15064] ], Cache Queries: [ total: 1835, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 1515, unknown conditional: 0, unknown unconditional: 1515] , Statistics on independence cache: Total cache size (in pairs): 2485, Positive cache size: 2455, Positive conditional cache size: 0, Positive unconditional cache size: 2455, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 38 PlacesBefore, 32 PlacesAfterwards, 32 TransitionsBefore, 26 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 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, 36 PlacesBefore, 36 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 58 TransitionsBefore, 58 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, 48 PlacesBefore, 48 PlacesAfterwards, 145 TransitionsBefore, 145 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, 52 PlacesBefore, 52 PlacesAfterwards, 178 TransitionsBefore, 178 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, 61 PlacesBefore, 61 PlacesAfterwards, 218 TransitionsBefore, 218 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.3s, 73 PlacesBefore, 72 PlacesAfterwards, 283 TransitionsBefore, 282 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 585 TransitionsBefore, 585 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, 90 PlacesBefore, 90 PlacesAfterwards, 662 TransitionsBefore, 662 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, 99 PlacesBefore, 99 PlacesAfterwards, 672 TransitionsBefore, 672 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.6s, 111 PlacesBefore, 110 PlacesAfterwards, 760 TransitionsBefore, 759 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 827 TransitionsBefore, 827 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, 128 PlacesBefore, 128 PlacesAfterwards, 856 TransitionsBefore, 856 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 904 TransitionsBefore, 904 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, 905 TransitionsBefore, 905 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, 151 PlacesBefore, 151 PlacesAfterwards, 953 TransitionsBefore, 953 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 160 PlacesBefore, 160 PlacesAfterwards, 951 TransitionsBefore, 951 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, 164 PlacesBefore, 164 PlacesAfterwards, 862 TransitionsBefore, 862 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, 173 PlacesBefore, 173 PlacesAfterwards, 900 TransitionsBefore, 900 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, 182 PlacesBefore, 182 PlacesAfterwards, 950 TransitionsBefore, 950 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 191 PlacesBefore, 191 PlacesAfterwards, 948 TransitionsBefore, 948 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, 199 PlacesBefore, 199 PlacesAfterwards, 960 TransitionsBefore, 960 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, 207 PlacesBefore, 207 PlacesAfterwards, 963 TransitionsBefore, 963 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, 974 TransitionsBefore, 974 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, 225 PlacesBefore, 225 PlacesAfterwards, 974 TransitionsBefore, 974 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, 230 PlacesBefore, 230 PlacesAfterwards, 973 TransitionsBefore, 973 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, 239 PlacesBefore, 239 PlacesAfterwards, 972 TransitionsBefore, 972 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, 248 PlacesBefore, 248 PlacesAfterwards, 980 TransitionsBefore, 980 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, 257 PlacesBefore, 257 PlacesAfterwards, 982 TransitionsBefore, 982 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, 981 TransitionsBefore, 981 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 183 locations, 8 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: 83.5s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1242 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10994 IncrementalHoareTripleChecker+Invalid, 11542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 1 mSDtfsCounter, 10994 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65210occurred in iteration=32, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 11271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:21:51,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...