/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -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-a802222-m [2022-12-13 12:06:28,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:28,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:28,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:28,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:28,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:28,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:28,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:28,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:28,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:28,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:28,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:28,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:28,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:28,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:28,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:28,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:28,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:28,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:28,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:28,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:28,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:28,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:28,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:28,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:28,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:28,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:28,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:28,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:28,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:28,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:28,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:28,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:28,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:28,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:28,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:28,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:28,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:28,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:28,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:28,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:28,880 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:06:28,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:28,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:28,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:28,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:28,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:28,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:28,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:28,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:28,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:06:28,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:06:28,912 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 [2022-12-13 12:06:29,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:29,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:29,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:29,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:29,280 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:29,281 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-13 12:06:30,359 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:30,625 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:30,626 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-13 12:06:30,644 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee31252bd/cb06433de28f44bc9bd4ba2487ab464b/FLAGbfb6968e5 [2022-12-13 12:06:30,656 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee31252bd/cb06433de28f44bc9bd4ba2487ab464b [2022-12-13 12:06:30,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:30,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:06:30,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:30,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:30,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:30,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:30" (1/1) ... [2022-12-13 12:06:30,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15037901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:30, skipping insertion in model container [2022-12-13 12:06:30,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:30" (1/1) ... [2022-12-13 12:06:30,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:30,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:31,125 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-13 12:06:31,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:31,176 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:31,229 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-13 12:06:31,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:31,320 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:31,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31 WrapperNode [2022-12-13 12:06:31,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:31,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:31,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:31,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:31,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,371 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-13 12:06:31,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:31,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:31,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:31,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:31,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,395 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:31,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:31,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:31,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:31,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (1/1) ... [2022-12-13 12:06:31,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:06:31,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:06:31,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:06:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 12:06:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 12:06:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:06:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:06:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:06:31,465 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:06:31,720 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:06:31,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:06:31,880 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:06:31,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:06:31,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:06:31,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:31 BoogieIcfgContainer [2022-12-13 12:06:31,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:06:31,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:06:31,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:06:31,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:06:31,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:30" (1/3) ... [2022-12-13 12:06:31,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f61f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:31, skipping insertion in model container [2022-12-13 12:06:31,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:31" (2/3) ... [2022-12-13 12:06:31,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f61f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:31, skipping insertion in model container [2022-12-13 12:06:31,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:31" (3/3) ... [2022-12-13 12:06:31,894 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-13 12:06:31,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:06:31,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 12:06:31,907 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:06:31,981 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 12:06:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 12:06:32,118 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-13 12:06:32,118 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:32,122 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-13 12:06:32,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 12:06:32,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-13 12:06:32,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:32,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 12:06:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-13 12:06:32,197 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-13 12:06:32,197 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:32,198 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-13 12:06:32,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 12:06:32,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-13 12:07:04,588 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 12:07:04,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:07:04,627 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;@5bbdbe85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:07:04,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 12:07:04,628 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:07:04,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:04,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:04,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:07:04,628 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-13 12:07:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2022-12-13 12:07:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:04,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796623551] [2022-12-13 12:07:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796623551] [2022-12-13 12:07:04,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796623551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:04,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:04,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:07:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753123408] [2022-12-13 12:07:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:04,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-13 12:07:04,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:04,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:04,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-13 12:07:04,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:05,122 INFO L130 PetriNetUnfolder]: 1251/2241 cut-off events. [2022-12-13 12:07:05,123 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 12:07:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 2241 events. 1251/2241 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14530 event pairs, 1250 based on Foata normal form. 122/1259 useless extension candidates. Maximal degree in co-relation 4153. Up to 2042 conditions per place. [2022-12-13 12:07:05,136 INFO L137 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-12-13 12:07:05,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 182 flow [2022-12-13 12:07:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:07:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-12-13 12:07:05,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2022-12-13 12:07:05,147 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 114 flow. Second operand 2 states and 62 transitions. [2022-12-13 12:07:05,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 182 flow [2022-12-13 12:07:05,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:07:05,151 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 100 flow [2022-12-13 12:07:05,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2022-12-13 12:07:05,154 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2022-12-13 12:07:05,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:05,155 INFO L89 Accepts]: Start accepts. Operand has 50 places, 48 transitions, 100 flow [2022-12-13 12:07:05,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:05,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:05,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 48 transitions, 100 flow [2022-12-13 12:07:05,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 100 flow [2022-12-13 12:07:05,162 INFO L130 PetriNetUnfolder]: 1/54 cut-off events. [2022-12-13 12:07:05,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:05,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 54 events. 1/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 187 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:07:05,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 100 flow [2022-12-13 12:07:05,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 12:07:11,887 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:11,888 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:11,891 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:11,892 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:18,587 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:18,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13434 [2022-12-13 12:07:18,588 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 98 flow [2022-12-13 12:07:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:18,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:18,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:07:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:07:18,589 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-13 12:07:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 19041436, now seen corresponding path program 1 times [2022-12-13 12:07:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987360623] [2022-12-13 12:07:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:18,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987360623] [2022-12-13 12:07:18,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987360623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:18,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:18,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420430870] [2022-12-13 12:07:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:18,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:07:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:07:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:07:19,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 12:07:19,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:19,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:19,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 12:07:19,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:19,406 INFO L130 PetriNetUnfolder]: 3304/5383 cut-off events. [2022-12-13 12:07:19,406 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 12:07:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10720 conditions, 5383 events. 3304/5383 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 33289 event pairs, 1566 based on Foata normal form. 0/2952 useless extension candidates. Maximal degree in co-relation 472. Up to 3565 conditions per place. [2022-12-13 12:07:19,426 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 64 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2022-12-13 12:07:19,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 298 flow [2022-12-13 12:07:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:07:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:07:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 12:07:19,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2022-12-13 12:07:19,429 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 98 flow. Second operand 3 states and 82 transitions. [2022-12-13 12:07:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 298 flow [2022-12-13 12:07:19,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:07:19,432 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:19,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-13 12:07:19,433 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2022-12-13 12:07:19,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:19,433 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:19,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:19,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:19,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:19,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:19,467 INFO L130 PetriNetUnfolder]: 63/253 cut-off events. [2022-12-13 12:07:19,467 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 12:07:19,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 253 events. 63/253 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1523 event pairs, 37 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 118. Up to 108 conditions per place. [2022-12-13 12:07:19,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:19,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 1050 [2022-12-13 12:07:23,926 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:23,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4494 [2022-12-13 12:07:23,927 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 148 flow [2022-12-13 12:07:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:23,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:23,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:07:23,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:07:23,927 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-13 12:07:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 590279223, now seen corresponding path program 1 times [2022-12-13 12:07:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:23,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103326061] [2022-12-13 12:07:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103326061] [2022-12-13 12:07:24,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103326061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:24,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:24,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386115085] [2022-12-13 12:07:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:24,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:07:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:24,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:07:24,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:07:24,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 12:07:24,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:24,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:24,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 12:07:24,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:24,696 INFO L130 PetriNetUnfolder]: 3551/5845 cut-off events. [2022-12-13 12:07:24,696 INFO L131 PetriNetUnfolder]: For 873/873 co-relation queries the response was YES. [2022-12-13 12:07:24,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13377 conditions, 5845 events. 3551/5845 cut-off events. For 873/873 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37411 event pairs, 1895 based on Foata normal form. 316/3853 useless extension candidates. Maximal degree in co-relation 3332. Up to 3992 conditions per place. [2022-12-13 12:07:24,712 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 68 selfloop transitions, 13 changer transitions 2/86 dead transitions. [2022-12-13 12:07:24,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 412 flow [2022-12-13 12:07:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:07:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:07:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 12:07:24,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-13 12:07:24,713 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 148 flow. Second operand 3 states and 81 transitions. [2022-12-13 12:07:24,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 412 flow [2022-12-13 12:07:24,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:24,722 INFO L231 Difference]: Finished difference. Result has 53 places, 63 transitions, 247 flow [2022-12-13 12:07:24,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=53, PETRI_TRANSITIONS=63} [2022-12-13 12:07:24,723 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2022-12-13 12:07:24,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:24,723 INFO L89 Accepts]: Start accepts. Operand has 53 places, 63 transitions, 247 flow [2022-12-13 12:07:24,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:24,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:24,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 63 transitions, 247 flow [2022-12-13 12:07:24,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 63 transitions, 247 flow [2022-12-13 12:07:24,746 INFO L130 PetriNetUnfolder]: 159/422 cut-off events. [2022-12-13 12:07:24,746 INFO L131 PetriNetUnfolder]: For 137/139 co-relation queries the response was YES. [2022-12-13 12:07:24,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 422 events. 159/422 cut-off events. For 137/139 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2572 event pairs, 36 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 319. Up to 235 conditions per place. [2022-12-13 12:07:24,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 63 transitions, 247 flow [2022-12-13 12:07:24,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 1250 [2022-12-13 12:07:24,783 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:24,784 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:24,785 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:24,786 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:24,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:24,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [393] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= |v_#memory_int_32| (store |v_#memory_int_33| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_3| 1)))) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_3|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_3|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:24,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [409] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_17 24))) (and (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.offset_21|) (= (store |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_38|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, #memory_int=|v_#memory_int_39|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, #memory_int=|v_#memory_int_38|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 12:07:24,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:24,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [377] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:24,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_92|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_495|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_108|, #memory_int=|v_#memory_int_557|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_495|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [574] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_131 28))) (and (= (store |v_#memory_$Pointer$.base_228| v_my_callbackThread1of1ForFork0_~data~0.base_131 (store (select |v_#memory_$Pointer$.base_228| v_my_callbackThread1of1ForFork0_~data~0.base_131) .cse0 (select (select |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_131) .cse0))) |v_#memory_$Pointer$.base_227|) (= (store |v_#memory_int_289| v_my_callbackThread1of1ForFork0_~data~0.base_131 (store (select |v_#memory_int_289| v_my_callbackThread1of1ForFork0_~data~0.base_131) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_52| 1))) |v_#memory_int_288|) (= |v_#memory_$Pointer$.offset_227| (store |v_#memory_$Pointer$.offset_228| v_my_callbackThread1of1ForFork0_~data~0.base_131 (store (select |v_#memory_$Pointer$.offset_228| v_my_callbackThread1of1ForFork0_~data~0.base_131) .cse0 (select (select |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_131) .cse0)))))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_131, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_52|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_228|, #memory_int=|v_#memory_int_289|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_131, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_228|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_131, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_227|, #memory_int=|v_#memory_int_288|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_131, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_227|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:24,947 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:07:24,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 12:07:24,948 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 62 transitions, 257 flow [2022-12-13 12:07:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:24,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:24,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:07:24,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1334114613, now seen corresponding path program 1 times [2022-12-13 12:07:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:24,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266840548] [2022-12-13 12:07:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:24,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:24,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266840548] [2022-12-13 12:07:24,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266840548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:24,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:24,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512701831] [2022-12-13 12:07:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:24,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:24,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:24,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:24,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2022-12-13 12:07:24,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 62 transitions, 257 flow. Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:24,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:24,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2022-12-13 12:07:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:25,063 INFO L130 PetriNetUnfolder]: 384/762 cut-off events. [2022-12-13 12:07:25,064 INFO L131 PetriNetUnfolder]: For 636/685 co-relation queries the response was YES. [2022-12-13 12:07:25,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 762 events. 384/762 cut-off events. For 636/685 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4085 event pairs, 384 based on Foata normal form. 185/610 useless extension candidates. Maximal degree in co-relation 1719. Up to 682 conditions per place. [2022-12-13 12:07:25,065 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 17 selfloop transitions, 0 changer transitions 14/39 dead transitions. [2022-12-13 12:07:25,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 168 flow [2022-12-13 12:07:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:07:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-12-13 12:07:25,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-13 12:07:25,067 INFO L175 Difference]: Start difference. First operand has 52 places, 62 transitions, 257 flow. Second operand 2 states and 58 transitions. [2022-12-13 12:07:25,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 168 flow [2022-12-13 12:07:25,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 156 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:25,068 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 64 flow [2022-12-13 12:07:25,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2022-12-13 12:07:25,068 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2022-12-13 12:07:25,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:25,069 INFO L89 Accepts]: Start accepts. Operand has 45 places, 25 transitions, 64 flow [2022-12-13 12:07:25,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:25,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:25,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 25 transitions, 64 flow [2022-12-13 12:07:25,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 64 flow [2022-12-13 12:07:25,074 INFO L130 PetriNetUnfolder]: 6/49 cut-off events. [2022-12-13 12:07:25,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:25,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 49 events. 6/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 6 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 18 conditions per place. [2022-12-13 12:07:25,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 64 flow [2022-12-13 12:07:25,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 12:07:25,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:25,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 12:07:25,080 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 64 flow [2022-12-13 12:07:25,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:25,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:25,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:25,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:07:25,080 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-13 12:07:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1399772046, now seen corresponding path program 1 times [2022-12-13 12:07:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:25,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588563420] [2022-12-13 12:07:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588563420] [2022-12-13 12:07:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588563420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:25,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:25,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:07:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145215525] [2022-12-13 12:07:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:07:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:07:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:07:25,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-13 12:07:25,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:25,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:25,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-13 12:07:25,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:25,691 INFO L130 PetriNetUnfolder]: 151/329 cut-off events. [2022-12-13 12:07:25,692 INFO L131 PetriNetUnfolder]: For 23/31 co-relation queries the response was YES. [2022-12-13 12:07:25,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 329 events. 151/329 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1515 event pairs, 70 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 165. Up to 138 conditions per place. [2022-12-13 12:07:25,693 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 26 selfloop transitions, 6 changer transitions 10/45 dead transitions. [2022-12-13 12:07:25,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 45 transitions, 201 flow [2022-12-13 12:07:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:07:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:07:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 12:07:25,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.464 [2022-12-13 12:07:25,694 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 64 flow. Second operand 5 states and 58 transitions. [2022-12-13 12:07:25,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 45 transitions, 201 flow [2022-12-13 12:07:25,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:07:25,695 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 89 flow [2022-12-13 12:07:25,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-13 12:07:25,695 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -20 predicate places. [2022-12-13 12:07:25,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:25,696 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 89 flow [2022-12-13 12:07:25,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:25,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:25,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 89 flow [2022-12-13 12:07:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 89 flow [2022-12-13 12:07:25,701 INFO L130 PetriNetUnfolder]: 8/54 cut-off events. [2022-12-13 12:07:25,701 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:07:25,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 54 events. 8/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 4 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 58. Up to 19 conditions per place. [2022-12-13 12:07:25,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 89 flow [2022-12-13 12:07:25,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 12:07:25,709 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:25,710 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:25,711 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:25,712 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:30,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:30,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4342 [2022-12-13 12:07:30,038 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 87 flow [2022-12-13 12:07:30,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:30,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:30,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:30,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:07:30,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1137812920, now seen corresponding path program 1 times [2022-12-13 12:07:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:30,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863035290] [2022-12-13 12:07:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:30,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863035290] [2022-12-13 12:07:30,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863035290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:30,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:30,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:07:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372754980] [2022-12-13 12:07:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:30,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:07:30,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:30,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:07:30,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:07:30,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 12:07:30,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 87 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:30,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:30,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 12:07:30,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:30,780 INFO L130 PetriNetUnfolder]: 123/270 cut-off events. [2022-12-13 12:07:30,780 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-13 12:07:30,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 270 events. 123/270 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1105 event pairs, 20 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 212. Up to 119 conditions per place. [2022-12-13 12:07:30,782 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-13 12:07:30,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 320 flow [2022-12-13 12:07:30,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:07:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:07:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-13 12:07:30,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 12:07:30,789 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 87 flow. Second operand 6 states and 48 transitions. [2022-12-13 12:07:30,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 320 flow [2022-12-13 12:07:30,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:07:30,791 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:30,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-13 12:07:30,792 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -19 predicate places. [2022-12-13 12:07:30,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:30,792 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:30,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:30,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:30,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:30,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:30,800 INFO L130 PetriNetUnfolder]: 16/92 cut-off events. [2022-12-13 12:07:30,800 INFO L131 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2022-12-13 12:07:30,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 92 events. 16/92 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 370 event pairs, 10 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2022-12-13 12:07:30,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:30,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 12:07:31,141 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:31,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-13 12:07:31,142 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 128 flow [2022-12-13 12:07:31,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:31,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:31,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:31,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:07:31,143 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-13 12:07:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1038378978, now seen corresponding path program 1 times [2022-12-13 12:07:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:31,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108938083] [2022-12-13 12:07:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108938083] [2022-12-13 12:07:32,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108938083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:32,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:32,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 12:07:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604341144] [2022-12-13 12:07:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:32,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 12:07:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 12:07:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:07:32,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 12:07:32,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 128 flow. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:32,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:32,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 12:07:32,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:33,554 INFO L130 PetriNetUnfolder]: 173/381 cut-off events. [2022-12-13 12:07:33,555 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-13 12:07:33,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 381 events. 173/381 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1690 event pairs, 38 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 338. Up to 241 conditions per place. [2022-12-13 12:07:33,556 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 52 selfloop transitions, 25 changer transitions 18/95 dead transitions. [2022-12-13 12:07:33,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 647 flow [2022-12-13 12:07:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:07:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 12:07:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-13 12:07:33,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27 [2022-12-13 12:07:33,558 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 128 flow. Second operand 15 states and 81 transitions. [2022-12-13 12:07:33,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 647 flow [2022-12-13 12:07:33,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:07:33,560 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 400 flow [2022-12-13 12:07:33,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=400, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-13 12:07:33,560 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2022-12-13 12:07:33,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:33,561 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 400 flow [2022-12-13 12:07:33,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:33,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:33,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 400 flow [2022-12-13 12:07:33,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 400 flow [2022-12-13 12:07:33,594 INFO L130 PetriNetUnfolder]: 33/160 cut-off events. [2022-12-13 12:07:33,594 INFO L131 PetriNetUnfolder]: For 214/217 co-relation queries the response was YES. [2022-12-13 12:07:33,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 160 events. 33/160 cut-off events. For 214/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 852 event pairs, 0 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 498. Up to 54 conditions per place. [2022-12-13 12:07:33,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 400 flow [2022-12-13 12:07:33,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 12:07:34,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_228| v_my_callbackThread1of1ForFork1_~data~0.base_115))) (and (= |v_my_callbackThread1of1ForFork1_#t~nondet31_31| 0) (= (store |v_#pthreadsMutex_228| v_my_callbackThread1of1ForFork1_~data~0.base_115 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_115 1)) |v_#pthreadsMutex_227|) (= v_my_callbackThread1of1ForFork1_~dev~0.base_21 v_my_callbackThread1of1ForFork1_~arg.base_19) (= v_my_callbackThread1of1ForFork1_~dev~0.base_21 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_19 v_my_callbackThread1of1ForFork1_~dev~0.offset_21) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_115 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_21 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~arg.base_19 |v_my_callbackThread1of1ForFork1_#in~arg.base_13|) (= v_my_callbackThread1of1ForFork1_~arg.offset_19 |v_my_callbackThread1of1ForFork1_#in~arg.offset_13|) (= v_my_callbackThread1of1ForFork1_~data~0.base_115 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_115) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_228|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_227|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_115, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_115, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_19, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_19, 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_21, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_31|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_21, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} 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] and [600] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_479| v_my_callbackThread1of1ForFork0_~data~0.base_262)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_262 24))) (and (= v_my_callbackThread1of1ForFork0_~arg.offset_56 |v_my_callbackThread1of1ForFork0_#in~arg.offset_48|) (= (store |v_#memory_$Pointer$.base_564| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_$Pointer$.base_564| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 (select (select |v_#memory_$Pointer$.base_563| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0))) |v_#memory_$Pointer$.base_563|) (= (store |v_#pthreadsMutex_479| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_262 1)) |v_#pthreadsMutex_478|) (= (store |v_#memory_int_632| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_int_632| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 1)) |v_#memory_int_631|) (= v_my_callbackThread1of1ForFork0_~data~0.base_262 v_my_callbackThread1of1ForFork0_~__mptr~0.base_50) (= v_my_callbackThread1of1ForFork0_~dev~0.base_56 v_my_callbackThread1of1ForFork0_~arg.base_56) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_56 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_262) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_48| v_my_callbackThread1of1ForFork0_~arg.base_56) (= v_my_callbackThread1of1ForFork0_~dev~0.base_56 v_my_callbackThread1of1ForFork0_~__mptr~0.base_50) (= v_my_callbackThread1of1ForFork0_~arg.offset_56 v_my_callbackThread1of1ForFork0_~dev~0.offset_56) (= |v_#memory_$Pointer$.offset_563| (store |v_#memory_$Pointer$.offset_564| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_$Pointer$.offset_564| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 (select (select |v_#memory_$Pointer$.offset_563| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_479|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_48|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_564|, #memory_int=|v_#memory_int_632|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_564|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_478|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_563|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_56, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_48|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_54|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_262, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_262, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_48|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_56, #memory_int=|v_#memory_int_631|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_50, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_56, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_56, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_563|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-13 12:07:34,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_228| v_my_callbackThread1of1ForFork1_~data~0.base_115))) (and (= |v_my_callbackThread1of1ForFork1_#t~nondet31_31| 0) (= (store |v_#pthreadsMutex_228| v_my_callbackThread1of1ForFork1_~data~0.base_115 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_115 1)) |v_#pthreadsMutex_227|) (= v_my_callbackThread1of1ForFork1_~dev~0.base_21 v_my_callbackThread1of1ForFork1_~arg.base_19) (= v_my_callbackThread1of1ForFork1_~dev~0.base_21 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_19 v_my_callbackThread1of1ForFork1_~dev~0.offset_21) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_115 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_21 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~arg.base_19 |v_my_callbackThread1of1ForFork1_#in~arg.base_13|) (= v_my_callbackThread1of1ForFork1_~arg.offset_19 |v_my_callbackThread1of1ForFork1_#in~arg.offset_13|) (= v_my_callbackThread1of1ForFork1_~data~0.base_115 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_115) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_228|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_13|, #pthreadsMutex=|v_#pthreadsMutex_227|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_115, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_115, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_19, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_19, 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_21, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_31|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_21, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_13|} 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] and [600] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_479| v_my_callbackThread1of1ForFork0_~data~0.base_262)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_262 24))) (and (= v_my_callbackThread1of1ForFork0_~arg.offset_56 |v_my_callbackThread1of1ForFork0_#in~arg.offset_48|) (= (store |v_#memory_$Pointer$.base_564| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_$Pointer$.base_564| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 (select (select |v_#memory_$Pointer$.base_563| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0))) |v_#memory_$Pointer$.base_563|) (= (store |v_#pthreadsMutex_479| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_262 1)) |v_#pthreadsMutex_478|) (= (store |v_#memory_int_632| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_int_632| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 1)) |v_#memory_int_631|) (= v_my_callbackThread1of1ForFork0_~data~0.base_262 v_my_callbackThread1of1ForFork0_~__mptr~0.base_50) (= v_my_callbackThread1of1ForFork0_~dev~0.base_56 v_my_callbackThread1of1ForFork0_~arg.base_56) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_56 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_262) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_48| v_my_callbackThread1of1ForFork0_~arg.base_56) (= v_my_callbackThread1of1ForFork0_~dev~0.base_56 v_my_callbackThread1of1ForFork0_~__mptr~0.base_50) (= v_my_callbackThread1of1ForFork0_~arg.offset_56 v_my_callbackThread1of1ForFork0_~dev~0.offset_56) (= |v_#memory_$Pointer$.offset_563| (store |v_#memory_$Pointer$.offset_564| v_my_callbackThread1of1ForFork0_~data~0.base_262 (store (select |v_#memory_$Pointer$.offset_564| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0 (select (select |v_#memory_$Pointer$.offset_563| v_my_callbackThread1of1ForFork0_~data~0.base_262) .cse0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_479|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_48|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_564|, #memory_int=|v_#memory_int_632|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_564|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_478|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_563|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_56, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_48|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_54|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_50, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_262, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_262, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_48|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_56, #memory_int=|v_#memory_int_631|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_50, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_56, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_56, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_563|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-13 12:07:36,787 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:07:36,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3228 [2022-12-13 12:07:36,788 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 418 flow [2022-12-13 12:07:36,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:36,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:36,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:07:36,788 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-13 12:07:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -491260442, now seen corresponding path program 1 times [2022-12-13 12:07:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261660774] [2022-12-13 12:07:36,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261660774] [2022-12-13 12:07:37,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261660774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:37,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:37,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:07:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152104892] [2022-12-13 12:07:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:07:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:07:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:07:37,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 12:07:37,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:37,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:37,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 12:07:37,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:37,299 INFO L130 PetriNetUnfolder]: 86/231 cut-off events. [2022-12-13 12:07:37,299 INFO L131 PetriNetUnfolder]: For 567/588 co-relation queries the response was YES. [2022-12-13 12:07:37,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 231 events. 86/231 cut-off events. For 567/588 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1091 event pairs, 23 based on Foata normal form. 14/228 useless extension candidates. Maximal degree in co-relation 919. Up to 132 conditions per place. [2022-12-13 12:07:37,301 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 40 selfloop transitions, 9 changer transitions 3/57 dead transitions. [2022-12-13 12:07:37,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 507 flow [2022-12-13 12:07:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:07:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:07:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 12:07:37,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2022-12-13 12:07:37,304 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 418 flow. Second operand 5 states and 44 transitions. [2022-12-13 12:07:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 507 flow [2022-12-13 12:07:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 443 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 12:07:37,308 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 307 flow [2022-12-13 12:07:37,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 12:07:37,311 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 12:07:37,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:37,311 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 307 flow [2022-12-13 12:07:37,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:37,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:37,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 307 flow [2022-12-13 12:07:37,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 307 flow [2022-12-13 12:07:37,326 INFO L130 PetriNetUnfolder]: 25/128 cut-off events. [2022-12-13 12:07:37,326 INFO L131 PetriNetUnfolder]: For 223/227 co-relation queries the response was YES. [2022-12-13 12:07:37,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 128 events. 25/128 cut-off events. For 223/227 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 621 event pairs, 4 based on Foata normal form. 3/128 useless extension candidates. Maximal degree in co-relation 311. Up to 27 conditions per place. [2022-12-13 12:07:37,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 307 flow [2022-12-13 12:07:37,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 12:07:37,335 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:37,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 12:07:37,339 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 307 flow [2022-12-13 12:07:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:37,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:37,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:37,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:07:37,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash -816839380, now seen corresponding path program 2 times [2022-12-13 12:07:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447175188] [2022-12-13 12:07:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447175188] [2022-12-13 12:07:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447175188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:38,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:38,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763766278] [2022-12-13 12:07:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:38,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:07:38,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 307 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:38,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:38,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:07:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:39,592 INFO L130 PetriNetUnfolder]: 144/339 cut-off events. [2022-12-13 12:07:39,593 INFO L131 PetriNetUnfolder]: For 759/759 co-relation queries the response was YES. [2022-12-13 12:07:39,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 339 events. 144/339 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1544 event pairs, 75 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 1014. Up to 282 conditions per place. [2022-12-13 12:07:39,594 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 44 selfloop transitions, 10 changer transitions 25/79 dead transitions. [2022-12-13 12:07:39,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 638 flow [2022-12-13 12:07:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-12-13 12:07:39,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21245421245421245 [2022-12-13 12:07:39,596 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 307 flow. Second operand 13 states and 58 transitions. [2022-12-13 12:07:39,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 638 flow [2022-12-13 12:07:39,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 621 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:07:39,599 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 354 flow [2022-12-13 12:07:39,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=354, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2022-12-13 12:07:39,600 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2022-12-13 12:07:39,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:39,600 INFO L89 Accepts]: Start accepts. Operand has 67 places, 47 transitions, 354 flow [2022-12-13 12:07:39,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:39,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:39,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 47 transitions, 354 flow [2022-12-13 12:07:39,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 47 transitions, 354 flow [2022-12-13 12:07:39,615 INFO L130 PetriNetUnfolder]: 24/132 cut-off events. [2022-12-13 12:07:39,615 INFO L131 PetriNetUnfolder]: For 281/284 co-relation queries the response was YES. [2022-12-13 12:07:39,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 132 events. 24/132 cut-off events. For 281/284 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 664 event pairs, 4 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 457. Up to 28 conditions per place. [2022-12-13 12:07:39,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 47 transitions, 354 flow [2022-12-13 12:07:39,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 12:07:39,888 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:39,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-13 12:07:39,889 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 354 flow [2022-12-13 12:07:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:39,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:39,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:07:39,889 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 405719444, now seen corresponding path program 3 times [2022-12-13 12:07:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400763478] [2022-12-13 12:07:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:41,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400763478] [2022-12-13 12:07:41,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400763478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:41,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:41,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897850736] [2022-12-13 12:07:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:41,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:41,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:41,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:07:41,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 354 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:41,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:41,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:07:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:41,671 INFO L130 PetriNetUnfolder]: 154/358 cut-off events. [2022-12-13 12:07:41,671 INFO L131 PetriNetUnfolder]: For 1037/1037 co-relation queries the response was YES. [2022-12-13 12:07:41,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 358 events. 154/358 cut-off events. For 1037/1037 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1662 event pairs, 79 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 1503. Up to 291 conditions per place. [2022-12-13 12:07:41,673 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 62 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2022-12-13 12:07:41,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 759 flow [2022-12-13 12:07:41,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-12-13 12:07:41,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23443223443223443 [2022-12-13 12:07:41,674 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 354 flow. Second operand 13 states and 64 transitions. [2022-12-13 12:07:41,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 759 flow [2022-12-13 12:07:41,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 705 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-13 12:07:41,678 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 527 flow [2022-12-13 12:07:41,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=527, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2022-12-13 12:07:41,678 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2022-12-13 12:07:41,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:41,678 INFO L89 Accepts]: Start accepts. Operand has 70 places, 63 transitions, 527 flow [2022-12-13 12:07:41,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:41,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:41,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 63 transitions, 527 flow [2022-12-13 12:07:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 63 transitions, 527 flow [2022-12-13 12:07:41,692 INFO L130 PetriNetUnfolder]: 31/160 cut-off events. [2022-12-13 12:07:41,692 INFO L131 PetriNetUnfolder]: For 426/433 co-relation queries the response was YES. [2022-12-13 12:07:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 160 events. 31/160 cut-off events. For 426/433 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 852 event pairs, 4 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 574. Up to 37 conditions per place. [2022-12-13 12:07:41,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 63 transitions, 527 flow [2022-12-13 12:07:41,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 12:07:41,700 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:41,700 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:41,701 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:41,702 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:41,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L1727-4-->L1735: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 0)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_106| 0) (= (store |v_#length_126| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 4) |v_#length_125|) (= (select (select |v_#memory_int_555| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_53| 0) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 1) |v_#valid_176|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_58|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, #memory_int=|v_#memory_int_555|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_126|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_48|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_106|, #length=|v_#length_125|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_48|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_58|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_555|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} 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_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:41,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L1727-4-->L1735: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 0)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_106| 0) (= (store |v_#length_126| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 4) |v_#length_125|) (= (select (select |v_#memory_int_555| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_53| 0) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 1) |v_#valid_176|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_58|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, #memory_int=|v_#memory_int_555|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_126|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_48|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_106|, #length=|v_#length_125|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_48|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_58|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_555|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} 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_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [604] L1711-1-->L1712-1: Formula: (let ((.cse1 (select |v_#memory_int_849| v_my_callbackThread1of1ForFork0_~data~0.base_305)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_305 28))) (and (= (store |v_#memory_$Pointer$.offset_776| v_my_callbackThread1of1ForFork0_~data~0.base_305 (store (select |v_#memory_$Pointer$.offset_776| v_my_callbackThread1of1ForFork0_~data~0.base_305) .cse0 (select (select |v_#memory_$Pointer$.offset_775| v_my_callbackThread1of1ForFork0_~data~0.base_305) .cse0))) |v_#memory_$Pointer$.offset_775|) (= |v_my_callbackThread1of1ForFork0_#t~mem32_189| (select .cse1 .cse0)) (= (store |v_#memory_int_849| v_my_callbackThread1of1ForFork0_~data~0.base_305 (store .cse1 .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_189| 1))) |v_#memory_int_848|) (= |v_#memory_$Pointer$.base_775| (store |v_#memory_$Pointer$.base_776| v_my_callbackThread1of1ForFork0_~data~0.base_305 (store (select |v_#memory_$Pointer$.base_776| v_my_callbackThread1of1ForFork0_~data~0.base_305) .cse0 (select (select |v_#memory_$Pointer$.base_775| v_my_callbackThread1of1ForFork0_~data~0.base_305) .cse0)))))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_305, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_776|, #memory_int=|v_#memory_int_849|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_305, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_776|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_305, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_189|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_775|, #memory_int=|v_#memory_int_848|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_305, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_775|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:42,059 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:07:42,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-13 12:07:42,060 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 548 flow [2022-12-13 12:07:42,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:42,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:42,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:42,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:07:42,061 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-13 12:07:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1816918512, now seen corresponding path program 4 times [2022-12-13 12:07:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:42,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276334710] [2022-12-13 12:07:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:43,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-13 12:07:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:43,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276334710] [2022-12-13 12:07:43,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276334710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:43,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:43,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211355412] [2022-12-13 12:07:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:43,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:43,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 12:07:43,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 548 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:43,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:43,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 12:07:43,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:44,320 INFO L130 PetriNetUnfolder]: 169/401 cut-off events. [2022-12-13 12:07:44,321 INFO L131 PetriNetUnfolder]: For 1466/1466 co-relation queries the response was YES. [2022-12-13 12:07:44,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 401 events. 169/401 cut-off events. For 1466/1466 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1993 event pairs, 77 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 1735. Up to 328 conditions per place. [2022-12-13 12:07:44,323 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 63 selfloop transitions, 16 changer transitions 20/99 dead transitions. [2022-12-13 12:07:44,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 99 transitions, 967 flow [2022-12-13 12:07:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 12:07:44,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21153846153846154 [2022-12-13 12:07:44,325 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 548 flow. Second operand 13 states and 66 transitions. [2022-12-13 12:07:44,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 99 transitions, 967 flow [2022-12-13 12:07:44,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 930 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 12:07:44,332 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 599 flow [2022-12-13 12:07:44,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=599, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2022-12-13 12:07:44,332 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2022-12-13 12:07:44,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:44,332 INFO L89 Accepts]: Start accepts. Operand has 85 places, 66 transitions, 599 flow [2022-12-13 12:07:44,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:44,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:44,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 66 transitions, 599 flow [2022-12-13 12:07:44,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 66 transitions, 599 flow [2022-12-13 12:07:44,353 INFO L130 PetriNetUnfolder]: 33/174 cut-off events. [2022-12-13 12:07:44,353 INFO L131 PetriNetUnfolder]: For 598/603 co-relation queries the response was YES. [2022-12-13 12:07:44,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 174 events. 33/174 cut-off events. For 598/603 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 996 event pairs, 4 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 694. Up to 42 conditions per place. [2022-12-13 12:07:44,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 66 transitions, 599 flow [2022-12-13 12:07:44,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 12:07:44,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:44,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 12:07:44,543 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 595 flow [2022-12-13 12:07:44,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:44,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:44,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:44,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:07:44,544 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:44,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1304340386, now seen corresponding path program 1 times [2022-12-13 12:07:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:44,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235854779] [2022-12-13 12:07:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235854779] [2022-12-13 12:07:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235854779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:44,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:07:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880622459] [2022-12-13 12:07:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:07:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:07:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:07:44,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 12:07:44,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 595 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-13 12:07:44,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:44,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 12:07:44,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:45,116 INFO L130 PetriNetUnfolder]: 167/409 cut-off events. [2022-12-13 12:07:45,116 INFO L131 PetriNetUnfolder]: For 2139/2139 co-relation queries the response was YES. [2022-12-13 12:07:45,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 409 events. 167/409 cut-off events. For 2139/2139 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2084 event pairs, 34 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 1998. Up to 143 conditions per place. [2022-12-13 12:07:45,122 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 58 selfloop transitions, 32 changer transitions 4/94 dead transitions. [2022-12-13 12:07:45,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 990 flow [2022-12-13 12:07:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:07:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:07:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-13 12:07:45,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 12:07:45,124 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 595 flow. Second operand 6 states and 52 transitions. [2022-12-13 12:07:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 990 flow [2022-12-13 12:07:45,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 919 flow, removed 25 selfloop flow, removed 10 redundant places. [2022-12-13 12:07:45,129 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 655 flow [2022-12-13 12:07:45,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2022-12-13 12:07:45,130 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2022-12-13 12:07:45,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:45,130 INFO L89 Accepts]: Start accepts. Operand has 76 places, 68 transitions, 655 flow [2022-12-13 12:07:45,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:45,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:45,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 68 transitions, 655 flow [2022-12-13 12:07:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 68 transitions, 655 flow [2022-12-13 12:07:45,147 INFO L130 PetriNetUnfolder]: 34/176 cut-off events. [2022-12-13 12:07:45,147 INFO L131 PetriNetUnfolder]: For 727/737 co-relation queries the response was YES. [2022-12-13 12:07:45,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 176 events. 34/176 cut-off events. For 727/737 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 957 event pairs, 6 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 718. Up to 42 conditions per place. [2022-12-13 12:07:45,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 655 flow [2022-12-13 12:07:45,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 12:07:45,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:45,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 12:07:45,155 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 655 flow [2022-12-13 12:07:45,155 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-13 12:07:45,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:45,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:07:45,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash 298391076, now seen corresponding path program 5 times [2022-12-13 12:07:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:45,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497641100] [2022-12-13 12:07:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:45,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:46,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497641100] [2022-12-13 12:07:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497641100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:46,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:46,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277309972] [2022-12-13 12:07:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:46,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:46,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 12:07:46,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 655 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:46,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:46,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 12:07:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:46,872 INFO L130 PetriNetUnfolder]: 176/435 cut-off events. [2022-12-13 12:07:46,872 INFO L131 PetriNetUnfolder]: For 2298/2298 co-relation queries the response was YES. [2022-12-13 12:07:46,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 435 events. 176/435 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2199 event pairs, 97 based on Foata normal form. 2/436 useless extension candidates. Maximal degree in co-relation 2117. Up to 368 conditions per place. [2022-12-13 12:07:46,876 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 61 selfloop transitions, 13 changer transitions 25/99 dead transitions. [2022-12-13 12:07:46,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 1072 flow [2022-12-13 12:07:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-12-13 12:07:46,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2062937062937063 [2022-12-13 12:07:46,877 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 655 flow. Second operand 13 states and 59 transitions. [2022-12-13 12:07:46,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 99 transitions, 1072 flow [2022-12-13 12:07:46,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 1031 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 12:07:46,884 INFO L231 Difference]: Finished difference. Result has 91 places, 70 transitions, 698 flow [2022-12-13 12:07:46,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=698, PETRI_PLACES=91, PETRI_TRANSITIONS=70} [2022-12-13 12:07:46,884 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2022-12-13 12:07:46,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:46,884 INFO L89 Accepts]: Start accepts. Operand has 91 places, 70 transitions, 698 flow [2022-12-13 12:07:46,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:46,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:46,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 70 transitions, 698 flow [2022-12-13 12:07:46,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 70 transitions, 698 flow [2022-12-13 12:07:46,907 INFO L130 PetriNetUnfolder]: 34/181 cut-off events. [2022-12-13 12:07:46,907 INFO L131 PetriNetUnfolder]: For 784/793 co-relation queries the response was YES. [2022-12-13 12:07:46,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 181 events. 34/181 cut-off events. For 784/793 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 999 event pairs, 4 based on Foata normal form. 4/183 useless extension candidates. Maximal degree in co-relation 768. Up to 41 conditions per place. [2022-12-13 12:07:46,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 70 transitions, 698 flow [2022-12-13 12:07:46,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 12:07:46,912 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:46,912 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:46,914 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:46,914 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:46,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L1727-4-->L1735: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 0)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_106| 0) (= (store |v_#length_126| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 4) |v_#length_125|) (= (select (select |v_#memory_int_555| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_53| 0) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 1) |v_#valid_176|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_58|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, #memory_int=|v_#memory_int_555|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_126|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_48|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_106|, #length=|v_#length_125|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_48|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_58|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_555|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} 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_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:07:47,047 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:47,048 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:47,049 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:47,050 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:47,052 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:47,052 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:47,053 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:47,054 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:47,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [601] L1710-1-->L1712: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_301 24))) (and (= (store |v_#memory_$Pointer$.base_629| v_my_callbackThread1of1ForFork1_~data~0.base_301 (store (select |v_#memory_$Pointer$.base_629| v_my_callbackThread1of1ForFork1_~data~0.base_301) .cse0 (select (select |v_#memory_$Pointer$.base_628| v_my_callbackThread1of1ForFork1_~data~0.base_301) .cse0))) |v_#memory_$Pointer$.base_628|) (= (select (select |v_#memory_int_695| v_my_callbackThread1of1ForFork1_~data~0.base_301) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_301 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_94|) (= |v_#memory_int_695| (store |v_#memory_int_696| v_my_callbackThread1of1ForFork1_~data~0.base_301 (store (select |v_#memory_int_696| v_my_callbackThread1of1ForFork1_~data~0.base_301) .cse0 1))) (= |v_#memory_$Pointer$.offset_628| (store |v_#memory_$Pointer$.offset_629| v_my_callbackThread1of1ForFork1_~data~0.base_301 (store (select |v_#memory_$Pointer$.offset_629| v_my_callbackThread1of1ForFork1_~data~0.base_301) .cse0 (select (select |v_#memory_$Pointer$.offset_628| v_my_callbackThread1of1ForFork1_~data~0.base_301) .cse0)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_301, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_301, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_629|, #memory_int=|v_#memory_int_696|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_629|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_94|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_301, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_301, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_628|, #memory_int=|v_#memory_int_695|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_111|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_628|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] and [610] L1727-4-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_399 28))) (and (< |v_#StackHeapBarrier_102| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_73| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_75|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_149| 0) (= |v_#memory_int_935| (store |v_#memory_int_936| v_my_callbackThread1of1ForFork1_~data~0.base_399 (store (select |v_#memory_int_936| v_my_callbackThread1of1ForFork1_~data~0.base_399) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_180|)))) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_104| (select (select |v_#memory_int_936| |v_~#t1~0.base_105|) |v_~#t1~0.offset_105|)) (= (store |v_#memory_$Pointer$.base_860| v_my_callbackThread1of1ForFork1_~data~0.base_399 (store (select |v_#memory_$Pointer$.base_860| v_my_callbackThread1of1ForFork1_~data~0.base_399) .cse0 (select (select |v_#memory_$Pointer$.base_859| v_my_callbackThread1of1ForFork1_~data~0.base_399) .cse0))) |v_#memory_$Pointer$.base_859|) (= (select |v_#valid_315| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_73| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_75|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_184| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_311| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_73|) (= (store |v_#memory_$Pointer$.offset_860| v_my_callbackThread1of1ForFork1_~data~0.base_399 (store (select |v_#memory_$Pointer$.offset_860| v_my_callbackThread1of1ForFork1_~data~0.base_399) .cse0 (select (select |v_#memory_$Pointer$.offset_859| v_my_callbackThread1of1ForFork1_~data~0.base_399) .cse0))) |v_#memory_$Pointer$.offset_859|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172| 0)) (= (store |v_#valid_315| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172| 1) |v_#valid_314|) (= (store |v_#length_214| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172| 4) |v_#length_213|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_131| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_311| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_73|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_860|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_311|, ~#t1~0.offset=|v_~#t1~0.offset_105|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_399, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_399, #StackHeapBarrier=|v_#StackHeapBarrier_102|, ~#t1~0.base=|v_~#t1~0.base_105|, #valid=|v_#valid_315|, #memory_int=|v_#memory_int_936|, #length=|v_#length_214|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_860|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_311|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_104|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_859|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_172|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_118|, ~#t1~0.offset=|v_~#t1~0.offset_105|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_75|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_162|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_399, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_131|, ~#t1~0.base=|v_~#t1~0.base_105|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_170|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_120|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_184|, #length=|v_#length_213|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_113|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_73|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_75|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_120|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_311|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_114|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_399, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_149|, #StackHeapBarrier=|v_#StackHeapBarrier_102|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_73|, #valid=|v_#valid_314|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_118|, #memory_int=|v_#memory_int_935|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_859|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_311|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, 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, #memory_$Pointer$.base, 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_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset] [2022-12-13 12:07:47,372 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:07:47,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-13 12:07:47,372 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 693 flow [2022-12-13 12:07:47,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:47,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:47,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:47,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:07:47,373 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-13 12:07:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash -862444817, now seen corresponding path program 1 times [2022-12-13 12:07:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:47,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473895586] [2022-12-13 12:07:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473895586] [2022-12-13 12:07:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473895586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:48,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:07:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098023977] [2022-12-13 12:07:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:48,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:07:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:07:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:07:48,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 12:07:48,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 693 flow. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-13 12:07:48,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:48,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 12:07:48,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:48,772 INFO L130 PetriNetUnfolder]: 175/430 cut-off events. [2022-12-13 12:07:48,772 INFO L131 PetriNetUnfolder]: For 2440/2440 co-relation queries the response was YES. [2022-12-13 12:07:48,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 430 events. 175/430 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2223 event pairs, 98 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2196. Up to 367 conditions per place. [2022-12-13 12:07:48,775 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 60 selfloop transitions, 11 changer transitions 24/95 dead transitions. [2022-12-13 12:07:48,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 1068 flow [2022-12-13 12:07:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:07:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:07:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-12-13 12:07:48,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21212121212121213 [2022-12-13 12:07:48,777 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 693 flow. Second operand 11 states and 56 transitions. [2022-12-13 12:07:48,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 1068 flow [2022-12-13 12:07:48,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 996 flow, removed 24 selfloop flow, removed 11 redundant places. [2022-12-13 12:07:48,784 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 657 flow [2022-12-13 12:07:48,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=657, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2022-12-13 12:07:48,785 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2022-12-13 12:07:48,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:48,785 INFO L89 Accepts]: Start accepts. Operand has 87 places, 67 transitions, 657 flow [2022-12-13 12:07:48,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:48,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:48,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 67 transitions, 657 flow [2022-12-13 12:07:48,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 67 transitions, 657 flow [2022-12-13 12:07:48,802 INFO L130 PetriNetUnfolder]: 32/173 cut-off events. [2022-12-13 12:07:48,802 INFO L131 PetriNetUnfolder]: For 727/738 co-relation queries the response was YES. [2022-12-13 12:07:48,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 173 events. 32/173 cut-off events. For 727/738 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 957 event pairs, 4 based on Foata normal form. 4/175 useless extension candidates. Maximal degree in co-relation 718. Up to 41 conditions per place. [2022-12-13 12:07:48,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 67 transitions, 657 flow [2022-12-13 12:07:48,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 12:07:48,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:48,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 12:07:48,806 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 657 flow [2022-12-13 12:07:48,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-13 12:07:48,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:48,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:48,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:07:48,807 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-13 12:07:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1564685690, now seen corresponding path program 1 times [2022-12-13 12:07:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:48,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794155599] [2022-12-13 12:07:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794155599] [2022-12-13 12:07:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794155599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:49,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 12:07:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174911575] [2022-12-13 12:07:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:07:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:07:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:07:49,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 12:07:49,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 657 flow. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-13 12:07:49,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:49,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 12:07:49,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:50,431 INFO L130 PetriNetUnfolder]: 168/416 cut-off events. [2022-12-13 12:07:50,431 INFO L131 PetriNetUnfolder]: For 2198/2198 co-relation queries the response was YES. [2022-12-13 12:07:50,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2129 conditions, 416 events. 168/416 cut-off events. For 2198/2198 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2097 event pairs, 97 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2087. Up to 340 conditions per place. [2022-12-13 12:07:50,434 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 58 selfloop transitions, 15 changer transitions 22/95 dead transitions. [2022-12-13 12:07:50,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 1024 flow [2022-12-13 12:07:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:07:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 12:07:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-12-13 12:07:50,435 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2210144927536232 [2022-12-13 12:07:50,435 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 657 flow. Second operand 12 states and 61 transitions. [2022-12-13 12:07:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 1024 flow [2022-12-13 12:07:50,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 970 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-13 12:07:50,442 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 631 flow [2022-12-13 12:07:50,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=631, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2022-12-13 12:07:50,442 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2022-12-13 12:07:50,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:50,442 INFO L89 Accepts]: Start accepts. Operand has 88 places, 64 transitions, 631 flow [2022-12-13 12:07:50,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:50,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:50,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 64 transitions, 631 flow [2022-12-13 12:07:50,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 64 transitions, 631 flow [2022-12-13 12:07:50,457 INFO L130 PetriNetUnfolder]: 29/166 cut-off events. [2022-12-13 12:07:50,457 INFO L131 PetriNetUnfolder]: For 687/694 co-relation queries the response was YES. [2022-12-13 12:07:50,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 166 events. 29/166 cut-off events. For 687/694 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 899 event pairs, 4 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 694. Up to 37 conditions per place. [2022-12-13 12:07:50,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 64 transitions, 631 flow [2022-12-13 12:07:50,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 12:07:50,460 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:50,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 12:07:50,460 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 631 flow [2022-12-13 12:07:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-13 12:07:50,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:50,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:50,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:07:50,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 459917908, now seen corresponding path program 1 times [2022-12-13 12:07:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:50,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84533738] [2022-12-13 12:07:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84533738] [2022-12-13 12:07:51,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84533738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:51,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:51,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:07:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502997063] [2022-12-13 12:07:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:07:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:07:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:07:51,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 12:07:51,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 631 flow. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-13 12:07:51,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:51,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 12:07:51,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:51,850 INFO L130 PetriNetUnfolder]: 159/390 cut-off events. [2022-12-13 12:07:51,850 INFO L131 PetriNetUnfolder]: For 2131/2131 co-relation queries the response was YES. [2022-12-13 12:07:51,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 390 events. 159/390 cut-off events. For 2131/2131 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1901 event pairs, 94 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 1976. Up to 343 conditions per place. [2022-12-13 12:07:51,854 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 60 selfloop transitions, 16 changer transitions 12/88 dead transitions. [2022-12-13 12:07:51,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 960 flow [2022-12-13 12:07:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:07:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 12:07:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-12-13 12:07:51,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21014492753623187 [2022-12-13 12:07:51,856 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 631 flow. Second operand 12 states and 58 transitions. [2022-12-13 12:07:51,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 960 flow [2022-12-13 12:07:51,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 88 transitions, 903 flow, removed 11 selfloop flow, removed 12 redundant places. [2022-12-13 12:07:51,864 INFO L231 Difference]: Finished difference. Result has 88 places, 66 transitions, 634 flow [2022-12-13 12:07:51,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=634, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2022-12-13 12:07:51,865 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2022-12-13 12:07:51,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:51,865 INFO L89 Accepts]: Start accepts. Operand has 88 places, 66 transitions, 634 flow [2022-12-13 12:07:51,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:51,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:51,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 66 transitions, 634 flow [2022-12-13 12:07:51,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 66 transitions, 634 flow [2022-12-13 12:07:51,883 INFO L130 PetriNetUnfolder]: 30/172 cut-off events. [2022-12-13 12:07:51,883 INFO L131 PetriNetUnfolder]: For 694/701 co-relation queries the response was YES. [2022-12-13 12:07:51,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 172 events. 30/172 cut-off events. For 694/701 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 954 event pairs, 5 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 716. Up to 38 conditions per place. [2022-12-13 12:07:51,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 66 transitions, 634 flow [2022-12-13 12:07:51,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 12:07:52,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|)) |v_#memory_$Pointer$.base_65|) (= |v_#memory_int_90| (store |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| (select (select |v_#memory_int_90| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|)))) (= (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|)) |v_#memory_$Pointer$.offset_65|)) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_91|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_66|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_10|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_65|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_90|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_65|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [570] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.offset_31| 0) (= |v_#pthreadsMutex_223| (store |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111 (store (select |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111) v_my_callbackThread1of1ForFork0_~data~0.offset_111 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_31| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_224|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} OutVars{#pthreadsMutex=|v_#pthreadsMutex_223|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_31|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_31|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 12:07:52,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L1712: Formula: (let ((.cse1 (select |v_#pthreadsMutex_527| v_my_callbackThread1of1ForFork0_~data~0.base_341)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_341 24))) (and (= (store |v_#memory_$Pointer$.offset_897| v_my_callbackThread1of1ForFork0_~data~0.base_341 (store (select |v_#memory_$Pointer$.offset_897| v_my_callbackThread1of1ForFork0_~data~0.base_341) .cse0 (select (select |v_#memory_$Pointer$.offset_896| v_my_callbackThread1of1ForFork0_~data~0.base_341) .cse0))) |v_#memory_$Pointer$.offset_896|) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_341) 0) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62) (= (store |v_#memory_$Pointer$.base_897| v_my_callbackThread1of1ForFork0_~data~0.base_341 (store (select |v_#memory_$Pointer$.base_897| v_my_callbackThread1of1ForFork0_~data~0.base_341) .cse0 (select (select |v_#memory_$Pointer$.base_896| v_my_callbackThread1of1ForFork0_~data~0.base_341) .cse0))) |v_#memory_$Pointer$.base_896|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_68 v_my_callbackThread1of1ForFork0_~__mptr~0.base_62) (= |v_my_callbackThread1of1ForFork0_#t~mem32_223| (select (select |v_#memory_int_965| v_my_callbackThread1of1ForFork0_~data~0.base_341) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_341 28))) (= v_my_callbackThread1of1ForFork0_~data~0.base_341 v_my_callbackThread1of1ForFork0_~__mptr~0.base_62) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_68 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_90| v_my_callbackThread1of1ForFork0_~arg.base_68) (= v_my_callbackThread1of1ForFork0_~arg.offset_68 v_my_callbackThread1of1ForFork0_~dev~0.offset_68) (= (store |v_#pthreadsMutex_527| v_my_callbackThread1of1ForFork0_~data~0.base_341 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_341 1)) |v_#pthreadsMutex_526|) (= (store |v_#memory_int_966| v_my_callbackThread1of1ForFork0_~data~0.base_341 (store (select |v_#memory_int_966| v_my_callbackThread1of1ForFork0_~data~0.base_341) .cse0 1)) |v_#memory_int_965|) (= v_my_callbackThread1of1ForFork0_~arg.offset_68 |v_my_callbackThread1of1ForFork0_#in~arg.offset_90|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_68 v_my_callbackThread1of1ForFork0_~arg.base_68))) InVars {#pthreadsMutex=|v_#pthreadsMutex_527|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_90|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_897|, #memory_int=|v_#memory_int_966|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_90|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_897|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_526|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_223|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_896|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_68, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_90|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_66|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_62, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_341, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_341, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_90|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_68, #memory_int=|v_#memory_int_965|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_62, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_68, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_68, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_896|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [592] L1727-4-->L1735: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 0)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_106| 0) (= (store |v_#length_126| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 4) |v_#length_125|) (= (select (select |v_#memory_int_555| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (select |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_53| 0) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= (store |v_#valid_177| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93| 1) |v_#valid_176|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_211| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_58|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_177|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, #memory_int=|v_#memory_int_555|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_126|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_93|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_48|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_106|, #length=|v_#length_125|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_48|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_211|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_58|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_89|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_176|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_555|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_211|} 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_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] [2022-12-13 12:07:52,971 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:07:52,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1107 [2022-12-13 12:07:52,972 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 655 flow [2022-12-13 12:07:52,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-13 12:07:52,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:52,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:52,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:07:52,973 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-13 12:07:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1059798633, now seen corresponding path program 1 times [2022-12-13 12:07:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:52,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503117118] [2022-12-13 12:07:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:53,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503117118] [2022-12-13 12:07:53,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503117118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:53,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:53,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:07:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945618043] [2022-12-13 12:07:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:53,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:07:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:07:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:07:53,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 12:07:53,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 655 flow. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:53,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:53,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 12:07:53,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:54,145 INFO L130 PetriNetUnfolder]: 149/365 cut-off events. [2022-12-13 12:07:54,146 INFO L131 PetriNetUnfolder]: For 2106/2106 co-relation queries the response was YES. [2022-12-13 12:07:54,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 365 events. 149/365 cut-off events. For 2106/2106 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1729 event pairs, 98 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1876. Up to 336 conditions per place. [2022-12-13 12:07:54,148 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 52 selfloop transitions, 9 changer transitions 12/73 dead transitions. [2022-12-13 12:07:54,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 73 transitions, 853 flow [2022-12-13 12:07:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:07:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:07:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-12-13 12:07:54,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18376068376068377 [2022-12-13 12:07:54,149 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 655 flow. Second operand 9 states and 43 transitions. [2022-12-13 12:07:54,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 73 transitions, 853 flow [2022-12-13 12:07:54,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 794 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-13 12:07:54,155 INFO L231 Difference]: Finished difference. Result has 84 places, 57 transitions, 518 flow [2022-12-13 12:07:54,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=84, PETRI_TRANSITIONS=57} [2022-12-13 12:07:54,156 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2022-12-13 12:07:54,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:54,156 INFO L89 Accepts]: Start accepts. Operand has 84 places, 57 transitions, 518 flow [2022-12-13 12:07:54,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:54,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:54,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 57 transitions, 518 flow [2022-12-13 12:07:54,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 57 transitions, 518 flow [2022-12-13 12:07:54,171 INFO L130 PetriNetUnfolder]: 28/154 cut-off events. [2022-12-13 12:07:54,171 INFO L131 PetriNetUnfolder]: For 563/569 co-relation queries the response was YES. [2022-12-13 12:07:54,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 154 events. 28/154 cut-off events. For 563/569 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 809 event pairs, 5 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 603. Up to 35 conditions per place. [2022-12-13 12:07:54,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 57 transitions, 518 flow [2022-12-13 12:07:54,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 12:07:54,176 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:54,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 12:07:54,177 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 518 flow [2022-12-13 12:07:54,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:54,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:54,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:54,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:07:54,177 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:54,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:54,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1012464140, now seen corresponding path program 6 times [2022-12-13 12:07:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:54,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499263729] [2022-12-13 12:07:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499263729] [2022-12-13 12:07:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499263729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066400615] [2022-12-13 12:07:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:55,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:07:55,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 518 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:55,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:55,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:07:55,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:55,965 INFO L130 PetriNetUnfolder]: 158/390 cut-off events. [2022-12-13 12:07:55,965 INFO L131 PetriNetUnfolder]: For 1871/1871 co-relation queries the response was YES. [2022-12-13 12:07:55,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 390 events. 158/390 cut-off events. For 1871/1871 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1900 event pairs, 83 based on Foata normal form. 2/391 useless extension candidates. Maximal degree in co-relation 1825. Up to 255 conditions per place. [2022-12-13 12:07:55,968 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 53 selfloop transitions, 24 changer transitions 19/96 dead transitions. [2022-12-13 12:07:55,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 96 transitions, 969 flow [2022-12-13 12:07:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-12-13 12:07:55,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2490842490842491 [2022-12-13 12:07:55,969 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 518 flow. Second operand 13 states and 68 transitions. [2022-12-13 12:07:55,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 96 transitions, 969 flow [2022-12-13 12:07:55,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 897 flow, removed 19 selfloop flow, removed 16 redundant places. [2022-12-13 12:07:55,974 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 590 flow [2022-12-13 12:07:55,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=590, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2022-12-13 12:07:55,974 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2022-12-13 12:07:55,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:55,975 INFO L89 Accepts]: Start accepts. Operand has 79 places, 61 transitions, 590 flow [2022-12-13 12:07:55,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:55,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:55,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 61 transitions, 590 flow [2022-12-13 12:07:55,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 61 transitions, 590 flow [2022-12-13 12:07:55,993 INFO L130 PetriNetUnfolder]: 27/151 cut-off events. [2022-12-13 12:07:55,993 INFO L131 PetriNetUnfolder]: For 539/544 co-relation queries the response was YES. [2022-12-13 12:07:55,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 151 events. 27/151 cut-off events. For 539/544 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 783 event pairs, 6 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 616. Up to 35 conditions per place. [2022-12-13 12:07:55,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 61 transitions, 590 flow [2022-12-13 12:07:55,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 12:07:56,256 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:56,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-13 12:07:56,257 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 590 flow [2022-12-13 12:07:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:56,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:56,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:56,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:07:56,257 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-13 12:07:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 754184184, now seen corresponding path program 7 times [2022-12-13 12:07:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606879377] [2022-12-13 12:07:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:57,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606879377] [2022-12-13 12:07:57,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606879377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:57,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:57,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539787894] [2022-12-13 12:07:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:57,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:57,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:57,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:57,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:07:57,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 590 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:57,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:57,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:07:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:57,874 INFO L130 PetriNetUnfolder]: 162/402 cut-off events. [2022-12-13 12:07:57,874 INFO L131 PetriNetUnfolder]: For 2011/2011 co-relation queries the response was YES. [2022-12-13 12:07:57,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 402 events. 162/402 cut-off events. For 2011/2011 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1978 event pairs, 52 based on Foata normal form. 2/403 useless extension candidates. Maximal degree in co-relation 1998. Up to 315 conditions per place. [2022-12-13 12:07:57,876 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 64 selfloop transitions, 16 changer transitions 26/106 dead transitions. [2022-12-13 12:07:57,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 1136 flow [2022-12-13 12:07:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 12:07:57,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24175824175824176 [2022-12-13 12:07:57,877 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 590 flow. Second operand 13 states and 66 transitions. [2022-12-13 12:07:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 1136 flow [2022-12-13 12:07:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 1054 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-13 12:07:57,882 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 726 flow [2022-12-13 12:07:57,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=726, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2022-12-13 12:07:57,883 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2022-12-13 12:07:57,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:57,883 INFO L89 Accepts]: Start accepts. Operand has 87 places, 73 transitions, 726 flow [2022-12-13 12:07:57,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:57,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:57,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 73 transitions, 726 flow [2022-12-13 12:07:57,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 73 transitions, 726 flow [2022-12-13 12:07:57,905 INFO L130 PetriNetUnfolder]: 37/178 cut-off events. [2022-12-13 12:07:57,905 INFO L131 PetriNetUnfolder]: For 828/834 co-relation queries the response was YES. [2022-12-13 12:07:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 178 events. 37/178 cut-off events. For 828/834 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 952 event pairs, 5 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 808. Up to 42 conditions per place. [2022-12-13 12:07:57,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 73 transitions, 726 flow [2022-12-13 12:07:57,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 12:07:57,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:57,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 12:07:57,913 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 726 flow [2022-12-13 12:07:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:57,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:57,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:57,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:07:57,913 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-13 12:07:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 702329248, now seen corresponding path program 8 times [2022-12-13 12:07:57,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:57,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316519822] [2022-12-13 12:07:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:59,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316519822] [2022-12-13 12:07:59,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316519822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:59,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:59,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:07:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739528908] [2022-12-13 12:07:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:59,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:07:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:07:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:07:59,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:07:59,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 726 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:59,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:59,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:07:59,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:59,638 INFO L130 PetriNetUnfolder]: 161/400 cut-off events. [2022-12-13 12:07:59,639 INFO L131 PetriNetUnfolder]: For 2149/2149 co-relation queries the response was YES. [2022-12-13 12:07:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 400 events. 161/400 cut-off events. For 2149/2149 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1958 event pairs, 41 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2082. Up to 296 conditions per place. [2022-12-13 12:07:59,641 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 68 selfloop transitions, 23 changer transitions 26/117 dead transitions. [2022-12-13 12:07:59,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 117 transitions, 1317 flow [2022-12-13 12:07:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:07:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:07:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-13 12:07:59,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 12:07:59,642 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 726 flow. Second operand 13 states and 65 transitions. [2022-12-13 12:07:59,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 117 transitions, 1317 flow [2022-12-13 12:07:59,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 117 transitions, 1209 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-12-13 12:07:59,647 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 889 flow [2022-12-13 12:07:59,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=889, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2022-12-13 12:07:59,648 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places. [2022-12-13 12:07:59,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:59,648 INFO L89 Accepts]: Start accepts. Operand has 93 places, 84 transitions, 889 flow [2022-12-13 12:07:59,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:59,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:59,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 84 transitions, 889 flow [2022-12-13 12:07:59,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 84 transitions, 889 flow [2022-12-13 12:07:59,665 INFO L130 PetriNetUnfolder]: 42/183 cut-off events. [2022-12-13 12:07:59,665 INFO L131 PetriNetUnfolder]: For 1002/1010 co-relation queries the response was YES. [2022-12-13 12:07:59,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 183 events. 42/183 cut-off events. For 1002/1010 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 969 event pairs, 3 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 863. Up to 39 conditions per place. [2022-12-13 12:07:59,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 84 transitions, 889 flow [2022-12-13 12:07:59,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 12:07:59,667 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:07:59,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 12:07:59,668 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 889 flow [2022-12-13 12:07:59,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:59,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:59,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:59,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:07:59,668 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-13 12:07:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -166238644, now seen corresponding path program 9 times [2022-12-13 12:07:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:59,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890263856] [2022-12-13 12:07:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:59,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:00,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:00,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890263856] [2022-12-13 12:08:00,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890263856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:00,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:00,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:08:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144454686] [2022-12-13 12:08:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:00,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:08:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:08:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:08:00,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 12:08:00,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 889 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:00,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:00,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 12:08:00,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:01,458 INFO L130 PetriNetUnfolder]: 160/397 cut-off events. [2022-12-13 12:08:01,458 INFO L131 PetriNetUnfolder]: For 2429/2429 co-relation queries the response was YES. [2022-12-13 12:08:01,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 397 events. 160/397 cut-off events. For 2429/2429 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1942 event pairs, 35 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2129. Up to 269 conditions per place. [2022-12-13 12:08:01,461 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 74 selfloop transitions, 27 changer transitions 21/122 dead transitions. [2022-12-13 12:08:01,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 1412 flow [2022-12-13 12:08:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:08:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:08:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-12-13 12:08:01,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25274725274725274 [2022-12-13 12:08:01,463 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 889 flow. Second operand 13 states and 69 transitions. [2022-12-13 12:08:01,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 1412 flow [2022-12-13 12:08:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 122 transitions, 1345 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-13 12:08:01,472 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 978 flow [2022-12-13 12:08:01,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=978, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2022-12-13 12:08:01,472 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2022-12-13 12:08:01,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:01,473 INFO L89 Accepts]: Start accepts. Operand has 98 places, 88 transitions, 978 flow [2022-12-13 12:08:01,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:01,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:01,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 88 transitions, 978 flow [2022-12-13 12:08:01,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 978 flow [2022-12-13 12:08:01,497 INFO L130 PetriNetUnfolder]: 42/183 cut-off events. [2022-12-13 12:08:01,497 INFO L131 PetriNetUnfolder]: For 1107/1111 co-relation queries the response was YES. [2022-12-13 12:08:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 183 events. 42/183 cut-off events. For 1107/1111 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 948 event pairs, 4 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 916. Up to 40 conditions per place. [2022-12-13 12:08:01,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 88 transitions, 978 flow [2022-12-13 12:08:01,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 12:08:01,582 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:01,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 12:08:01,583 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 982 flow [2022-12-13 12:08:01,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:01,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:01,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:01,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:08:01,584 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-13 12:08:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1194925010, now seen corresponding path program 10 times [2022-12-13 12:08:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052586353] [2022-12-13 12:08:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052586353] [2022-12-13 12:08:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052586353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:08:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533029289] [2022-12-13 12:08:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:02,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:08:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:08:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:08:02,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 12:08:02,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 982 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:02,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:02,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 12:08:02,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:03,257 INFO L130 PetriNetUnfolder]: 143/349 cut-off events. [2022-12-13 12:08:03,257 INFO L131 PetriNetUnfolder]: For 2492/2492 co-relation queries the response was YES. [2022-12-13 12:08:03,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 349 events. 143/349 cut-off events. For 2492/2492 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1597 event pairs, 30 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 1988. Up to 247 conditions per place. [2022-12-13 12:08:03,260 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 64 selfloop transitions, 19 changer transitions 26/109 dead transitions. [2022-12-13 12:08:03,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1310 flow [2022-12-13 12:08:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:08:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:08:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-12-13 12:08:03,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21328671328671328 [2022-12-13 12:08:03,261 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 982 flow. Second operand 13 states and 61 transitions. [2022-12-13 12:08:03,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1310 flow [2022-12-13 12:08:03,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 109 transitions, 1230 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-12-13 12:08:03,268 INFO L231 Difference]: Finished difference. Result has 101 places, 78 transitions, 857 flow [2022-12-13 12:08:03,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=857, PETRI_PLACES=101, PETRI_TRANSITIONS=78} [2022-12-13 12:08:03,269 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2022-12-13 12:08:03,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:03,269 INFO L89 Accepts]: Start accepts. Operand has 101 places, 78 transitions, 857 flow [2022-12-13 12:08:03,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:03,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:03,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 78 transitions, 857 flow [2022-12-13 12:08:03,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 78 transitions, 857 flow [2022-12-13 12:08:03,284 INFO L130 PetriNetUnfolder]: 39/159 cut-off events. [2022-12-13 12:08:03,284 INFO L131 PetriNetUnfolder]: For 1011/1017 co-relation queries the response was YES. [2022-12-13 12:08:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 159 events. 39/159 cut-off events. For 1011/1017 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 761 event pairs, 4 based on Foata normal form. 4/159 useless extension candidates. Maximal degree in co-relation 762. Up to 34 conditions per place. [2022-12-13 12:08:03,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 78 transitions, 857 flow [2022-12-13 12:08:03,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 12:08:05,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:05,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2267 [2022-12-13 12:08:05,536 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 861 flow [2022-12-13 12:08:05,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:05,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:05,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:05,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 12:08:05,537 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-13 12:08:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 777726268, now seen corresponding path program 1 times [2022-12-13 12:08:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:05,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083003521] [2022-12-13 12:08:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:06,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083003521] [2022-12-13 12:08:06,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083003521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:06,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:06,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 12:08:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775873131] [2022-12-13 12:08:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:06,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:08:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:08:06,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:08:06,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 12:08:06,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 861 flow. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-13 12:08:06,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:06,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 12:08:06,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:07,075 INFO L130 PetriNetUnfolder]: 137/334 cut-off events. [2022-12-13 12:08:07,076 INFO L131 PetriNetUnfolder]: For 2360/2360 co-relation queries the response was YES. [2022-12-13 12:08:07,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 334 events. 137/334 cut-off events. For 2360/2360 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1525 event pairs, 27 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 1734. Up to 237 conditions per place. [2022-12-13 12:08:07,078 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 71 selfloop transitions, 31 changer transitions 11/113 dead transitions. [2022-12-13 12:08:07,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 113 transitions, 1305 flow [2022-12-13 12:08:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:08:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 12:08:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-12-13 12:08:07,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21739130434782608 [2022-12-13 12:08:07,079 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 861 flow. Second operand 14 states and 70 transitions. [2022-12-13 12:08:07,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 113 transitions, 1305 flow [2022-12-13 12:08:07,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 113 transitions, 1204 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-13 12:08:07,086 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 943 flow [2022-12-13 12:08:07,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=943, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2022-12-13 12:08:07,086 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2022-12-13 12:08:07,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:07,087 INFO L89 Accepts]: Start accepts. Operand has 103 places, 87 transitions, 943 flow [2022-12-13 12:08:07,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:07,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:07,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 87 transitions, 943 flow [2022-12-13 12:08:07,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 87 transitions, 943 flow [2022-12-13 12:08:07,104 INFO L130 PetriNetUnfolder]: 41/172 cut-off events. [2022-12-13 12:08:07,104 INFO L131 PetriNetUnfolder]: For 1073/1081 co-relation queries the response was YES. [2022-12-13 12:08:07,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 172 events. 41/172 cut-off events. For 1073/1081 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 5 based on Foata normal form. 4/172 useless extension candidates. Maximal degree in co-relation 851. Up to 40 conditions per place. [2022-12-13 12:08:07,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 87 transitions, 943 flow [2022-12-13 12:08:07,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 12:08:07,232 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:07,233 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:07,240 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:07,241 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:07,242 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:07,243 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:07,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] $Ultimate##0-->L1712: Formula: (let ((.cse0 (select |v_#pthreadsMutex_555| v_my_callbackThread1of1ForFork0_~data~0.base_378)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_378 24))) (and (= (store |v_#pthreadsMutex_555| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_378 1)) |v_#pthreadsMutex_554|) (= v_my_callbackThread1of1ForFork0_~arg.offset_79 v_my_callbackThread1of1ForFork0_~dev~0.offset_79) (= v_my_callbackThread1of1ForFork0_~dev~0.base_79 v_my_callbackThread1of1ForFork0_~__mptr~0.base_73) (= (store |v_#memory_$Pointer$.offset_1043| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.offset_1043| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse1 (select (select |v_#memory_$Pointer$.offset_1042| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse1))) |v_#memory_$Pointer$.offset_1042|) (= v_my_callbackThread1of1ForFork0_~data~0.base_378 v_my_callbackThread1of1ForFork0_~__mptr~0.base_73) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_79 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_73) (= (store |v_#memory_$Pointer$.base_1043| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.base_1043| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse1 (select (select |v_#memory_$Pointer$.base_1042| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse1))) |v_#memory_$Pointer$.base_1042|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_378) 0) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_73) (= |v_my_callbackThread1of1ForFork0_#t~mem32_259| (select (select |v_#memory_int_1102| v_my_callbackThread1of1ForFork0_~data~0.base_378) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_378 28))) (= v_my_callbackThread1of1ForFork0_~dev~0.base_79 v_my_callbackThread1of1ForFork0_~arg.base_79) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_118| v_my_callbackThread1of1ForFork0_~arg.base_79) (= |v_#memory_int_1102| (store |v_#memory_int_1103| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_int_1103| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse1 1))) (= v_my_callbackThread1of1ForFork0_~arg.offset_79 |v_my_callbackThread1of1ForFork0_#in~arg.offset_118|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_555|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_118|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1043|, #memory_int=|v_#memory_int_1103|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_118|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1043|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_554|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_259|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1042|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_79, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_118|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_77|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_73, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_378, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_378, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_118|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_79, #memory_int=|v_#memory_int_1102|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_73, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_79, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_79, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1042|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [461] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.base_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|)) |v_#memory_$Pointer$.base_65|) (= |v_#memory_int_90| (store |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| (select (select |v_#memory_int_90| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|)))) (= (store |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_66| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|)) |v_#memory_$Pointer$.offset_65|)) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_91|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_66|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_10|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_65|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_90|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_65|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 12:08:07,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:08:07,773 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: failed to undo transition, perhaps due to illegal composition at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:886) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.adaptRun(SequenceRule.java:839) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:161) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:82) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:290) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:237) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetNot1SafeException: Petri net not 1-safe The following places may contain more than one token.[Black: 401#(and (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= (+ |ULTIMATE.start_main_~#data~1#1.offset| 24) |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |ULTIMATE.start_main_~#data~1#1.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_main_~#data~1#1.offset| 24)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) 1))] at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:887) ... 29 more [2022-12-13 12:08:07,778 INFO L158 Benchmark]: Toolchain (without parser) took 97118.98ms. Allocated memory was 224.4MB in the beginning and 902.8MB in the end (delta: 678.4MB). Free memory was 179.0MB in the beginning and 441.7MB in the end (delta: -262.7MB). Peak memory consumption was 416.8MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,778 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 224.4MB. Free memory was 201.2MB in the beginning and 201.1MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:08:07,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.95ms. Allocated memory is still 224.4MB. Free memory was 179.0MB in the beginning and 124.5MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.09ms. Allocated memory is still 224.4MB. Free memory was 124.5MB in the beginning and 121.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,778 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 224.4MB. Free memory was 121.3MB in the beginning and 118.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,778 INFO L158 Benchmark]: RCFGBuilder took 486.76ms. Allocated memory is still 224.4MB. Free memory was 118.2MB in the beginning and 94.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,779 INFO L158 Benchmark]: TraceAbstraction took 95887.35ms. Allocated memory was 224.4MB in the beginning and 902.8MB in the end (delta: 678.4MB). Free memory was 93.6MB in the beginning and 441.7MB in the end (delta: -348.1MB). Peak memory consumption was 331.9MB. Max. memory is 8.0GB. [2022-12-13 12:08:07,780 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.10ms. Allocated memory is still 224.4MB. Free memory was 201.2MB in the beginning and 201.1MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 660.95ms. Allocated memory is still 224.4MB. Free memory was 179.0MB in the beginning and 124.5MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.09ms. Allocated memory is still 224.4MB. Free memory was 124.5MB in the beginning and 121.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 224.4MB. Free memory was 121.3MB in the beginning and 118.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 486.76ms. Allocated memory is still 224.4MB. Free memory was 118.2MB in the beginning and 94.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 95887.35ms. Allocated memory was 224.4MB in the beginning and 902.8MB in the end (delta: 678.4MB). Free memory was 93.6MB in the beginning and 441.7MB in the end (delta: -348.1MB). Peak memory consumption was 331.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4s, 162 PlacesBefore, 55 PlacesAfterwards, 162 TransitionsBefore, 51 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 3256, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2059, independent: 2016, independent conditional: 0, independent unconditional: 2016, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2059, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21889, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 21583, unknown conditional: 0, unknown unconditional: 21583] ], Cache Queries: [ total: 3379, independent: 1240, independent conditional: 0, independent unconditional: 1240, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 4165, Positive cache size: 4132, Positive conditional cache size: 0, Positive unconditional cache size: 4132, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4s, 49 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 460, independent: 382, independent conditional: 382, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 460, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 460, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 460, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 194, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 194, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13211, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 12906, unknown conditional: 0, unknown unconditional: 12906] ], Cache Queries: [ total: 460, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 204, unknown conditional: 0, unknown unconditional: 204] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 51 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 1050 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 12, independent unconditional: 131, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 143, independent conditional: 12, independent unconditional: 131, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 12, independent unconditional: 131, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 35, independent conditional: 4, independent unconditional: 31, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4451, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 104, dependent conditional: 100, dependent unconditional: 5, unknown: 4334, unknown conditional: 4334, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 108, independent conditional: 8, independent unconditional: 100, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 45, unknown conditional: 11, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 199, Positive conditional cache size: 4, Positive unconditional cache size: 195, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 8, Unknown conditional cache size: 2, Unknown unconditional cache size: 6, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 52 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1250 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1067, independent: 965, independent conditional: 965, independent unconditional: 0, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1067, independent: 965, independent conditional: 68, independent unconditional: 897, dependent: 102, dependent conditional: 6, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1067, independent: 965, independent conditional: 68, independent unconditional: 897, dependent: 102, dependent conditional: 6, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1067, independent: 965, independent conditional: 68, independent unconditional: 897, dependent: 102, dependent conditional: 6, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1067, independent: 910, independent conditional: 68, independent unconditional: 842, dependent: 97, dependent conditional: 4, dependent unconditional: 93, unknown: 60, unknown conditional: 2, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 294, Positive conditional cache size: 4, Positive unconditional cache size: 290, Negative cache size: 35, Negative conditional cache size: 5, Negative unconditional cache size: 30, Unknown cache size: 8, Unknown conditional cache size: 2, Unknown unconditional cache size: 6, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 296, Positive conditional cache size: 4, Positive unconditional cache size: 292, Negative cache size: 37, Negative conditional cache size: 5, Negative unconditional cache size: 32, Unknown cache size: 8, Unknown conditional cache size: 2, Unknown unconditional cache size: 6, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 31 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4172, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4168, unknown conditional: 0, unknown unconditional: 4168] ], Cache Queries: [ total: 33, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 13, unknown conditional: 3, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 305, Positive conditional cache size: 7, Positive unconditional cache size: 298, Negative cache size: 37, Negative conditional cache size: 5, Negative unconditional cache size: 32, Unknown cache size: 10, Unknown conditional cache size: 2, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, independent: 303, independent conditional: 303, independent unconditional: 0, dependent: 36, dependent conditional: 35, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 309, Positive conditional cache size: 10, Positive unconditional cache size: 299, Negative cache size: 40, Negative conditional cache size: 7, Negative unconditional cache size: 33, Unknown cache size: 10, Unknown conditional cache size: 2, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 45, dependent conditional: 17, dependent unconditional: 28, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 45, dependent conditional: 17, dependent unconditional: 28, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 45, dependent conditional: 17, dependent unconditional: 28, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2695, independent: 404, independent conditional: 404, independent unconditional: 0, dependent: 108, dependent conditional: 103, dependent unconditional: 5, unknown: 2183, unknown conditional: 2183, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 19, unknown conditional: 17, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 323, Positive conditional cache size: 20, Positive unconditional cache size: 303, Negative cache size: 47, Negative conditional cache size: 12, Negative unconditional cache size: 35, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 323, Positive conditional cache size: 20, Positive unconditional cache size: 303, Negative cache size: 49, Negative conditional cache size: 14, Negative unconditional cache size: 35, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 61 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 17, dependent conditional: 5, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, independent: 256, independent conditional: 256, independent unconditional: 0, dependent: 15, dependent conditional: 12, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 23, independent conditional: 12, independent unconditional: 11, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 326, Positive conditional cache size: 22, Positive unconditional cache size: 304, Negative cache size: 53, Negative conditional cache size: 16, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 70 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 32, independent conditional: 19, independent unconditional: 13, dependent: 25, dependent conditional: 12, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 32, independent conditional: 19, independent unconditional: 13, dependent: 31, dependent conditional: 18, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 32, independent conditional: 19, independent unconditional: 13, dependent: 31, dependent conditional: 18, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 28, independent conditional: 15, independent unconditional: 13, dependent: 25, dependent conditional: 12, dependent unconditional: 13, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 363, Positive conditional cache size: 26, Positive unconditional cache size: 337, Negative cache size: 59, Negative conditional cache size: 22, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 81 PlacesBefore, 80 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 366, Positive conditional cache size: 26, Positive unconditional cache size: 340, Negative cache size: 61, Negative conditional cache size: 24, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 26, dependent conditional: 25, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 28, dependent conditional: 27, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 28, dependent conditional: 27, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 26, dependent conditional: 25, dependent unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 366, Positive conditional cache size: 26, Positive unconditional cache size: 340, Negative cache size: 63, Negative conditional cache size: 26, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 85 PlacesBefore, 83 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 50, dependent conditional: 48, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 50, dependent conditional: 48, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 50, dependent conditional: 48, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 48, dependent conditional: 46, dependent unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 370, Positive conditional cache size: 26, Positive unconditional cache size: 344, Negative cache size: 65, Negative conditional cache size: 28, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 24, dependent conditional: 24, 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: 25, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 370, Positive conditional cache size: 26, Positive unconditional cache size: 344, Negative cache size: 65, Negative conditional cache size: 28, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 22, dependent conditional: 21, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 22, dependent conditional: 21, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 22, dependent conditional: 21, dependent unconditional: 1, 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: 46, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 22, dependent conditional: 21, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 370, Positive conditional cache size: 26, Positive unconditional cache size: 344, Negative cache size: 65, Negative conditional cache size: 28, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 86 PlacesBefore, 84 PlacesAfterwards, 66 TransitionsBefore, 64 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 24, dependent conditional: 22, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 24, dependent conditional: 22, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 24, dependent conditional: 22, dependent unconditional: 2, 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: 48, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 24, dependent conditional: 22, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 376, Positive conditional cache size: 26, Positive unconditional cache size: 350, Negative cache size: 65, Negative conditional cache size: 28, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 18, dependent conditional: 17, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 21, dependent conditional: 20, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 21, dependent conditional: 20, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 20, dependent conditional: 19, dependent unconditional: 1, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 376, Positive conditional cache size: 26, Positive unconditional cache size: 350, Negative cache size: 66, Negative conditional cache size: 29, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 75 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 23, dependent conditional: 22, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 32, dependent conditional: 31, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 32, dependent conditional: 31, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 29, dependent conditional: 28, dependent unconditional: 1, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 378, Positive conditional cache size: 28, Positive unconditional cache size: 350, Negative cache size: 69, Negative conditional cache size: 32, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 18, independent unconditional: 17, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 35, independent conditional: 18, independent unconditional: 17, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 35, independent conditional: 18, independent unconditional: 17, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 34, independent conditional: 18, independent unconditional: 16, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 379, Positive conditional cache size: 28, Positive unconditional cache size: 351, Negative cache size: 71, Negative conditional cache size: 34, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 23, dependent conditional: 0, dependent unconditional: 23, 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: 26, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 379, Positive conditional cache size: 28, Positive unconditional cache size: 351, Negative cache size: 71, Negative conditional cache size: 34, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 94 PlacesBefore, 94 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 200, independent: 144, independent conditional: 100, independent unconditional: 44, dependent: 56, dependent conditional: 12, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 204, independent: 144, independent conditional: 100, independent unconditional: 44, dependent: 60, dependent conditional: 16, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204, independent: 144, independent conditional: 100, independent unconditional: 44, dependent: 60, dependent conditional: 16, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, independent: 142, independent conditional: 98, independent unconditional: 44, dependent: 58, dependent conditional: 14, dependent unconditional: 44, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 383, Positive conditional cache size: 30, Positive unconditional cache size: 353, Negative cache size: 73, Negative conditional cache size: 36, Negative unconditional cache size: 37, Unknown cache size: 11, Unknown conditional cache size: 3, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 92 PlacesBefore, 92 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 46, dependent conditional: 6, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 56, dependent conditional: 16, dependent unconditional: 40, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 56, dependent conditional: 16, dependent unconditional: 40, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2146, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2143, unknown conditional: 2143, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 55, dependent conditional: 15, dependent unconditional: 40, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 385, Positive conditional cache size: 30, Positive unconditional cache size: 355, Negative cache size: 74, Negative conditional cache size: 37, Negative unconditional cache size: 37, Unknown cache size: 12, Unknown conditional cache size: 4, Unknown unconditional cache size: 8, Eliminated conditions: 0, Maximal queried relation: 2 - ExceptionOrErrorResult: AssertionError: failed to undo transition, perhaps due to illegal composition de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: failed to undo transition, perhaps due to illegal composition: de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.undoTransition(SequenceRule.java:886) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-13 12:08:07,872 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...